About the Execution of ITS-Tools for DES-PT-02b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 515.191 | 399639.00 | 468881.00 | 1132.90 | FFFFFFFFFFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r082-smll-177946993700340.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 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 DES-PT-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700340
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.0K Mar 6 18:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 6 18:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 6 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 18:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 6 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 6 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 6 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 69K 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 DES-PT-02b-LTLFireability-00
FORMULA_NAME DES-PT-02b-LTLFireability-01
FORMULA_NAME DES-PT-02b-LTLFireability-02
FORMULA_NAME DES-PT-02b-LTLFireability-03
FORMULA_NAME DES-PT-02b-LTLFireability-04
FORMULA_NAME DES-PT-02b-LTLFireability-05
FORMULA_NAME DES-PT-02b-LTLFireability-06
FORMULA_NAME DES-PT-02b-LTLFireability-07
FORMULA_NAME DES-PT-02b-LTLFireability-08
FORMULA_NAME DES-PT-02b-LTLFireability-09
FORMULA_NAME DES-PT-02b-LTLFireability-10
FORMULA_NAME DES-PT-02b-LTLFireability-11
FORMULA_NAME DES-PT-02b-LTLFireability-12
FORMULA_NAME DES-PT-02b-LTLFireability-13
FORMULA_NAME DES-PT-02b-LTLFireability-14
FORMULA_NAME DES-PT-02b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779658050721
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 21:27:33] [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-24 21:27:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 21:27:33] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2026-05-24 21:27:33] [INFO ] Transformed 288 places.
[2026-05-24 21:27:33] [INFO ] Transformed 239 transitions.
[2026-05-24 21:27:33] [INFO ] Found NUPN structural information;
[2026-05-24 21:27:33] [INFO ] Parsed PT model containing 288 places and 239 transitions and 699 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-02b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 285 transition count 239
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 265 transition count 219
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 265 transition count 219
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 256 transition count 210
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 256 transition count 210
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 68 place count 256 transition count 203
Applied a total of 68 rules in 123 ms. Remains 256 /288 variables (removed 32) and now considering 203/239 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9301288179021189356.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14168031137157751466.kers'
[2026-05-24 21:27:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9301288179021189356.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14168031137157751466.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 203 rows 256 cols 609 entries
Finished phase 1 with 144 SingleSign rule and 50 generalized
[2026-05-24 21:27:34] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14168031137157751466.kers
Total runtime 3 ms.
[2026-05-24 21:27:34] [INFO ] Implicit Places using invariants in 513 ms returned []
[2026-05-24 21:27:34] [INFO ] Invariant cache hit.
[2026-05-24 21:27:35] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 1118 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2026-05-24 21:27:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/256 variables, 34/53 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 17/81 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/256 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (OVERLAPS) 203/459 variables, 256/364 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 367 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (OVERLAPS) 1/256 variables, 34/53 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 49/111 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 203/459 variables, 256/372 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 202/574 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 15/589 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 459/459 variables, and 589 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Starting structural reductions in LTL mode, iteration 1 : 256/288 places, 203/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61466 ms. Remains : 256/288 places, 203/239 transitions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 203/203 transitions.
Applied a total of 0 rules in 8 ms. Remains 256 /256 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2026-05-24 21:28:35] [INFO ] Invariant cache hit.
[2026-05-24 21:28:35] [INFO ] Implicit Places using invariants in 231 ms returned []
[2026-05-24 21:28:35] [INFO ] Invariant cache hit.
[2026-05-24 21:28:36] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 620 ms. Remains : 256/256 places, 203/203 transitions.
Support contains 58 out of 256 places after structural reductions.
[2026-05-24 21:28:36] [INFO ] Flatten gal took : 84 ms
[2026-05-24 21:28:36] [INFO ] Flatten gal took : 35 ms
[2026-05-24 21:28:36] [INFO ] Input system was already deterministic with 203 transitions.
Support contains 57 out of 256 places (down from 58) after GAL structural reductions.
RANDOM walk for 40000 steps (358 resets) in 2839 ms. (14 steps per ms) remains 2/36 properties
BEST_FIRST walk for 40004 steps (51 resets) in 353 ms. (113 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (52 resets) in 238 ms. (167 steps per ms) remains 2/2 properties
[2026-05-24 21:28:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 17/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 148/172 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 64/236 variables, 27/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/239 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 189/428 variables, 239/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 3/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 19/447 variables, 11/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 6/453 variables, 3/319 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/453 variables, 0/319 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/457 variables, 2/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/457 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/459 variables, 1/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/459 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/459 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 322 constraints, problems are : Problem set: 1 solved, 1 unsolved in 732 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/123 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 92/215 variables, 34/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 3/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/239 variables, 18/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 2/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 189/428 variables, 239/306 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 1/307 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 1/308 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 0/308 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 19/447 variables, 11/319 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/447 variables, 0/319 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/453 variables, 3/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/453 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/457 variables, 2/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/457 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/459 variables, 1/325 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/459 variables, 0/325 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/459 variables, 0/325 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 325 constraints, problems are : Problem set: 1 solved, 1 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1387ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 171 ms.
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 203/203 transitions.
Graph (complete) has 465 edges and 256 vertex of which 253 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 253 transition count 181
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 236 transition count 181
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 236 transition count 171
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 226 transition count 171
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 219 transition count 164
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 219 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 219 transition count 160
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 77 place count 218 transition count 159
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 81 place count 214 transition count 155
Iterating global reduction 4 with 4 rules applied. Total rules applied 85 place count 214 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 88 place count 214 transition count 152
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 88 place count 214 transition count 149
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 94 place count 211 transition count 149
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 248 place count 134 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 252 place count 132 transition count 74
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 253 place count 132 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 254 place count 131 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 130 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 256 place count 129 transition count 72
Applied a total of 256 rules in 149 ms. Remains 129 /256 variables (removed 127) and now considering 72/203 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 129/256 places, 72/203 transitions.
RANDOM walk for 40000 steps (1974 resets) in 891 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (392 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1382734 steps, run timeout after 3001 ms. (steps per millisecond=460 ) properties seen :0 out of 1
Probabilistic random walk after 1382734 steps, saw 203469 distinct states, run finished after 3008 ms. (steps per millisecond=459 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8752087012109023464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14675402345986864642.kers'
[2026-05-24 21:28:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8752087012109023464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14675402345986864642.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 72 rows 100 cols 269 entries
Finished phase 1 with 52 SingleSign rule and 14 generalized
[2026-05-24 21:28:42] [INFO ] Computed 63 invariants in 0 ms
Computed 63 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14675402345986864642.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/91 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/95 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/114 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/117 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 68/185 variables, 117/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/199 variables, 10/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/199 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/201 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/201 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/201 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/201 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 129/129 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/91 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/95 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/114 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/117 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 68/185 variables, 117/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/185 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/199 variables, 10/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/199 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/199 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/201 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/201 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/201 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/201 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 579ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 538 steps, including 30 resets, run visited all 1 properties in 3 ms. (steps per millisecond=179 )
Parikh walk visited 1 properties in 9 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 67 stabilizing places and 59 stable transitions
Graph (complete) has 465 edges and 256 vertex of which 249 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.10 ms
FORMULA DES-PT-02b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 203/203 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 247 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 247 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 247 transition count 191
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 242 transition count 186
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 242 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 242 transition count 182
Applied a total of 35 rules in 39 ms. Remains 242 /256 variables (removed 14) and now considering 182/203 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3980169160168045233.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16727911370439543614.kers'
[2026-05-24 21:28:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3980169160168045233.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16727911370439543614.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 242 cols 553 entries
Finished phase 1 with 133 SingleSign rule and 47 generalized
[2026-05-24 21:28:44] [INFO ] Computed 62 invariants in 2 ms
Computed 62 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16727911370439543614.kers
Total runtime 3 ms.
[2026-05-24 21:28:44] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-24 21:28:44] [INFO ] Invariant cache hit.
[2026-05-24 21:28:44] [INFO ] Implicit Places using invariants and state equation in 495 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 734 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 241/256 places, 182/203 transitions.
Applied a total of 0 rules in 12 ms. Remains 241 /241 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 786 ms. Remains : 241/256 places, 182/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&p1)))'
Stuttering acceptance computed with spot in 438 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA DES-PT-02b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-00 finished in 1341 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 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 203/203 transitions.
Graph (complete) has 465 edges and 256 vertex of which 249 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 248 transition count 183
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 233 transition count 183
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 233 transition count 173
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 51 place count 223 transition count 173
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 57 place count 217 transition count 167
Iterating global reduction 2 with 6 rules applied. Total rules applied 63 place count 217 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 217 transition count 163
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 216 transition count 162
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 72 place count 213 transition count 159
Iterating global reduction 4 with 3 rules applied. Total rules applied 75 place count 213 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 78 place count 213 transition count 156
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 78 place count 213 transition count 153
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 84 place count 210 transition count 153
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 5 with 154 rules applied. Total rules applied 238 place count 133 transition count 76
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 242 place count 131 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 244 place count 129 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 245 place count 128 transition count 76
Applied a total of 245 rules in 103 ms. Remains 128 /256 variables (removed 128) and now considering 76/203 (removed 127) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12766658542240787556.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8150715405676469464.kers'
[2026-05-24 21:28:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12766658542240787556.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8150715405676469464.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 76 rows 99 cols 272 entries
Finished phase 1 with 51 SingleSign rule and 19 generalized
[2026-05-24 21:28:45] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8150715405676469464.kers
Total runtime 2 ms.
[2026-05-24 21:28:45] [INFO ] Implicit Places using invariants in 176 ms returned []
[2026-05-24 21:28:45] [INFO ] Invariant cache hit.
[2026-05-24 21:28:45] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2026-05-24 21:28:45] [INFO ] Redundant transitions in 3 ms returned []
Running 73 sub problems to find dead transitions.
[2026-05-24 21:28:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 2/127 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 76/203 variables, 127/185 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 1/204 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/204 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 189 constraints, problems are : Problem set: 0 solved, 73 unsolved in 6697 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 2/127 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 76/203 variables, 127/188 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 73/261 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 1/204 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/204 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/204 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (OVERLAPS) 0/204 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 263 constraints, problems are : Problem set: 0 solved, 73 unsolved in 27326 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34042ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 34043ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/256 places, 76/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34545 ms. Remains : 128/256 places, 76/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-01
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-01 finished in 34624 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)||(G(!p1)&&(p1||G(p0)||(p0&&(F(!p0) U p2))))||G((p1||(p0&&(F(!p0) U p2)))))))'
Support contains 3 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 203/203 transitions.
Graph (complete) has 465 edges and 256 vertex of which 249 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 248 transition count 186
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 236 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 235 transition count 185
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 27 place count 235 transition count 176
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 45 place count 226 transition count 176
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 52 place count 219 transition count 169
Iterating global reduction 3 with 7 rules applied. Total rules applied 59 place count 219 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 219 transition count 165
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 65 place count 218 transition count 164
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 69 place count 214 transition count 160
Iterating global reduction 5 with 4 rules applied. Total rules applied 73 place count 214 transition count 160
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 76 place count 214 transition count 157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 76 place count 214 transition count 155
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 80 place count 212 transition count 155
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 232 place count 136 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 236 place count 134 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 238 place count 132 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 239 place count 131 transition count 79
Applied a total of 239 rules in 61 ms. Remains 131 /256 variables (removed 125) and now considering 79/203 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4326186770280948858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-400502690807692485.kers'
[2026-05-24 21:29:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4326186770280948858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-400502690807692485.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 79 rows 104 cols 278 entries
Finished phase 1 with 55 SingleSign rule and 18 generalized
[2026-05-24 21:29:20] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-400502690807692485.kers
Total runtime 1 ms.
[2026-05-24 21:29:20] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-24 21:29:20] [INFO ] Invariant cache hit.
[2026-05-24 21:29:20] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2026-05-24 21:29:20] [INFO ] Redundant transitions in 2 ms returned []
Running 76 sub problems to find dead transitions.
[2026-05-24 21:29:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 2/130 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 79/209 variables, 130/190 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/210 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/210 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 192 constraints, problems are : Problem set: 0 solved, 76 unsolved in 8050 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 2/130 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 79/209 variables, 130/194 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 76/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/210 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/210 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 271 constraints, problems are : Problem set: 0 solved, 76 unsolved in 20739 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28823ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 28824ms
Starting structural reductions in SI_LTL mode, iteration 1 : 131/256 places, 79/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29509 ms. Remains : 131/256 places, 79/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1||(p0&&(F(!p0) U p2))))||(G(!p1)&&(p1||G(p0)||(p0&&(F(!p0) U p2)))))))'
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1)), false, false, (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-02b-LTLFireability-02
Product exploration explored 100000 steps with 8782 reset in 714 ms.
Product exploration explored 100000 steps with 8754 reset in 443 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
Knowledge based reduction with 20 factoid took 77 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
RANDOM walk for 29356 steps (1383 resets) in 184 ms. (158 steps per ms) remains 0/9 properties
Knowledge based reduction with 20 factoid took 188 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p1) (NOT p0) (NOT p2))]
Knowledge-based reduction took 482 ms.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 79/79 transitions.
Applied a total of 0 rules in 9 ms. Remains 131 /131 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2026-05-24 21:29:51] [INFO ] Invariant cache hit.
[2026-05-24 21:29:51] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-24 21:29:51] [INFO ] Invariant cache hit.
[2026-05-24 21:29:52] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2026-05-24 21:29:52] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 602 ms. Remains : 131/131 places, 79/79 transitions.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
Knowledge based reduction with 19 factoid took 98 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
RANDOM walk for 7613 steps (357 resets) in 46 ms. (161 steps per ms) remains 0/9 properties
Knowledge based reduction with 19 factoid took 269 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p1) (NOT p0) (NOT p2))]
Knowledge-based reduction took 570 ms.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p1) (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p1) (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 5183 reset in 433 ms.
Product exploration explored 100000 steps with 5168 reset in 523 ms.
Built C files in :
/tmp/ltsmin9618707815314152992
[2026-05-24 21:29:54] [INFO ] Computing symmetric may disable matrix : 79 transitions.
[2026-05-24 21:29:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 21:29:54] [INFO ] Computing symmetric may enable matrix : 79 transitions.
[2026-05-24 21:29:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 21:29:54] [INFO ] Computing Do-Not-Accords matrix : 79 transitions.
[2026-05-24 21:29:54] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 21:29:54] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9618707815314152992
Running compilation step : cd /tmp/ltsmin9618707815314152992;'/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 754 ms.
Running link step : cd /tmp/ltsmin9618707815314152992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 98 ms.
Running LTSmin : cd /tmp/ltsmin9618707815314152992;'/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/stateBased940890173361111864.hoa' '--buchi-type=spotba'
LTSmin run took 3564 ms.
FORMULA DES-PT-02b-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-02b-LTLFireability-02 finished in 38630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(F(p1))))&&p0)))'
Support contains 3 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 203/203 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 248 transition count 195
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 248 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 248 transition count 192
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 244 transition count 188
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 244 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 244 transition count 185
Applied a total of 30 rules in 18 ms. Remains 244 /256 variables (removed 12) and now considering 185/203 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14060745944359422580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1691995684206965224.kers'
[2026-05-24 21:29:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14060745944359422580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1691995684206965224.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 244 cols 561 entries
Finished phase 1 with 135 SingleSign rule and 47 generalized
[2026-05-24 21:29:58] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1691995684206965224.kers
Total runtime 2 ms.
[2026-05-24 21:29:58] [INFO ] Implicit Places using invariants in 218 ms returned []
[2026-05-24 21:29:58] [INFO ] Invariant cache hit.
[2026-05-24 21:29:59] [INFO ] Implicit Places using invariants and state equation in 452 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 673 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 243/256 places, 185/203 transitions.
Applied a total of 0 rules in 10 ms. Remains 243 /243 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 701 ms. Remains : 243/256 places, 185/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(F(p1))))&&p0)))'
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLFireability-03
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-03 finished in 950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))&&(G(p1) U X(G(p2))))))'
Support contains 5 out of 256 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 : 256/256 places, 203/203 transitions.
Graph (complete) has 465 edges and 256 vertex of which 253 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 252 transition count 185
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 238 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 238 transition count 175
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 228 transition count 175
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 222 transition count 169
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 222 transition count 169
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 222 transition count 167
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 218 transition count 163
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 218 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 218 transition count 160
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 74 place count 218 transition count 157
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 80 place count 215 transition count 157
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 230 place count 140 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 234 place count 138 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 238 place count 138 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 240 place count 136 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 241 place count 135 transition count 81
Applied a total of 241 rules in 91 ms. Remains 135 /256 variables (removed 121) and now considering 81/203 (removed 122) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14114155897016362892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9776877269570992562.kers'
[2026-05-24 21:29:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14114155897016362892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9776877269570992562.kers]
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 81 rows 108 cols 292 entries
Finished phase 1 with 58 SingleSign rule and 16 generalized
[2026-05-24 21:29:59] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9776877269570992562.kers
Total runtime 1 ms.
[2026-05-24 21:29:59] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-05-24 21:29:59] [INFO ] Invariant cache hit.
[2026-05-24 21:30:00] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2026-05-24 21:30:00] [INFO ] Redundant transitions in 2 ms returned []
Running 77 sub problems to find dead transitions.
[2026-05-24 21:30:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/132 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 3/135 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 81/216 variables, 135/197 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/216 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 198 constraints, problems are : Problem set: 0 solved, 77 unsolved in 6752 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 1/132 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 3/135 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 81/216 variables, 135/198 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 77/275 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/216 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (OVERLAPS) 0/216 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 276 constraints, problems are : Problem set: 0 solved, 77 unsolved in 25959 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32737ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 32740ms
Starting structural reductions in SI_LTL mode, iteration 1 : 135/256 places, 81/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33366 ms. Remains : 135/256 places, 81/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))&&(G(p1) U X(G(p2))))))'
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : DES-PT-02b-LTLFireability-06
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-06 finished in 33528 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)&&F(p2))))'
Support contains 5 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 203/203 transitions.
Graph (complete) has 465 edges and 256 vertex of which 249 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 248 transition count 185
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 235 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 235 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 47 place count 225 transition count 175
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 54 place count 218 transition count 168
Iterating global reduction 2 with 7 rules applied. Total rules applied 61 place count 218 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 218 transition count 164
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 217 transition count 163
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 71 place count 213 transition count 159
Iterating global reduction 4 with 4 rules applied. Total rules applied 75 place count 213 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 78 place count 213 transition count 156
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 78 place count 213 transition count 153
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 84 place count 210 transition count 153
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 236 place count 134 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 240 place count 132 transition count 79
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 241 place count 132 transition count 79
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 243 place count 130 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 129 transition count 77
Applied a total of 244 rules in 72 ms. Remains 129 /256 variables (removed 127) and now considering 77/203 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1783562511015238112.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11004566287246707349.kers'
[2026-05-24 21:30:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1783562511015238112.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11004566287246707349.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 77 rows 100 cols 273 entries
Finished phase 1 with 57 SingleSign rule and 14 generalized
[2026-05-24 21:30:33] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11004566287246707349.kers
Total runtime 2 ms.
[2026-05-24 21:30:33] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-24 21:30:33] [INFO ] Invariant cache hit.
[2026-05-24 21:30:33] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2026-05-24 21:30:33] [INFO ] Redundant transitions in 2 ms returned []
Running 74 sub problems to find dead transitions.
[2026-05-24 21:30:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 77/205 variables, 128/186 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 190 constraints, problems are : Problem set: 0 solved, 74 unsolved in 8706 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 10/47 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 2/128 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 77/205 variables, 128/189 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 74/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 1/206 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/206 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 264 constraints, problems are : Problem set: 0 solved, 74 unsolved in 18671 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27397ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 27398ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/256 places, 77/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28079 ms. Remains : 129/256 places, 77/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(p2))))'
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DES-PT-02b-LTLFireability-07
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-07 finished in 28269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)&&X(((F(p0)||X(p1)) U (G((F(p0)||X(p1)))||((F(p0)||X(p1))&&G(p2))))))||X(G((F(p0)||X(p1))))) U p3))'
Support contains 5 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 203/203 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 247 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 247 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 247 transition count 191
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 242 transition count 186
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 242 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 242 transition count 182
Applied a total of 35 rules in 20 ms. Remains 242 /256 variables (removed 14) and now considering 182/203 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2704734685822587725.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7101756258936526006.kers'
[2026-05-24 21:31:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2704734685822587725.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7101756258936526006.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 242 cols 553 entries
Finished phase 1 with 133 SingleSign rule and 47 generalized
[2026-05-24 21:31:01] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7101756258936526006.kers
Total runtime 2 ms.
[2026-05-24 21:31:01] [INFO ] Implicit Places using invariants in 254 ms returned []
[2026-05-24 21:31:01] [INFO ] Invariant cache hit.
[2026-05-24 21:31:02] [INFO ] Implicit Places using invariants and state equation in 553 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 819 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 241/256 places, 182/203 transitions.
Applied a total of 0 rules in 5 ms. Remains 241 /241 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 844 ms. Remains : 241/256 places, 182/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G((F(p0)||X(p1))))||(F(p0)&&X(((F(p0)||X(p1)) U (G((F(p0)||X(p1)))||((F(p0)||X(p1))&&G(p2))))))) U p3))'
Stuttering acceptance computed with spot in 393 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : DES-PT-02b-LTLFireability-08
Product exploration explored 100000 steps with 928 reset in 216 ms.
Product exploration explored 100000 steps with 935 reset in 218 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.10 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Detected a total of 64/241 stabilizing places and 57/182 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 14 factoid took 101 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 8 states, 18 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (352 resets) in 230 ms. (173 steps per ms) remains 3/12 properties
BEST_FIRST walk for 40004 steps (71 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (74 resets) in 130 ms. (305 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (66 resets) in 136 ms. (292 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9893324089458830010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10472492700702106714.kers'
[2026-05-24 21:31:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9893324089458830010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10472492700702106714.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 241 cols 551 entries
Finished phase 1 with 134 SingleSign rule and 46 generalized
[2026-05-24 21:31:03] [INFO ] Computed 61 invariants in 1 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10472492700702106714.kers
Total runtime 2 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 51/54 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 104/158 variables, 28/35 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 59/217 variables, 22/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 2/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/225 variables, 4/64 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 169/394 variables, 225/289 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 0/289 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 19/413 variables, 11/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/419 variables, 3/303 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/419 variables, 0/303 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/421 variables, 1/304 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/421 variables, 0/304 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/423 variables, 1/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/423 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/423 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 305 constraints, problems are : Problem set: 1 solved, 2 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/54 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 104/158 variables, 28/35 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/36 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 59/217 variables, 22/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 2/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/225 variables, 4/64 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 1/65 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 169/394 variables, 225/290 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 2/292 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem apf5 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Int declared 394/423 variables, and 293 constraints, problems are : Problem set: 3 solved, 0 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 225/241 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1453ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge based reduction with 17 factoid took 455 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p3)]
[2026-05-24 21:31:05] [INFO ] Invariant cache hit.
[2026-05-24 21:31:05] [INFO ] [Real]Absence check using 35 positive place invariants in 33 ms returned sat
[2026-05-24 21:31:05] [INFO ] [Real]Absence check using 35 positive and 26 generalized place invariants in 86 ms returned sat
[2026-05-24 21:31:07] [INFO ] [Real]Absence check using state equation in 1582 ms returned sat
[2026-05-24 21:31:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 21:31:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 22 ms returned sat
[2026-05-24 21:31:07] [INFO ] [Nat]Absence check using 35 positive and 26 generalized place invariants in 69 ms returned sat
[2026-05-24 21:31:08] [INFO ] [Nat]Absence check using state equation in 1258 ms returned sat
[2026-05-24 21:31:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 628 ms
[2026-05-24 21:31:09] [INFO ] Computed and/alt/rep : 180/305/180 causal constraints (skipped 1 transitions) in 20 ms.
[2026-05-24 21:31:12] [INFO ] Added : 136 causal constraints over 28 iterations in 3202 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 9639 ms.
Stuttering acceptance computed with spot in 54 ms :[(NOT p3)]
Support contains 2 out of 241 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 : 241/241 places, 182/182 transitions.
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 235 transition count 165
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 222 transition count 165
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 27 place count 222 transition count 153
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 51 place count 210 transition count 153
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 195 place count 138 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 136 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 201 place count 134 transition count 81
Applied a total of 201 rules in 29 ms. Remains 134 /241 variables (removed 107) and now considering 81/182 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-55547271404086708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15587152239488927187.kers'
[2026-05-24 21:31:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-55547271404086708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15587152239488927187.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 0 ms.
// Phase 1: matrix 81 rows 114 cols 336 entries
Finished phase 1 with 48 SingleSign rule and 27 generalized
[2026-05-24 21:31:12] [INFO ] Computed 59 invariants in 1 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15587152239488927187.kers
Total runtime 2 ms.
[2026-05-24 21:31:13] [INFO ] Implicit Places using invariants in 226 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 252 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/241 places, 81/182 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 287 ms. Remains : 133/241 places, 81/182 transitions.
Computed a total of 26 stabilizing places and 21 stable transitions
Computed a total of 26 stabilizing places and 21 stable transitions
Knowledge based reduction with 3 factoid took 61 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 2266 steps (100 resets) in 14 ms. (151 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 73 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 44 ms :[(NOT p3)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12119531213567527529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7904445351083301.kers'
[2026-05-24 21:31:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12119531213567527529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7904445351083301.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 81 rows 114 cols 336 entries
Finished phase 1 with 48 SingleSign rule and 27 generalized
[2026-05-24 21:31:13] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7904445351083301.kers
Total runtime 1 ms.
[2026-05-24 21:31:13] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2026-05-24 21:31:13] [INFO ] [Real]Absence check using 35 positive and 23 generalized place invariants in 25 ms returned sat
[2026-05-24 21:31:14] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2026-05-24 21:31:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 21:31:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2026-05-24 21:31:14] [INFO ] [Nat]Absence check using 35 positive and 23 generalized place invariants in 28 ms returned sat
[2026-05-24 21:31:14] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2026-05-24 21:31:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-24 21:31:14] [INFO ] [Nat]Added 6 Read/Feed constraints in 14 ms returned sat
[2026-05-24 21:31:14] [INFO ] Computed and/alt/rep : 69/182/69 causal constraints (skipped 8 transitions) in 9 ms.
[2026-05-24 21:31:14] [INFO ] Added : 58 causal constraints over 12 iterations in 318 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 1701 ms.
Stuttering acceptance computed with spot in 58 ms :[(NOT p3)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p3)]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-08 finished in 13588 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 U (p2||G(!p1)))))))'
Support contains 5 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 203/203 transitions.
Graph (complete) has 465 edges and 256 vertex of which 249 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 248 transition count 183
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 233 transition count 183
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 31 place count 233 transition count 174
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 49 place count 224 transition count 174
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 56 place count 217 transition count 167
Iterating global reduction 2 with 7 rules applied. Total rules applied 63 place count 217 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 217 transition count 163
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 216 transition count 162
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 73 place count 212 transition count 158
Iterating global reduction 4 with 4 rules applied. Total rules applied 77 place count 212 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 80 place count 212 transition count 155
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 80 place count 212 transition count 153
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 84 place count 210 transition count 153
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 226 place count 139 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 230 place count 137 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 232 place count 135 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 134 transition count 82
Applied a total of 233 rules in 44 ms. Remains 134 /256 variables (removed 122) and now considering 82/203 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17583649408316906541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8489672735661946681.kers'
[2026-05-24 21:31:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17583649408316906541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8489672735661946681.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 82 rows 122 cols 332 entries
Finished phase 1 with 51 SingleSign rule and 25 generalized
[2026-05-24 21:31:15] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8489672735661946681.kers
Total runtime 1 ms.
[2026-05-24 21:31:15] [INFO ] Implicit Places using invariants in 193 ms returned []
[2026-05-24 21:31:15] [INFO ] Invariant cache hit.
[2026-05-24 21:31:15] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2026-05-24 21:31:15] [INFO ] Redundant transitions in 2 ms returned []
Running 78 sub problems to find dead transitions.
[2026-05-24 21:31:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 1/131 variables, 16/47 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 2/133 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 82/215 variables, 133/194 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (OVERLAPS) 1/216 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 15 (OVERLAPS) 0/216 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 197 constraints, problems are : Problem set: 0 solved, 78 unsolved in 9288 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 1/131 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 2/133 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 82/215 variables, 133/196 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 78/274 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 1/216 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 16 (OVERLAPS) 0/216 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 216/216 variables, and 279 constraints, problems are : Problem set: 0 solved, 78 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 39320ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 39321ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/256 places, 82/203 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39923 ms. Remains : 134/256 places, 82/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(!p1 U (p2||G(!p1)))))))'
Stuttering acceptance computed with spot in 44 ms :[(OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : DES-PT-02b-LTLFireability-09
Product exploration explored 100000 steps with 4338 reset in 424 ms.
Product exploration explored 100000 steps with 4341 reset in 413 ms.
Computed a total of 25 stabilizing places and 20 stable transitions
Computed a total of 25 stabilizing places and 20 stable transitions
Knowledge based reduction with 2 factoid took 233 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/5 properties
Knowledge based reduction with 2 factoid took 401 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p0) (AND p1 (NOT p2)))]
Knowledge-based reduction took 695 ms.
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p0) (AND p1 (NOT p2)))]
Support contains 5 out of 134 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 134/134 places, 82/82 transitions.
Applied a total of 0 rules in 5 ms. Remains 134 /134 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2026-05-24 21:31:56] [INFO ] Invariant cache hit.
[2026-05-24 21:31:56] [INFO ] Implicit Places using invariants in 257 ms returned []
[2026-05-24 21:31:56] [INFO ] Invariant cache hit.
[2026-05-24 21:31:57] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2026-05-24 21:31:57] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 639 ms. Remains : 134/134 places, 82/82 transitions.
Computed a total of 25 stabilizing places and 20 stable transitions
Computed a total of 25 stabilizing places and 20 stable transitions
Knowledge based reduction with 2 factoid took 345 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/5 properties
Knowledge based reduction with 2 factoid took 420 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(OR (NOT p0) (AND p1 (NOT p2)))]
Knowledge-based reduction took 827 ms.
Stuttering acceptance computed with spot in 55 ms :[(OR (NOT p0) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p0) (AND p1 (NOT p2)))]
Product exploration explored 100000 steps with 4345 reset in 264 ms.
Product exploration explored 100000 steps with 4325 reset in 393 ms.
Built C files in :
/tmp/ltsmin17312189348636406584
[2026-05-24 21:31:58] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2026-05-24 21:31:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 21:31:58] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2026-05-24 21:31:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 21:31:58] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2026-05-24 21:31:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 21:31:58] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17312189348636406584
Running compilation step : cd /tmp/ltsmin17312189348636406584;'/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 495 ms.
Running link step : cd /tmp/ltsmin17312189348636406584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17312189348636406584;'/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/stateBased8119837386543826689.hoa' '--buchi-type=spotba'
LTSmin run took 708 ms.
FORMULA DES-PT-02b-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-02b-LTLFireability-09 finished in 45147 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))&&(X(X((G(p1)||(p1&&F(!p2))))) U (X(X(G((G(p1)||(p1&&F(!p2))))))||(p3&&X(X((G(p1)||(p1&&F(!p2))))))))))'
Support contains 12 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 203/203 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 249 transition count 196
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 249 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 249 transition count 193
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 246 transition count 190
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 246 transition count 190
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 246 transition count 188
Applied a total of 25 rules in 9 ms. Remains 246 /256 variables (removed 10) and now considering 188/203 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7058280576076834943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3755997572889945585.kers'
[2026-05-24 21:32:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7058280576076834943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3755997572889945585.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 188 rows 246 cols 569 entries
Finished phase 1 with 136 SingleSign rule and 48 generalized
[2026-05-24 21:32:00] [INFO ] Computed 62 invariants in 2 ms
Computed 62 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3755997572889945585.kers
Total runtime 3 ms.
[2026-05-24 21:32:00] [INFO ] Implicit Places using invariants in 219 ms returned []
[2026-05-24 21:32:00] [INFO ] Invariant cache hit.
[2026-05-24 21:32:00] [INFO ] Implicit Places using invariants and state equation in 426 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 648 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 245/256 places, 188/203 transitions.
Applied a total of 0 rules in 5 ms. Remains 245 /245 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 662 ms. Remains : 245/256 places, 188/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&(X(X((G(p1)||(p1&&F(!p2))))) U (X(X(G((G(p1)||(p1&&F(!p2))))))||(p3&&X(X((G(p1)||(p1&&F(!p2))))))))))'
Stuttering acceptance computed with spot in 560 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true, (AND p2 (NOT p1)), (AND p2 (NOT p1)), (AND (NOT p1) p2), p2, (AND (NOT p1) p2)]
Running random walk in product with property : DES-PT-02b-LTLFireability-11
Product exploration explored 100000 steps with 1734 reset in 396 ms.
Product exploration explored 100000 steps with 1841 reset in 443 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 441 edges and 245 vertex of which 240 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge based reduction with 17 factoid took 74 ms. Reduced automaton from 11 states, 24 edges and 4 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 4858 steps (42 resets) in 33 ms. (142 steps per ms) remains 0/1 properties
Knowledge based reduction with 17 factoid took 64 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Knowledge-based reduction took 192 ms.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 245 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 : 245/245 places, 188/188 transitions.
Graph (complete) has 441 edges and 245 vertex of which 240 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 239 transition count 171
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 226 transition count 171
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 226 transition count 160
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 215 transition count 160
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 197 place count 141 transition count 86
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 205 place count 137 transition count 95
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 207 place count 135 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 208 place count 134 transition count 93
Applied a total of 208 rules in 26 ms. Remains 134 /245 variables (removed 111) and now considering 93/188 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3486652758583852443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10719063212100118607.kers'
[2026-05-24 21:32:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3486652758583852443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10719063212100118607.kers]
Culling duplicate invariants (modulo rational): removing 10 columns.
Culled 10 columns in 0 ms.
// Phase 1: matrix 93 rows 124 cols 401 entries
Finished phase 1 with 52 SingleSign rule and 24 generalized
[2026-05-24 21:32:02] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10719063212100118607.kers
Total runtime 1 ms.
[2026-05-24 21:32:02] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-24 21:32:02] [INFO ] Invariant cache hit.
[2026-05-24 21:32:03] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2026-05-24 21:32:03] [INFO ] Redundant transitions in 3 ms returned []
Running 89 sub problems to find dead transitions.
[2026-05-24 21:32:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/131 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 2/133 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 93/226 variables, 133/191 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 1/227 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (OVERLAPS) 0/227 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 194 constraints, problems are : Problem set: 0 solved, 89 unsolved in 10884 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/131 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 2/133 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 93/226 variables, 133/193 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 89/282 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (OVERLAPS) 1/227 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/227 variables, and 286 constraints, problems are : Problem set: 0 solved, 89 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 40933ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 40935ms
Starting structural reductions in SI_LTL mode, iteration 1 : 134/245 places, 93/188 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41453 ms. Remains : 134/245 places, 93/188 transitions.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 2119 steps (108 resets) in 12 ms. (163 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Knowledge-based reduction took 165 ms.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5018 reset in 291 ms.
Product exploration explored 100000 steps with 5070 reset in 329 ms.
Built C files in :
/tmp/ltsmin15189543486474880876
[2026-05-24 21:32:44] [INFO ] Computing symmetric may disable matrix : 93 transitions.
[2026-05-24 21:32:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 21:32:44] [INFO ] Computing symmetric may enable matrix : 93 transitions.
[2026-05-24 21:32:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 21:32:44] [INFO ] Computing Do-Not-Accords matrix : 93 transitions.
[2026-05-24 21:32:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 21:32:44] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15189543486474880876
Running compilation step : cd /tmp/ltsmin15189543486474880876;'/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 339 ms.
Running link step : cd /tmp/ltsmin15189543486474880876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15189543486474880876;'/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/stateBased18122186465328531139.hoa' '--buchi-type=spotba'
LTSmin run took 1727 ms.
FORMULA DES-PT-02b-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-02b-LTLFireability-11 finished in 46858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0||G(p1)) U G(p2)))))'
Support contains 3 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 203/203 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 248 transition count 195
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 248 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 248 transition count 192
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 244 transition count 188
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 244 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 244 transition count 185
Applied a total of 30 rules in 10 ms. Remains 244 /256 variables (removed 12) and now considering 185/203 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1297860058785771296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10297439790363903848.kers'
[2026-05-24 21:32:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1297860058785771296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10297439790363903848.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 244 cols 561 entries
Finished phase 1 with 135 SingleSign rule and 47 generalized
[2026-05-24 21:32:47] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10297439790363903848.kers
Total runtime 2 ms.
[2026-05-24 21:32:47] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-24 21:32:47] [INFO ] Invariant cache hit.
[2026-05-24 21:32:47] [INFO ] Implicit Places using invariants and state equation in 363 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 591 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 243/256 places, 185/203 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 604 ms. Remains : 243/256 places, 185/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0||G(p1)) U G(p2)))))'
Stuttering acceptance computed with spot in 323 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-12
Product exploration explored 100000 steps with 20028 reset in 209 ms.
Product exploration explored 100000 steps with 20029 reset in 247 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 436 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Detected a total of 64/243 stabilizing places and 57/185 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 11 factoid took 104 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (358 resets) in 272 ms. (146 steps per ms) remains 1/15 properties
BEST_FIRST walk for 16344 steps (20 resets) in 30 ms. (527 steps per ms) remains 0/1 properties
Knowledge based reduction with 11 factoid took 340 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2))]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17192096945285962036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-377693964409548498.kers'
[2026-05-24 21:32:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17192096945285962036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-377693964409548498.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 243 cols 559 entries
Finished phase 1 with 136 SingleSign rule and 46 generalized
[2026-05-24 21:32:49] [INFO ] Computed 61 invariants in 3 ms
Computed 61 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-377693964409548498.kers
Total runtime 4 ms.
[2026-05-24 21:32:49] [INFO ] [Real]Absence check using 35 positive place invariants in 32 ms returned sat
[2026-05-24 21:32:49] [INFO ] [Real]Absence check using 35 positive and 26 generalized place invariants in 67 ms returned sat
[2026-05-24 21:32:51] [INFO ] [Real]Absence check using state equation in 1784 ms returned sat
[2026-05-24 21:32:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 21:32:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 26 ms returned sat
[2026-05-24 21:32:51] [INFO ] [Nat]Absence check using 35 positive and 26 generalized place invariants in 60 ms returned sat
[2026-05-24 21:32:53] [INFO ] [Nat]Absence check using state equation in 1816 ms returned sat
[2026-05-24 21:32:53] [INFO ] Computed and/alt/rep : 183/311/183 causal constraints (skipped 1 transitions) in 20 ms.
[2026-05-24 21:32:56] [INFO ] Added : 181 causal constraints over 37 iterations in 2966 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 8069 ms.
Stuttering acceptance computed with spot in 336 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2))]
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2026-05-24 21:32:56] [INFO ] Invariant cache hit.
[2026-05-24 21:32:57] [INFO ] Implicit Places using invariants in 320 ms returned []
[2026-05-24 21:32:57] [INFO ] Invariant cache hit.
[2026-05-24 21:32:57] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2026-05-24 21:32:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 185/428 variables, 243/335 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 13/348 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/428 variables, and 348 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 35/53 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 44/105 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 185/428 variables, 243/348 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 184/532 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 10/542 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 542 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Finished structural reductions in LTL mode , in 1 iterations and 60941 ms. Remains : 243/243 places, 185/185 transitions.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 436 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Detected a total of 64/243 stabilizing places and 57/185 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 11 factoid took 73 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (358 resets) in 167 ms. (238 steps per ms) remains 1/15 properties
BEST_FIRST walk for 17763 steps (24 resets) in 30 ms. (573 steps per ms) remains 0/1 properties
Knowledge based reduction with 11 factoid took 230 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2))]
[2026-05-24 21:33:58] [INFO ] Invariant cache hit.
[2026-05-24 21:33:58] [INFO ] [Real]Absence check using 35 positive place invariants in 21 ms returned sat
[2026-05-24 21:33:58] [INFO ] [Real]Absence check using 35 positive and 26 generalized place invariants in 41 ms returned sat
[2026-05-24 21:34:00] [INFO ] [Real]Absence check using state equation in 1978 ms returned sat
[2026-05-24 21:34:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 21:34:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 30 ms returned sat
[2026-05-24 21:34:00] [INFO ] [Nat]Absence check using 35 positive and 26 generalized place invariants in 53 ms returned sat
[2026-05-24 21:34:02] [INFO ] [Nat]Absence check using state equation in 1420 ms returned sat
[2026-05-24 21:34:02] [INFO ] Computed and/alt/rep : 183/311/183 causal constraints (skipped 1 transitions) in 14 ms.
[2026-05-24 21:34:05] [INFO ] Added : 181 causal constraints over 37 iterations in 3070 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 7642 ms.
Stuttering acceptance computed with spot in 348 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 340 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND p0 (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 19965 reset in 240 ms.
Product exploration explored 100000 steps with 20007 reset in 264 ms.
Spot run failed in 155 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/ltsmin9545662737638242733
[2026-05-24 21:34:06] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9545662737638242733
Running compilation step : cd /tmp/ltsmin9545662737638242733;'/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 746 ms.
Running link step : cd /tmp/ltsmin9545662737638242733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin9545662737638242733;'/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/stateBased3334761307480100400.hoa' '--buchi-type=spotba'
LTSmin run took 60 ms.
FORMULA DES-PT-02b-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-02b-LTLFireability-12 finished in 80699 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 U p1))||G(p2)))'
Support contains 5 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 203/203 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 248 transition count 195
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 248 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 248 transition count 193
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 243 transition count 188
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 243 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 243 transition count 184
Applied a total of 32 rules in 17 ms. Remains 243 /256 variables (removed 13) and now considering 184/203 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-693882666038569615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-616163078678477503.kers'
[2026-05-24 21:34:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-693882666038569615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-616163078678477503.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 184 rows 243 cols 559 entries
Finished phase 1 with 133 SingleSign rule and 48 generalized
[2026-05-24 21:34:07] [INFO ] Computed 62 invariants in 2 ms
Computed 62 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-616163078678477503.kers
Total runtime 3 ms.
[2026-05-24 21:34:08] [INFO ] Implicit Places using invariants in 323 ms returned []
[2026-05-24 21:34:08] [INFO ] Invariant cache hit.
[2026-05-24 21:34:08] [INFO ] Implicit Places using invariants and state equation in 515 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 840 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 242/256 places, 184/203 transitions.
Applied a total of 0 rules in 4 ms. Remains 242 /242 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 862 ms. Remains : 242/256 places, 184/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||G(p2)))'
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DES-PT-02b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-13 finished in 1116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (X(G(p0))||(p0&&X((p0&&(p0 U (!p1||G(p0))))))))))'
Support contains 3 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 203/203 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 247 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 247 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 247 transition count 191
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 242 transition count 186
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 242 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 242 transition count 182
Applied a total of 35 rules in 15 ms. Remains 242 /256 variables (removed 14) and now considering 182/203 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1171128728777422179.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15485031172934983880.kers'
[2026-05-24 21:34:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1171128728777422179.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15485031172934983880.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 182 rows 242 cols 553 entries
Finished phase 1 with 133 SingleSign rule and 47 generalized
[2026-05-24 21:34:08] [INFO ] Computed 62 invariants in 2 ms
Computed 62 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-15485031172934983880.kers
Total runtime 7 ms.
[2026-05-24 21:34:09] [INFO ] Implicit Places using invariants in 270 ms returned []
[2026-05-24 21:34:09] [INFO ] Invariant cache hit.
[2026-05-24 21:34:09] [INFO ] Implicit Places using invariants and state equation in 552 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 839 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 241/256 places, 182/203 transitions.
Applied a total of 0 rules in 4 ms. Remains 241 /241 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 860 ms. Remains : 241/256 places, 182/203 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (X(G(p0))||(p0&&X((p0&&(p0 U (!p1||G(p0))))))))))'
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 140 ms.
Product exploration explored 100000 steps with 33333 reset in 173 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 431 edges and 241 vertex of which 236 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Detected a total of 64/241 stabilizing places and 57/182 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 17 ms. Proved property starting from automaton with 6 states, 10 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA DES-PT-02b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-02b-LTLFireability-15 finished in 1514 ms.
All properties solved by simple procedures.
Total runtime 397102 ms.
BK_STOP 1779658450360
--------------------
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="DES-PT-02b"
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 DES-PT-02b, 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 r082-smll-177946993700340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-02b.tgz
mv DES-PT-02b 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 ;