About the Execution of ITS-Tools for MedleyA-PT-18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 980.512 | 775848.00 | 949353.00 | 366.20 | FFFFFTFFTFTFFFTT | normal |
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-177969020000236.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-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000236
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 8.9K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 158K 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-18-LTLFireability-00
FORMULA_NAME MedleyA-PT-18-LTLFireability-01
FORMULA_NAME MedleyA-PT-18-LTLFireability-02
FORMULA_NAME MedleyA-PT-18-LTLFireability-03
FORMULA_NAME MedleyA-PT-18-LTLFireability-04
FORMULA_NAME MedleyA-PT-18-LTLFireability-05
FORMULA_NAME MedleyA-PT-18-LTLFireability-06
FORMULA_NAME MedleyA-PT-18-LTLFireability-07
FORMULA_NAME MedleyA-PT-18-LTLFireability-08
FORMULA_NAME MedleyA-PT-18-LTLFireability-09
FORMULA_NAME MedleyA-PT-18-LTLFireability-10
FORMULA_NAME MedleyA-PT-18-LTLFireability-11
FORMULA_NAME MedleyA-PT-18-LTLFireability-12
FORMULA_NAME MedleyA-PT-18-LTLFireability-13
FORMULA_NAME MedleyA-PT-18-LTLFireability-14
FORMULA_NAME MedleyA-PT-18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779701230164
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-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 09:27:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 09:27:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:27:11] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2026-05-25 09:27:11] [INFO ] Transformed 252 places.
[2026-05-25 09:27:11] [INFO ] Transformed 543 transitions.
[2026-05-25 09:27:11] [INFO ] Found NUPN structural information;
[2026-05-25 09:27:11] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-18-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 211 transition count 476
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 211 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 209 transition count 474
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 209 transition count 474
Applied a total of 86 rules in 35 ms. Remains 209 /252 variables (removed 43) and now considering 474/541 (removed 67) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16449614499140782982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10404357358921300915.kers'
[2026-05-25 09:27:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16449614499140782982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10404357358921300915.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 474 rows 209 cols 2298 entries
Finished phase 1 with 201 SingleSign rule and 1 generalized
[2026-05-25 09:27:12] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10404357358921300915.kers
Total runtime 3 ms.
[2026-05-25 09:27:12] [INFO ] Implicit Places using invariants in 295 ms returned []
[2026-05-25 09:27:12] [INFO ] Invariant cache hit.
[2026-05-25 09:27:12] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2026-05-25 09:27:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 209/683 variables, and 55 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/209 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
At refinement iteration 6 (OVERLAPS) 474/683 variables, 209/271 constraints. Problems are: Problem set: 50 solved, 423 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/683 variables, 423/694 constraints. Problems are: Problem set: 50 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 683/683 variables, and 694 constraints, problems are : Problem set: 50 solved, 423 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 423/473 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60424ms problems are : Problem set: 50 solved, 423 unsolved
Search for dead transitions found 50 dead transitions in 60437ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 209/252 places, 424/541 transitions.
Applied a total of 0 rules in 6 ms. Remains 209 /209 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61173 ms. Remains : 209/252 places, 424/541 transitions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 424/424 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 424/424 (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-12837877729830753099.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6509929305643922940.kers'
[2026-05-25 09:28:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12837877729830753099.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6509929305643922940.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 424 rows 209 cols 1798 entries
Finished phase 1 with 201 SingleSign rule and 1 generalized
[2026-05-25 09:28:13] [INFO ] Computed 7 invariants in 15 ms
Computed 7 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-6509929305643922940.kers
Total runtime 15 ms.
[2026-05-25 09:28:13] [INFO ] Implicit Places using invariants in 292 ms returned []
[2026-05-25 09:28:13] [INFO ] Invariant cache hit.
[2026-05-25 09:28:13] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 423 sub problems to find dead transitions.
[2026-05-25 09:28:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 16/63 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 209/633 variables, and 63 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/209 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 56/63 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 7 (OVERLAPS) 424/633 variables, 209/279 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/633 variables, 423/702 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 633/633 variables, and 702 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60202ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Finished structural reductions in LTL mode , in 1 iterations and 60755 ms. Remains : 209/209 places, 424/424 transitions.
Support contains 41 out of 209 places after structural reductions.
[2026-05-25 09:29:14] [INFO ] Flatten gal took : 91 ms
[2026-05-25 09:29:14] [INFO ] Flatten gal took : 34 ms
[2026-05-25 09:29:14] [INFO ] Input system was already deterministic with 424 transitions.
RANDOM walk for 40000 steps (1532 resets) in 1500 ms. (26 steps per ms) remains 25/30 properties
BEST_FIRST walk for 4004 steps (33 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (32 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (35 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (32 resets) in 47 ms. (83 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (34 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (35 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (34 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (36 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (33 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (33 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (33 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (35 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (33 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (32 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (34 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (32 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (32 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (32 resets) in 11 ms. (333 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (33 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (34 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
[2026-05-25 09:29:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 172/209 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 4/15 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 3/18 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 424/633 variables, 209/227 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/633 variables, 0/227 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/633 variables, 0/227 constraints. Problems are: Problem set: 2 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 633/633 variables, and 227 constraints, problems are : Problem set: 2 solved, 23 unsolved in 2930 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 173/209 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 11/18 constraints. Problems are: Problem set: 2 solved, 23 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 7/25 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 2/27 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/27 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 424/633 variables, 209/236 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/633 variables, 22/258 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/633 variables, 1/259 constraints. Problems are: Problem set: 3 solved, 22 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 633/633 variables, and 259 constraints, problems are : Problem set: 3 solved, 22 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 22/25 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7974ms problems are : Problem set: 3 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 424/424 transitions.
Graph (trivial) has 150 edges and 209 vertex of which 13 / 209 are part of one of the 3 SCC in 8 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 199 transition count 380
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 35 rules applied. Total rules applied 67 place count 168 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 166 transition count 376
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 69 place count 166 transition count 370
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 81 place count 160 transition count 370
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 157 transition count 364
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 157 transition count 364
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 131 place count 135 transition count 342
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 134 place count 132 transition count 330
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 132 transition count 330
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 131 transition count 328
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 131 transition count 328
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 159 place count 121 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 121 transition count 381
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 173 place count 121 transition count 368
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 173 place count 121 transition count 367
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 175 place count 120 transition count 367
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 179 place count 116 transition count 363
Iterating global reduction 4 with 4 rules applied. Total rules applied 183 place count 116 transition count 363
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 187 place count 114 transition count 385
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 203 place count 114 transition count 369
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 226 place count 98 transition count 362
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 227 place count 97 transition count 360
Iterating global reduction 5 with 1 rules applied. Total rules applied 228 place count 97 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 97 transition count 358
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 97 transition count 358
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 232 place count 96 transition count 357
Applied a total of 232 rules in 128 ms. Remains 96 /209 variables (removed 113) and now considering 357/424 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 96/209 places, 357/424 transitions.
RANDOM walk for 40000 steps (3959 resets) in 446 ms. (89 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (99 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (102 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (98 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (98 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (101 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (97 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (98 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (101 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (99 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (99 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (102 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (101 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (102 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (101 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (99 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (92 resets) in 27 ms. (143 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (101 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4000 steps (99 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (102 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (103 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (100 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
Probabilistic random walk after 1000001 steps, saw 169317 distinct states, run finished after 2727 ms. (steps per millisecond=366 ) properties seen :20
[2026-05-25 09:29:26] [INFO ] Flow matrix only has 349 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1575163656998551934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17602396334696137084.kers'
[2026-05-25 09:29:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1575163656998551934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17602396334696137084.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 349 rows 96 cols 1666 entries
Finished phase 1 with 88 SingleSign rule and 1 generalized
[2026-05-25 09:29:26] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17602396334696137084.kers
Total runtime 1 ms.
[2026-05-25 09:29:26] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 229/270 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 49/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 154/424 variables, 43/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 41/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 12/436 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 9/445 variables, 9/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/445 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/445 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 229/270 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 49/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 154/424 variables, 43/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 41/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 12/436 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/445 variables, 9/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/445 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/445 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/445 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/445 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 198 constraints, problems are : Problem set: 0 solved, 1 unsolved in 793 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1079ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 182 ms.
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 357/357 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 96 transition count 354
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 93 transition count 354
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 6 place count 93 transition count 347
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 86 transition count 347
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 86 transition count 346
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 28 place count 79 transition count 330
Iterating global reduction 3 with 7 rules applied. Total rules applied 35 place count 79 transition count 330
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 37 place count 77 transition count 320
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 77 transition count 320
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 51 place count 71 transition count 314
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 55 place count 71 transition count 310
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 56 place count 70 transition count 308
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 70 transition count 308
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 75 place count 61 transition count 364
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 95 place count 61 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 113 place count 61 transition count 326
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 115 place count 60 transition count 339
Free-agglomeration rule applied 14 times with reduction of 6 identical transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 129 place count 60 transition count 319
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 171 place count 46 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 6 with 27 rules applied. Total rules applied 198 place count 46 transition count 264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 200 place count 45 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 207 place count 45 transition count 266
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 208 place count 45 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 209 place count 44 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 215 place count 44 transition count 259
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 216 place count 44 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 217 place count 43 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 220 place count 43 transition count 255
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 222 place count 43 transition count 283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 224 place count 41 transition count 283
Applied a total of 224 rules in 109 ms. Remains 41 /96 variables (removed 55) and now considering 283/357 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 41/96 places, 283/357 transitions.
RANDOM walk for 31180 steps (2569 resets) in 884 ms. (35 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA MedleyA-PT-18-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 14 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F(!p0))||(p1&&F(!p0))))&&F(G(p2)))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 424/424 transitions.
Graph (trivial) has 218 edges and 209 vertex of which 13 / 209 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 198 transition count 373
Reduce places removed 40 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 44 rules applied. Total rules applied 85 place count 158 transition count 369
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 156 transition count 368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 155 transition count 368
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 89 place count 155 transition count 359
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 107 place count 146 transition count 359
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 117 place count 136 transition count 339
Iterating global reduction 4 with 10 rules applied. Total rules applied 127 place count 136 transition count 339
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 128 place count 135 transition count 331
Iterating global reduction 4 with 1 rules applied. Total rules applied 129 place count 135 transition count 331
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 187 place count 106 transition count 302
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 193 place count 106 transition count 296
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 197 place count 102 transition count 284
Iterating global reduction 5 with 4 rules applied. Total rules applied 201 place count 102 transition count 284
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 204 place count 99 transition count 276
Iterating global reduction 5 with 3 rules applied. Total rules applied 207 place count 99 transition count 276
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 245 place count 80 transition count 374
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 249 place count 80 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 6 with 31 rules applied. Total rules applied 280 place count 80 transition count 339
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 286 place count 77 transition count 336
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 288 place count 76 transition count 348
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 289 place count 75 transition count 347
Applied a total of 289 rules in 83 ms. Remains 75 /209 variables (removed 134) and now considering 347/424 (removed 77) transitions.
[2026-05-25 09:29:28] [INFO ] Flow matrix only has 325 transitions (discarded 22 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3985701206245987338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17146099595895023787.kers'
[2026-05-25 09:29:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3985701206245987338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17146099595895023787.kers]
Normalized transition count is 324 out of 325 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 324 rows 75 cols 1553 entries
Finished phase 1 with 67 SingleSign rule and 1 generalized
[2026-05-25 09:29:28] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-17146099595895023787.kers
Total runtime 12 ms.
[2026-05-25 09:29:28] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-25 09:29:28] [INFO ] Flow matrix only has 325 transitions (discarded 22 similar events)
[2026-05-25 09:29:28] [INFO ] Invariant cache hit.
[2026-05-25 09:29:28] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 09:29:29] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2026-05-25 09:29:29] [INFO ] Redundant transitions in 12 ms returned []
Running 344 sub problems to find dead transitions.
[2026-05-25 09:29:29] [INFO ] Flow matrix only has 325 transitions (discarded 22 similar events)
[2026-05-25 09:29:29] [INFO ] Invariant cache hit.
[2026-05-25 09:29:29] [INFO ] State equation strengthened by 127 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (OVERLAPS) 1/75 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (OVERLAPS) 324/399 variables, 75/109 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 126/235 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 12 (OVERLAPS) 1/400 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/400 variables, and 237 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 75/75 constraints, ReadFeed: 127/127 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 24/29 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (OVERLAPS) 324/399 variables, 75/110 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 126/236 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 344/580 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/400 variables, and 581 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 75/75 constraints, ReadFeed: 126/127 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 344 unsolved
Search for dead transitions found 0 dead transitions in 60292ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/209 places, 347/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60977 ms. Remains : 75/209 places, 347/424 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(F(p0))||(p1&&F(p0))))&&F(G(p2)))))'
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-00
Product exploration explored 100000 steps with 14109 reset in 268 ms.
Product exploration explored 100000 steps with 14136 reset in 197 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (5662 resets) in 394 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2123 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2124 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 10456 steps, run visited all 2 properties in 28 ms. (steps per millisecond=373 )
Probabilistic random walk after 10456 steps, saw 2076 distinct states, run finished after 32 ms. (steps per millisecond=326 ) properties seen :2
Knowledge based reduction with 5 factoid took 63 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Knowledge-based reduction took 532 ms.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Support contains 3 out of 75 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 347/347 transitions.
Applied a total of 0 rules in 9 ms. Remains 75 /75 variables (removed 0) and now considering 347/347 (removed 0) transitions.
[2026-05-25 09:30:30] [INFO ] Flow matrix only has 325 transitions (discarded 22 similar events)
[2026-05-25 09:30:30] [INFO ] Invariant cache hit.
[2026-05-25 09:30:31] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-25 09:30:31] [INFO ] Flow matrix only has 325 transitions (discarded 22 similar events)
[2026-05-25 09:30:31] [INFO ] Invariant cache hit.
[2026-05-25 09:30:31] [INFO ] State equation strengthened by 127 read => feed constraints.
[2026-05-25 09:30:31] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2026-05-25 09:30:31] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 586 ms. Remains : 75/75 places, 347/347 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge based reduction with 5 factoid took 41 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (5649 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2117 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (2097 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 10456 steps, run visited all 2 properties in 37 ms. (steps per millisecond=282 )
Probabilistic random walk after 10456 steps, saw 2076 distinct states, run finished after 37 ms. (steps per millisecond=282 ) properties seen :2
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Knowledge-based reduction took 443 ms.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 14106 reset in 200 ms.
Product exploration explored 100000 steps with 14108 reset in 157 ms.
Built C files in :
/tmp/ltsmin8877712858238991715
[2026-05-25 09:30:32] [INFO ] Computing symmetric may disable matrix : 347 transitions.
[2026-05-25 09:30:32] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:30:32] [INFO ] Computing symmetric may enable matrix : 347 transitions.
[2026-05-25 09:30:32] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:30:32] [INFO ] Computing Do-Not-Accords matrix : 347 transitions.
[2026-05-25 09:30:32] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:30:32] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8877712858238991715
Running compilation step : cd /tmp/ltsmin8877712858238991715;'/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 999 ms.
Running link step : cd /tmp/ltsmin8877712858238991715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin8877712858238991715;'/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/stateBased3030400971872006171.hoa' '--buchi-type=spotba'
LTSmin run took 222 ms.
FORMULA MedleyA-PT-18-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-18-LTLFireability-00 finished in 65800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 424/424 transitions.
Graph (trivial) has 222 edges and 209 vertex of which 13 / 209 are part of one of the 3 SCC in 2 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 198 transition count 371
Reduce places removed 42 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 46 rules applied. Total rules applied 89 place count 156 transition count 367
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 154 transition count 367
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 91 place count 154 transition count 357
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 111 place count 144 transition count 357
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 120 place count 135 transition count 339
Iterating global reduction 3 with 9 rules applied. Total rules applied 129 place count 135 transition count 339
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 134 transition count 331
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 134 transition count 331
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 195 place count 102 transition count 299
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 201 place count 102 transition count 293
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 206 place count 97 transition count 279
Iterating global reduction 4 with 5 rules applied. Total rules applied 211 place count 97 transition count 279
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 215 place count 93 transition count 267
Iterating global reduction 4 with 4 rules applied. Total rules applied 219 place count 93 transition count 267
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -102
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 257 place count 74 transition count 369
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 261 place count 74 transition count 365
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
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 265 place count 72 transition count 403
Drop transitions (Redundant composition of simpler transitions.) removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 5 with 57 rules applied. Total rules applied 322 place count 72 transition count 346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 326 place count 70 transition count 344
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 327 place count 69 transition count 343
Applied a total of 327 rules in 87 ms. Remains 69 /209 variables (removed 140) and now considering 343/424 (removed 81) transitions.
[2026-05-25 09:30:34] [INFO ] Flow matrix only has 311 transitions (discarded 32 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17431599727392238639.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15916066301876159888.kers'
[2026-05-25 09:30:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17431599727392238639.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15916066301876159888.kers]
Normalized transition count is 310 out of 311 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 310 rows 69 cols 1462 entries
Finished phase 1 with 61 SingleSign rule and 1 generalized
[2026-05-25 09:30:34] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15916066301876159888.kers
Total runtime 1 ms.
[2026-05-25 09:30:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 09:30:34] [INFO ] Flow matrix only has 311 transitions (discarded 32 similar events)
[2026-05-25 09:30:34] [INFO ] Invariant cache hit.
[2026-05-25 09:30:34] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-25 09:30:34] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2026-05-25 09:30:34] [INFO ] Redundant transitions in 17 ms returned []
Running 338 sub problems to find dead transitions.
[2026-05-25 09:30:34] [INFO ] Flow matrix only has 311 transitions (discarded 32 similar events)
[2026-05-25 09:30:34] [INFO ] Invariant cache hit.
[2026-05-25 09:30:34] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 310/379 variables, 69/97 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 78/175 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/379 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 9 (OVERLAPS) 1/380 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 11 (OVERLAPS) 0/380 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 178 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 23/30 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 310/379 variables, 69/100 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 78/178 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/380 variables, and 516 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30108 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 69/69 constraints, ReadFeed: 78/79 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60264ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/209 places, 343/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60729 ms. Remains : 69/209 places, 343/424 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 56 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-01
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-01 finished in 60819 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(F(p0))))&&(G(p1) U G(p2))))'
Support contains 4 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 424/424 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 202 transition count 410
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 202 transition count 410
Applied a total of 14 rules in 12 ms. Remains 202 /209 variables (removed 7) and now considering 410/424 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6456813685833888757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14717241814056372887.kers'
[2026-05-25 09:31:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6456813685833888757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14717241814056372887.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 410 rows 202 cols 1770 entries
Finished phase 1 with 194 SingleSign rule and 1 generalized
[2026-05-25 09:31:34] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14717241814056372887.kers
Total runtime 5 ms.
[2026-05-25 09:31:35] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-25 09:31:35] [INFO ] Invariant cache hit.
[2026-05-25 09:31:35] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2026-05-25 09:31:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 10/65 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 202/612 variables, and 66 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/202 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 410/612 variables, 202/273 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/612 variables, 409/682 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 612/612 variables, and 682 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 202/202 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60214ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Starting structural reductions in LTL mode, iteration 1 : 202/209 places, 410/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60645 ms. Remains : 202/209 places, 410/424 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(F(p0))))&&(G(p1) U G(p2))))'
Stuttering acceptance computed with spot in 395 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (AND p2 (NOT p1)), (NOT p2), (NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-02
Entered a terminal (fully accepting) state of product in 27 steps with 2 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-02 finished in 61109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p1) U p0)))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 424/424 transitions.
Graph (trivial) has 220 edges and 209 vertex of which 13 / 209 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 198 transition count 371
Reduce places removed 42 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 46 rules applied. Total rules applied 89 place count 156 transition count 367
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 154 transition count 367
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 91 place count 154 transition count 358
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 109 place count 145 transition count 358
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 119 place count 135 transition count 338
Iterating global reduction 3 with 10 rules applied. Total rules applied 129 place count 135 transition count 338
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 134 transition count 330
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 134 transition count 330
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 193 place count 103 transition count 299
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 199 place count 103 transition count 293
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 203 place count 99 transition count 281
Iterating global reduction 4 with 4 rules applied. Total rules applied 207 place count 99 transition count 281
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 210 place count 96 transition count 273
Iterating global reduction 4 with 3 rules applied. Total rules applied 213 place count 96 transition count 273
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 251 place count 77 transition count 371
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 255 place count 77 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 286 place count 77 transition count 336
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 292 place count 74 transition count 333
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 294 place count 73 transition count 345
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 295 place count 72 transition count 344
Applied a total of 295 rules in 56 ms. Remains 72 /209 variables (removed 137) and now considering 344/424 (removed 80) transitions.
[2026-05-25 09:32:36] [INFO ] Flow matrix only has 318 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-144497275054939942.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6358580597864535199.kers'
[2026-05-25 09:32:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-144497275054939942.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6358580597864535199.kers]
Normalized transition count is 317 out of 318 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 317 rows 72 cols 1530 entries
Finished phase 1 with 64 SingleSign rule and 1 generalized
[2026-05-25 09:32:36] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6358580597864535199.kers
Total runtime 2 ms.
[2026-05-25 09:32:36] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 09:32:36] [INFO ] Flow matrix only has 318 transitions (discarded 26 similar events)
[2026-05-25 09:32:36] [INFO ] Invariant cache hit.
[2026-05-25 09:32:36] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-25 09:32:36] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2026-05-25 09:32:36] [INFO ] Redundant transitions in 5 ms returned []
Running 339 sub problems to find dead transitions.
[2026-05-25 09:32:36] [INFO ] Flow matrix only has 318 transitions (discarded 26 similar events)
[2026-05-25 09:32:36] [INFO ] Invariant cache hit.
[2026-05-25 09:32:36] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (OVERLAPS) 317/389 variables, 72/95 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/389 variables, 72/167 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (OVERLAPS) 1/390 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/390 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 11 (OVERLAPS) 0/390 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 339 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 170 constraints, problems are : Problem set: 0 solved, 339 unsolved in 28946 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (OVERLAPS) 317/389 variables, 72/99 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 72/171 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 339/510 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 9 (OVERLAPS) 1/390 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/390 variables, and 511 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59117ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 59120ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/209 places, 344/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59475 ms. Remains : 72/209 places, 344/424 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(F(p1) U p0)))'
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-04
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-04 finished in 59742 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(X(F(p1)))))))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 203 transition count 412
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 203 transition count 412
Applied a total of 12 rules in 6 ms. Remains 203 /209 variables (removed 6) and now considering 412/424 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6474338799185159212.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11011884279586289770.kers'
[2026-05-25 09:33:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6474338799185159212.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11011884279586289770.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 412 rows 203 cols 1774 entries
Finished phase 1 with 195 SingleSign rule and 1 generalized
[2026-05-25 09:33:35] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-11011884279586289770.kers
Total runtime 6 ms.
[2026-05-25 09:33:35] [INFO ] Implicit Places using invariants in 185 ms returned []
[2026-05-25 09:33:35] [INFO ] Invariant cache hit.
[2026-05-25 09:33:36] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2026-05-25 09:33:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/615 variables, and 60 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 8 (OVERLAPS) 412/615 variables, 203/274 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/615 variables, and 685 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Starting structural reductions in LTL mode, iteration 1 : 203/209 places, 412/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60747 ms. Remains : 203/209 places, 412/424 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(X(F(p1)))))))'
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 12 ms. Proved property starting from automaton with 4 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 23 ms.
FORMULA MedleyA-PT-18-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-18-LTLFireability-05 finished in 61276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X((G(p1)||p0))))||G(p2)))))'
Support contains 5 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 424/424 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 201 transition count 408
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 201 transition count 408
Applied a total of 16 rules in 3 ms. Remains 201 /209 variables (removed 8) and now considering 408/424 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11917042104738597714.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2802859081270300897.kers'
[2026-05-25 09:34:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11917042104738597714.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2802859081270300897.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 408 rows 201 cols 1766 entries
Finished phase 1 with 193 SingleSign rule and 1 generalized
[2026-05-25 09:34:37] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2802859081270300897.kers
Total runtime 2 ms.
[2026-05-25 09:34:37] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-25 09:34:37] [INFO ] Invariant cache hit.
[2026-05-25 09:34:37] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2026-05-25 09:34:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 408/609 variables, 201/254 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/609 variables, and 254 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (OVERLAPS) 408/609 variables, 201/268 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 407/675 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 609/609 variables, and 675 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 201/209 places, 408/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60591 ms. Remains : 201/209 places, 408/424 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X((G(p1)||p0))))||G(p2)))))'
Stuttering acceptance computed with spot in 736 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-06
Product exploration explored 100000 steps with 16627 reset in 129 ms.
Product exploration explored 100000 steps with 16725 reset in 98 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 12 states, 25 edges and 3 AP (stutter sensitive) to 12 states, 25 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (1535 resets) in 1309 ms. (30 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 50 ms. (78 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (35 resets) in 57 ms. (69 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 761754 steps, run timeout after 3001 ms. (steps per millisecond=253 ) properties seen :7 out of 15
Probabilistic random walk after 761754 steps, saw 137145 distinct states, run finished after 3004 ms. (steps per millisecond=253 ) properties seen :7
[2026-05-25 09:35:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf0 is UNSAT
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 94/99 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 102/201 variables, 4/7 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 408/609 variables, 201/208 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/609 variables, 0/208 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/609 variables, 0/208 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 609/609 variables, and 208 constraints, problems are : Problem set: 3 solved, 5 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem apf5 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 1 (OVERLAPS) 94/99 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 102/201 variables, 4/7 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 3/10 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 408/609 variables, 201/211 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/609 variables, 3/214 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 3/217 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 0/217 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/609 variables, 0/217 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 609/609 variables, and 217 constraints, problems are : Problem set: 5 solved, 3 unsolved in 1545 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1764ms problems are : Problem set: 5 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 265 ms.
Support contains 5 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 408/408 transitions.
Graph (trivial) has 202 edges and 201 vertex of which 13 / 201 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 191 transition count 355
Reduce places removed 40 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 44 rules applied. Total rules applied 85 place count 151 transition count 351
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 149 transition count 351
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 87 place count 149 transition count 342
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 105 place count 140 transition count 342
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 138 transition count 338
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 138 transition count 338
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 175 place count 105 transition count 305
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 181 place count 105 transition count 299
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 187 place count 99 transition count 277
Iterating global reduction 4 with 6 rules applied. Total rules applied 193 place count 99 transition count 277
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 197 place count 95 transition count 265
Iterating global reduction 4 with 4 rules applied. Total rules applied 201 place count 95 transition count 265
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -117
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 241 place count 75 transition count 382
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 252 place count 75 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 271 place count 75 transition count 352
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 277 place count 72 transition count 349
Free-agglomeration rule applied 22 times.
Iterating global reduction 5 with 22 rules applied. Total rules applied 299 place count 72 transition count 327
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 5 with 61 rules applied. Total rules applied 360 place count 50 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 389 place count 50 transition count 259
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 391 place count 50 transition count 257
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 393 place count 48 transition count 257
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 408 place count 48 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 410 place count 47 transition count 259
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 412 place count 47 transition count 287
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 414 place count 45 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 415 place count 44 transition count 286
Applied a total of 415 rules in 58 ms. Remains 44 /201 variables (removed 157) and now considering 286/408 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 44/201 places, 286/408 transitions.
RANDOM walk for 21725 steps (479 resets) in 184 ms. (117 steps per ms) remains 0/3 properties
Found 5 invariant AP formulas.
Knowledge based reduction with 8 factoid took 282 ms. Reduced automaton from 12 states, 25 edges and 3 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Knowledge-based reduction took 6523 ms.
Stuttering acceptance computed with spot in 413 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 out of 201 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 408/408 transitions.
Applied a total of 0 rules in 4 ms. Remains 201 /201 variables (removed 0) and now considering 408/408 (removed 0) transitions.
[2026-05-25 09:35:45] [INFO ] Invariant cache hit.
[2026-05-25 09:35:45] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-25 09:35:45] [INFO ] Invariant cache hit.
[2026-05-25 09:35:46] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 420 ms. Remains : 201/201 places, 408/408 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (1529 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (357 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (352 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1702516 steps, run timeout after 3001 ms. (steps per millisecond=567 ) properties seen :1 out of 2
Probabilistic random walk after 1702516 steps, saw 298807 distinct states, run finished after 3001 ms. (steps per millisecond=567 ) properties seen :1
[2026-05-25 09:35:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/201 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 408/609 variables, 201/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/609 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/609 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 609/609 variables, and 208 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/201 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 408/609 variables, 201/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/609 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/609 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/609 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 609/609 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1182ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 408/408 transitions.
Graph (trivial) has 206 edges and 201 vertex of which 13 / 201 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 191 transition count 354
Reduce places removed 41 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 45 rules applied. Total rules applied 87 place count 150 transition count 350
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 148 transition count 350
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 89 place count 148 transition count 341
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 107 place count 139 transition count 341
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 137 transition count 337
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 137 transition count 337
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 179 place count 103 transition count 303
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 185 place count 103 transition count 297
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 191 place count 97 transition count 275
Iterating global reduction 4 with 6 rules applied. Total rules applied 197 place count 97 transition count 275
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 201 place count 93 transition count 263
Iterating global reduction 4 with 4 rules applied. Total rules applied 205 place count 93 transition count 263
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -115
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 245 place count 73 transition count 378
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 256 place count 73 transition count 367
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 280 place count 73 transition count 343
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 286 place count 70 transition count 340
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 288 place count 69 transition count 352
Free-agglomeration rule applied 22 times.
Iterating global reduction 5 with 22 rules applied. Total rules applied 310 place count 69 transition count 330
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 5 with 61 rules applied. Total rules applied 371 place count 47 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 400 place count 47 transition count 262
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 402 place count 47 transition count 260
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 404 place count 45 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 415 place count 45 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 417 place count 44 transition count 262
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 419 place count 44 transition count 290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 421 place count 42 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 422 place count 41 transition count 289
Applied a total of 422 rules in 56 ms. Remains 41 /201 variables (removed 160) and now considering 289/408 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 41/201 places, 289/408 transitions.
RANDOM walk for 3492 steps (393 resets) in 22 ms. (151 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 4860 ms.
Stuttering acceptance computed with spot in 317 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 3834 reset in 155 ms.
Product exploration explored 100000 steps with 3837 reset in 132 ms.
Spot run failed in 136 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin16095895055920263503
[2026-05-25 09:35:51] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16095895055920263503
Running compilation step : cd /tmp/ltsmin16095895055920263503;'/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 651 ms.
Running link step : cd /tmp/ltsmin16095895055920263503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16095895055920263503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased13703399829723024415.hoa' '--buchi-type=spotba'
LTSmin run took 1369 ms.
FORMULA MedleyA-PT-18-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-18-LTLFireability-06 finished in 76941 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&&((p1&&X(p1)) U (G((p1&&X(p1)))||(p1&&X((p1&&X(p2))))))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 424/424 transitions.
Graph (trivial) has 217 edges and 209 vertex of which 13 / 209 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 198 transition count 371
Reduce places removed 42 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 46 rules applied. Total rules applied 89 place count 156 transition count 367
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 154 transition count 367
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 91 place count 154 transition count 357
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 111 place count 144 transition count 357
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 119 place count 136 transition count 341
Iterating global reduction 3 with 8 rules applied. Total rules applied 127 place count 136 transition count 341
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 135 transition count 333
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 135 transition count 333
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 191 place count 104 transition count 302
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 197 place count 104 transition count 296
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 201 place count 100 transition count 284
Iterating global reduction 4 with 4 rules applied. Total rules applied 205 place count 100 transition count 284
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 208 place count 97 transition count 276
Iterating global reduction 4 with 3 rules applied. Total rules applied 211 place count 97 transition count 276
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 249 place count 78 transition count 372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 253 place count 78 transition count 368
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 284 place count 78 transition count 337
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 290 place count 75 transition count 334
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 292 place count 74 transition count 346
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 293 place count 73 transition count 345
Applied a total of 293 rules in 91 ms. Remains 73 /209 variables (removed 136) and now considering 345/424 (removed 79) transitions.
[2026-05-25 09:35:54] [INFO ] Flow matrix only has 319 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-349097119516723525.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2737562195310727804.kers'
[2026-05-25 09:35:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-349097119516723525.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2737562195310727804.kers]
Normalized transition count is 318 out of 319 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 318 rows 73 cols 1528 entries
Finished phase 1 with 65 SingleSign rule and 1 generalized
[2026-05-25 09:35:54] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2737562195310727804.kers
Total runtime 4 ms.
[2026-05-25 09:35:54] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-25 09:35:54] [INFO ] Flow matrix only has 319 transitions (discarded 26 similar events)
[2026-05-25 09:35:54] [INFO ] Invariant cache hit.
[2026-05-25 09:35:54] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-25 09:35:54] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2026-05-25 09:35:54] [INFO ] Redundant transitions in 4 ms returned []
Running 340 sub problems to find dead transitions.
[2026-05-25 09:35:54] [INFO ] Flow matrix only has 319 transitions (discarded 26 similar events)
[2026-05-25 09:35:54] [INFO ] Invariant cache hit.
[2026-05-25 09:35:54] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (OVERLAPS) 318/391 variables, 73/99 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 72/171 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 4/175 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 8 (OVERLAPS) 1/392 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/392 variables, and 177 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 73/73 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (OVERLAPS) 318/391 variables, 73/104 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 72/176 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 340/516 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/392 variables, and 516 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 73/73 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60180ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/209 places, 345/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60665 ms. Remains : 73/209 places, 345/424 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&&X(p0)) U (G((p0&&X(p0)))||(p0&&X((p0&&X(p1))))))&&p2))))'
Stuttering acceptance computed with spot in 42 ms :[(OR (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-07
Product exploration explored 100000 steps with 16714 reset in 175 ms.
Product exploration explored 100000 steps with 16681 reset in 166 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (6941 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (2022 resets) in 40 ms. (975 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (2005 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1968 resets) in 60 ms. (655 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 11698 steps, run visited all 3 properties in 32 ms. (steps per millisecond=365 )
Probabilistic random walk after 11698 steps, saw 2601 distinct states, run finished after 32 ms. (steps per millisecond=365 ) properties seen :3
Knowledge based reduction with 9 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(OR (NOT p2) (NOT p0))]
Knowledge-based reduction took 411 ms.
Stuttering acceptance computed with spot in 46 ms :[(OR (NOT p2) (NOT p0))]
Support contains 3 out of 73 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 345/345 transitions.
Applied a total of 0 rules in 15 ms. Remains 73 /73 variables (removed 0) and now considering 345/345 (removed 0) transitions.
[2026-05-25 09:36:55] [INFO ] Flow matrix only has 319 transitions (discarded 26 similar events)
[2026-05-25 09:36:55] [INFO ] Invariant cache hit.
[2026-05-25 09:36:55] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-25 09:36:55] [INFO ] Flow matrix only has 319 transitions (discarded 26 similar events)
[2026-05-25 09:36:55] [INFO ] Invariant cache hit.
[2026-05-25 09:36:55] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-25 09:36:55] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2026-05-25 09:36:56] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 450 ms. Remains : 73/73 places, 345/345 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 9 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (6917 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1972 resets) in 41 ms. (952 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1979 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1986 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 11698 steps, run visited all 3 properties in 34 ms. (steps per millisecond=344 )
Probabilistic random walk after 11698 steps, saw 2601 distinct states, run finished after 34 ms. (steps per millisecond=344 ) properties seen :3
Knowledge based reduction with 9 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(OR (NOT p2) (NOT p0))]
Knowledge-based reduction took 348 ms.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 16755 reset in 176 ms.
Product exploration explored 100000 steps with 16708 reset in 154 ms.
Built C files in :
/tmp/ltsmin14730134543774309161
[2026-05-25 09:36:56] [INFO ] Computing symmetric may disable matrix : 345 transitions.
[2026-05-25 09:36:56] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:36:56] [INFO ] Computing symmetric may enable matrix : 345 transitions.
[2026-05-25 09:36:56] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:36:56] [INFO ] Computing Do-Not-Accords matrix : 345 transitions.
[2026-05-25 09:36:56] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:36:56] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14730134543774309161
Running compilation step : cd /tmp/ltsmin14730134543774309161;'/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 838 ms.
Running link step : cd /tmp/ltsmin14730134543774309161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin14730134543774309161;'/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/stateBased5654583343243573809.hoa' '--buchi-type=spotba'
LTSmin run took 301 ms.
FORMULA MedleyA-PT-18-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-18-LTLFireability-07 finished in 64163 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(p1))||p0)) U (p1||X((X(G(p2)) U (p1&&X(G(p2))))))))'
Support contains 8 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 424/424 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 203 transition count 412
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 203 transition count 412
Applied a total of 12 rules in 9 ms. Remains 203 /209 variables (removed 6) and now considering 412/424 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16485940971026669399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17440341930733109177.kers'
[2026-05-25 09:36:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16485940971026669399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17440341930733109177.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 412 rows 203 cols 1774 entries
Finished phase 1 with 195 SingleSign rule and 1 generalized
[2026-05-25 09:36:58] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17440341930733109177.kers
Total runtime 6 ms.
[2026-05-25 09:36:58] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-25 09:36:58] [INFO ] Invariant cache hit.
[2026-05-25 09:36:58] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2026-05-25 09:36:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 19/46 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/615 variables, and 59 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 7 (OVERLAPS) 412/615 variables, 203/268 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 411/679 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/615 variables, and 679 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 60191ms
Starting structural reductions in LTL mode, iteration 1 : 203/209 places, 412/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60683 ms. Remains : 203/209 places, 412/424 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(p1))||p0)) U (p1||X((X(G(p2)) U (p1&&X(G(p2))))))))'
Stuttering acceptance computed with spot in 568 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), true, (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-09 finished in 61340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1)))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 424/424 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 201 transition count 408
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 201 transition count 408
Applied a total of 16 rules in 8 ms. Remains 201 /209 variables (removed 8) and now considering 408/424 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16056238065418686271.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-953336459160475800.kers'
[2026-05-25 09:37:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16056238065418686271.kers, --Pflows, --basisKERS=/tmp/petrispot-output-953336459160475800.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 408 rows 201 cols 1766 entries
Finished phase 1 with 193 SingleSign rule and 1 generalized
[2026-05-25 09:37:59] [INFO ] Computed 7 invariants in 4 ms
Computed 7 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-953336459160475800.kers
Total runtime 6 ms.
[2026-05-25 09:37:59] [INFO ] Implicit Places using invariants in 164 ms returned []
[2026-05-25 09:37:59] [INFO ] Invariant cache hit.
[2026-05-25 09:37:59] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 407 sub problems to find dead transitions.
[2026-05-25 09:37:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (OVERLAPS) 408/609 variables, 201/254 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/609 variables, and 254 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 7 (OVERLAPS) 408/609 variables, 201/268 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/609 variables, 407/675 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 609/609 variables, and 675 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 201/209 places, 408/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60634 ms. Remains : 201/209 places, 408/424 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1)))))'
Stuttering acceptance computed with spot in 183 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-11 finished in 60864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(X(F(G(p0))))) U G((!(p1 U p2) U X(p1)))))'
Support contains 4 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 424/424 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 201 transition count 408
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 201 transition count 408
Applied a total of 16 rules in 7 ms. Remains 201 /209 variables (removed 8) and now considering 408/424 (removed 16) transitions.
[2026-05-25 09:39:00] [INFO ] Invariant cache hit.
[2026-05-25 09:39:00] [INFO ] Implicit Places using invariants in 150 ms returned []
[2026-05-25 09:39:00] [INFO ] Invariant cache hit.
[2026-05-25 09:39:00] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 201/209 places, 408/424 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 399 ms. Remains : 201/209 places, 408/424 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(X(F(G(p0))))) U G((!(p1 U p2) U X(p1)))))'
Stuttering acceptance computed with spot in 319 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p0)]
Running random walk in product with property : MedleyA-PT-18-LTLFireability-12
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-18-LTLFireability-12 finished in 775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 424/424 transitions.
Graph (trivial) has 221 edges and 209 vertex of which 13 / 209 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 198 transition count 371
Reduce places removed 42 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 46 rules applied. Total rules applied 89 place count 156 transition count 367
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 154 transition count 367
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 91 place count 154 transition count 357
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 111 place count 144 transition count 357
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 121 place count 134 transition count 337
Iterating global reduction 3 with 10 rules applied. Total rules applied 131 place count 134 transition count 337
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 133 transition count 329
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 133 transition count 329
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 195 place count 102 transition count 298
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 201 place count 102 transition count 292
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 206 place count 97 transition count 278
Iterating global reduction 4 with 5 rules applied. Total rules applied 211 place count 97 transition count 278
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 215 place count 93 transition count 266
Iterating global reduction 4 with 4 rules applied. Total rules applied 219 place count 93 transition count 266
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 257 place count 74 transition count 364
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 261 place count 74 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 5 with 30 rules applied. Total rules applied 291 place count 74 transition count 330
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 295 place count 72 transition count 328
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 297 place count 71 transition count 340
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 298 place count 70 transition count 339
Applied a total of 298 rules in 70 ms. Remains 70 /209 variables (removed 139) and now considering 339/424 (removed 85) transitions.
[2026-05-25 09:39:01] [INFO ] Flow matrix only has 309 transitions (discarded 30 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16025741498039366734.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11629750808028091483.kers'
[2026-05-25 09:39:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16025741498039366734.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11629750808028091483.kers]
Normalized transition count is 308 out of 309 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 308 rows 70 cols 1536 entries
Finished phase 1 with 62 SingleSign rule and 1 generalized
[2026-05-25 09:39:01] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11629750808028091483.kers
Total runtime 5 ms.
[2026-05-25 09:39:01] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-25 09:39:01] [INFO ] Flow matrix only has 309 transitions (discarded 30 similar events)
[2026-05-25 09:39:01] [INFO ] Invariant cache hit.
[2026-05-25 09:39:01] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-25 09:39:01] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2026-05-25 09:39:01] [INFO ] Redundant transitions in 4 ms returned []
Running 335 sub problems to find dead transitions.
[2026-05-25 09:39:01] [INFO ] Flow matrix only has 309 transitions (discarded 30 similar events)
[2026-05-25 09:39:01] [INFO ] Invariant cache hit.
[2026-05-25 09:39:01] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (OVERLAPS) 1/70 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 308/378 variables, 70/100 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 72/172 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 11 (OVERLAPS) 1/379 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/379 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/379 variables, and 174 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (OVERLAPS) 1/70 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (OVERLAPS) 308/378 variables, 70/102 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 72/174 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 335/509 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/379 variables, and 509 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 70/70 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 60211ms
Starting structural reductions in SI_LTL mode, iteration 1 : 70/209 places, 339/424 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60655 ms. Remains : 70/209 places, 339/424 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-18-LTLFireability-15
Product exploration explored 100000 steps with 28510 reset in 122 ms.
Product exploration explored 100000 steps with 28553 reset in 147 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
[2026-05-25 09:40:02] [INFO ] Flow matrix only has 309 transitions (discarded 30 similar events)
[2026-05-25 09:40:02] [INFO ] Invariant cache hit.
[2026-05-25 09:40:02] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 09:40:02] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2026-05-25 09:40:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:40:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-25 09:40:02] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2026-05-25 09:40:02] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-25 09:40:02] [INFO ] [Nat]Added 73 Read/Feed constraints in 14 ms returned sat
[2026-05-25 09:40:02] [INFO ] Computed and/alt/rep : 130/561/130 causal constraints (skipped 175 transitions) in 20 ms.
[2026-05-25 09:40:02] [INFO ] Added : 0 causal constraints over 0 iterations in 64 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 807 ms.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 339/339 transitions.
Applied a total of 0 rules in 5 ms. Remains 70 /70 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2026-05-25 09:40:03] [INFO ] Flow matrix only has 309 transitions (discarded 30 similar events)
[2026-05-25 09:40:03] [INFO ] Invariant cache hit.
[2026-05-25 09:40:03] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 09:40:03] [INFO ] Flow matrix only has 309 transitions (discarded 30 similar events)
[2026-05-25 09:40:03] [INFO ] Invariant cache hit.
[2026-05-25 09:40:03] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-25 09:40:03] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2026-05-25 09:40:03] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257 ms. Remains : 70/70 places, 339/339 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 155 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0)]
[2026-05-25 09:40:03] [INFO ] Flow matrix only has 309 transitions (discarded 30 similar events)
[2026-05-25 09:40:03] [INFO ] Invariant cache hit.
[2026-05-25 09:40:03] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 09:40:03] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2026-05-25 09:40:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:40:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-25 09:40:04] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2026-05-25 09:40:04] [INFO ] State equation strengthened by 73 read => feed constraints.
[2026-05-25 09:40:04] [INFO ] [Nat]Added 73 Read/Feed constraints in 22 ms returned sat
[2026-05-25 09:40:04] [INFO ] Computed and/alt/rep : 130/561/130 causal constraints (skipped 175 transitions) in 30 ms.
[2026-05-25 09:40:04] [INFO ] Added : 0 causal constraints over 0 iterations in 58 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 944 ms.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 28465 reset in 176 ms.
Product exploration explored 100000 steps with 28543 reset in 136 ms.
Built C files in :
/tmp/ltsmin11447037530437687020
[2026-05-25 09:40:04] [INFO ] Computing symmetric may disable matrix : 339 transitions.
[2026-05-25 09:40:04] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:40:04] [INFO ] Computing symmetric may enable matrix : 339 transitions.
[2026-05-25 09:40:04] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:40:04] [INFO ] Computing Do-Not-Accords matrix : 339 transitions.
[2026-05-25 09:40:04] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 09:40:04] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11447037530437687020
Running compilation step : cd /tmp/ltsmin11447037530437687020;'/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 885 ms.
Running link step : cd /tmp/ltsmin11447037530437687020;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin11447037530437687020;'/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/stateBased14495732842722016912.hoa' '--buchi-type=spotba'
LTSmin run took 229 ms.
FORMULA MedleyA-PT-18-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-18-LTLFireability-15 finished in 64801 ms.
All properties solved by simple procedures.
Total runtime 774424 ms.
BK_STOP 1779702006012
--------------------
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-18"
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-18, 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-177969020000236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-18.tgz
mv MedleyA-PT-18 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 '
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 ;