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.r194-tall-177969914000292.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 NoC3x3-PT-3A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914000292
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 8.2K Mar 8 06:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Mar 8 06:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 8 06:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 8 06:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 16 08:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 16 08:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 16 08:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 8 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 8 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Mar 8 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 8 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 16 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 133K 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 NoC3x3-PT-3A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779746476985

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 22:01:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 22:01:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 22:01:18] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2026-05-25 22:01:18] [INFO ] Transformed 370 places.
[2026-05-25 22:01:18] [INFO ] Transformed 450 transitions.
[2026-05-25 22:01:18] [INFO ] Found NUPN structural information;
[2026-05-25 22:01:18] [INFO ] Parsed PT model containing 370 places and 450 transitions and 1773 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA NoC3x3-PT-3A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 70 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 449/449 transitions.
Ensure Unique test removed 15 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 355 transition count 449
Discarding 92 places :
Symmetric choice reduction at 1 with 92 rule applications. Total rules 107 place count 263 transition count 341
Ensure Unique test removed 33 places
Iterating global reduction 1 with 125 rules applied. Total rules applied 232 place count 230 transition count 341
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 291 place count 230 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 315 place count 230 transition count 258
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 321 place count 224 transition count 258
Applied a total of 321 rules in 53 ms. Remains 224 /370 variables (removed 146) and now considering 258/449 (removed 191) transitions.
[2026-05-25 22:01:18] [INFO ] Flow matrix only has 243 transitions (discarded 15 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3131875875941256192.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2041196990841789547.kers'
[2026-05-25 22:01:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3131875875941256192.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2041196990841789547.kers]
Normalized transition count is 242 out of 243 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 242 rows 218 cols 832 entries
Finished phase 1 with 131 SingleSign rule and 20 generalized
[2026-05-25 22:01:18] [INFO ] Computed 73 invariants in 1 ms
Computed 73 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2041196990841789547.kers
Total runtime 2 ms.
[2026-05-25 22:01:18] [INFO ] Implicit Places using invariants in 264 ms returned []
[2026-05-25 22:01:18] [INFO ] Flow matrix only has 243 transitions (discarded 15 similar events)
[2026-05-25 22:01:18] [INFO ] Invariant cache hit.
[2026-05-25 22:01:19] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 22:01:19] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2026-05-25 22:01:19] [INFO ] Flow matrix only has 243 transitions (discarded 15 similar events)
[2026-05-25 22:01:19] [INFO ] Invariant cache hit.
[2026-05-25 22:01:19] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 1/221 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 3/224 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 242/466 variables, 224/297 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 10/307 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (OVERLAPS) 1/467 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 12 (OVERLAPS) 0/467 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 308 constraints, problems are : Problem set: 0 solved, 257 unsolved in 18856 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 224/224 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 1/221 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 3/224 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (OVERLAPS) 242/466 variables, 224/297 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 10/307 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/466 variables, 257/564 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/466 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 11 (OVERLAPS) 1/467 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 565 constraints, problems are : Problem set: 0 solved, 257 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 224/224 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48959ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 48970ms
Starting structural reductions in LTL mode, iteration 1 : 224/370 places, 258/449 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49563 ms. Remains : 224/370 places, 258/449 transitions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Applied a total of 0 rules in 4 ms. Remains 224 /224 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2026-05-25 22:02:08] [INFO ] Flow matrix only has 243 transitions (discarded 15 similar events)
[2026-05-25 22:02:08] [INFO ] Invariant cache hit.
[2026-05-25 22:02:08] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-25 22:02:08] [INFO ] Flow matrix only has 243 transitions (discarded 15 similar events)
[2026-05-25 22:02:08] [INFO ] Invariant cache hit.
[2026-05-25 22:02:08] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 22:02:08] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 224/224 places, 258/258 transitions.
Support contains 70 out of 224 places after structural reductions.
[2026-05-25 22:02:08] [INFO ] Flatten gal took : 44 ms
[2026-05-25 22:02:08] [INFO ] Flatten gal took : 19 ms
[2026-05-25 22:02:08] [INFO ] Input system was already deterministic with 258 transitions.
RANDOM walk for 40000 steps (8 resets) in 1772 ms. (22 steps per ms) remains 0/41 properties
Computed a total of 4 stabilizing places and 1 stable transitions
Graph (complete) has 674 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U p2)||G(p3)))'
Support contains 8 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 219 transition count 258
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 24 place count 200 transition count 232
Ensure Unique test removed 9 places
Iterating global reduction 1 with 28 rules applied. Total rules applied 52 place count 191 transition count 232
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 63 place count 191 transition count 221
Applied a total of 63 rules in 9 ms. Remains 191 /224 variables (removed 33) and now considering 221/258 (removed 37) transitions.
[2026-05-25 22:02:09] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2008762404024808893.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16260688534742762171.kers'
[2026-05-25 22:02:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2008762404024808893.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16260688534742762171.kers]
Normalized transition count is 211 out of 212 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 211 rows 190 cols 694 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-25 22:02:09] [INFO ] Computed 59 invariants in 1 ms
Computed 59 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16260688534742762171.kers
Total runtime 1 ms.
[2026-05-25 22:02:09] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-25 22:02:09] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
[2026-05-25 22:02:09] [INFO ] Invariant cache hit.
[2026-05-25 22:02:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:02:09] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-25 22:02:09] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
[2026-05-25 22:02:09] [INFO ] Invariant cache hit.
[2026-05-25 22:02:09] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 1/191 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 211/402 variables, 191/250 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 9/259 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (OVERLAPS) 1/403 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (OVERLAPS) 0/403 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 260 constraints, problems are : Problem set: 0 solved, 220 unsolved in 12203 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 191/191 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 1/191 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 211/402 variables, 191/250 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 9/259 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 220/479 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (OVERLAPS) 1/403 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (OVERLAPS) 0/403 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 480 constraints, problems are : Problem set: 0 solved, 220 unsolved in 22499 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 191/191 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34742ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 34743ms
Starting structural reductions in LTL mode, iteration 1 : 191/224 places, 221/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34993 ms. Remains : 191/224 places, 221/258 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(p1 U p2)||G(p3)))'
Stuttering acceptance computed with spot in 507 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-00 finished in 35583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 5 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Graph (complete) has 674 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 218 transition count 209
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 169 transition count 207
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 167 transition count 207
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 124 place count 146 transition count 178
Ensure Unique test removed 9 places
Iterating global reduction 3 with 30 rules applied. Total rules applied 154 place count 137 transition count 178
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 18 rules applied. Total rules applied 172 place count 137 transition count 160
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 9 rules applied. Total rules applied 181 place count 130 transition count 158
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 183 place count 128 transition count 158
Applied a total of 183 rules in 32 ms. Remains 128 /224 variables (removed 96) and now considering 158/258 (removed 100) transitions.
[2026-05-25 22:02:45] [INFO ] Flow matrix only has 150 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4615417202933269818.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14023544978512062283.kers'
[2026-05-25 22:02:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4615417202933269818.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14023544978512062283.kers]
Normalized transition count is 149 out of 150 initially.
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 149 rows 120 cols 512 entries
Finished phase 1 with 68 SingleSign rule and 2 generalized
[2026-05-25 22:02:45] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14023544978512062283.kers
Total runtime 1 ms.
[2026-05-25 22:02:45] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 22:02:45] [INFO ] Flow matrix only has 150 transitions (discarded 8 similar events)
[2026-05-25 22:02:45] [INFO ] Invariant cache hit.
[2026-05-25 22:02:45] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 22:02:45] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2026-05-25 22:02:45] [INFO ] Redundant transitions in 4 ms returned []
Running 157 sub problems to find dead transitions.
[2026-05-25 22:02:45] [INFO ] Flow matrix only has 150 transitions (discarded 8 similar events)
[2026-05-25 22:02:45] [INFO ] Invariant cache hit.
[2026-05-25 22:02:45] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 149/277 variables, 128/186 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 32/218 constraints. Problems are: Problem set: 0 solved, 157 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (OVERLAPS) 1/278 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (OVERLAPS) 0/278 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 219 constraints, problems are : Problem set: 0 solved, 157 unsolved in 4914 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (OVERLAPS) 149/277 variables, 128/186 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 32/218 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 157/375 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 8 (OVERLAPS) 1/278 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 10 (OVERLAPS) 0/278 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 376 constraints, problems are : Problem set: 0 solved, 157 unsolved in 8764 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13701ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 13703ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/224 places, 158/258 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13924 ms. Remains : 128/224 places, 158/258 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-01 finished in 14094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U (F(p2)&&p1))&&X((p3||G(p2)))))'
Support contains 8 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 219 transition count 258
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 25 place count 199 transition count 230
Ensure Unique test removed 8 places
Iterating global reduction 1 with 28 rules applied. Total rules applied 53 place count 191 transition count 230
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 63 place count 191 transition count 220
Applied a total of 63 rules in 18 ms. Remains 191 /224 variables (removed 33) and now considering 220/258 (removed 38) transitions.
[2026-05-25 22:02:59] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1850977130938962581.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12242893627299647189.kers'
[2026-05-25 22:02:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1850977130938962581.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12242893627299647189.kers]
Normalized transition count is 211 out of 212 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 211 rows 190 cols 696 entries
Finished phase 1 with 127 SingleSign rule and 4 generalized
[2026-05-25 22:02:59] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12242893627299647189.kers
Total runtime 2 ms.
[2026-05-25 22:02:59] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 22:02:59] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2026-05-25 22:02:59] [INFO ] Invariant cache hit.
[2026-05-25 22:02:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:02:59] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-25 22:02:59] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2026-05-25 22:02:59] [INFO ] Invariant cache hit.
[2026-05-25 22:02:59] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 1/191 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 211/402 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/403 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/403 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 261 constraints, problems are : Problem set: 0 solved, 219 unsolved in 11991 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 191/191 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 1/191 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 211/402 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 219/479 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 1/403 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (OVERLAPS) 0/403 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 480 constraints, problems are : Problem set: 0 solved, 219 unsolved in 24572 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 191/191 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36580ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 36593ms
Starting structural reductions in LTL mode, iteration 1 : 191/224 places, 220/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36833 ms. Remains : 191/224 places, 220/258 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U (F(p2)&&p1))&&X((p3||G(p2)))))'
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) (NOT p2)), true, p0, (NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 34 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-03 finished in 37121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U (p1 U p2)) U X(p1))&&F(p3)))'
Support contains 7 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 218 transition count 258
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 26 place count 198 transition count 230
Ensure Unique test removed 9 places
Iterating global reduction 1 with 29 rules applied. Total rules applied 55 place count 189 transition count 230
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 66 place count 189 transition count 219
Applied a total of 66 rules in 11 ms. Remains 189 /224 variables (removed 35) and now considering 219/258 (removed 39) transitions.
[2026-05-25 22:03:36] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10865321527186412891.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16388466671600476877.kers'
[2026-05-25 22:03:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10865321527186412891.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16388466671600476877.kers]
Normalized transition count is 210 out of 211 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 189 cols 690 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-05-25 22:03:36] [INFO ] Computed 58 invariants in 0 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16388466671600476877.kers
Total runtime 1 ms.
[2026-05-25 22:03:36] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 22:03:36] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2026-05-25 22:03:36] [INFO ] Invariant cache hit.
[2026-05-25 22:03:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:03:36] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-25 22:03:36] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2026-05-25 22:03:36] [INFO ] Invariant cache hit.
[2026-05-25 22:03:36] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 257 constraints, problems are : Problem set: 0 solved, 218 unsolved in 10959 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 218/474 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 475 constraints, problems are : Problem set: 0 solved, 218 unsolved in 20504 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31484ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 31485ms
Starting structural reductions in LTL mode, iteration 1 : 189/224 places, 219/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31716 ms. Remains : 189/224 places, 219/258 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U (p1 U p2)) U X(p1))&&F(p3)))'
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p3) (NOT p1)), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-04 finished in 32079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Graph (complete) has 674 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 217 transition count 205
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 116 place count 159 transition count 200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 116 place count 159 transition count 199
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 157 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 119 place count 157 transition count 198
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 156 transition count 198
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 142 place count 135 transition count 169
Ensure Unique test removed 9 places
Iterating global reduction 2 with 30 rules applied. Total rules applied 172 place count 126 transition count 169
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 20 rules applied. Total rules applied 192 place count 126 transition count 149
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 211 place count 113 transition count 143
Applied a total of 211 rules in 17 ms. Remains 113 /224 variables (removed 111) and now considering 143/258 (removed 115) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18075358313719865035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-156418481390161505.kers'
[2026-05-25 22:04:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18075358313719865035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-156418481390161505.kers]
Normalized transition count is 142 out of 143 initially.
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 142 rows 86 cols 340 entries
Finished phase 1 with 64 SingleSign rule and 2 generalized
[2026-05-25 22:04:08] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-156418481390161505.kers
Total runtime 1 ms.
[2026-05-25 22:04:08] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 22:04:08] [INFO ] Invariant cache hit.
[2026-05-25 22:04:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 22:04:08] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2026-05-25 22:04:08] [INFO ] Redundant transitions in 64 ms returned [24, 30, 31, 42, 43, 54, 55, 56, 59, 68, 69, 72, 82, 95, 96, 98, 102, 105, 106, 107, 113, 114, 115, 117, 121, 124, 125, 127, 130, 131, 132, 133, 139]
Found 33 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 33 transitions
Redundant transitions reduction (with SMT) removed 33 transitions.
Running 86 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6414111747362918150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6427254510326683874.kers'
[2026-05-25 22:04:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6414111747362918150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6427254510326683874.kers]
Normalized transition count is 109 out of 110 initially.
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 109 rows 86 cols 255 entries
Finished phase 1 with 64 SingleSign rule and 2 generalized
[2026-05-25 22:04:08] [INFO ] Computed 47 invariants in 0 ms
Computed 47 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6427254510326683874.kers
Total runtime 0 ms.
[2026-05-25 22:04:08] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 13/113 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 109/222 variables, 113/160 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/223 variables, and 169 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1578 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 13/113 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 109/222 variables, 113/160 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 9/169 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 86/255 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/223 variables, and 255 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2293 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3880ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3881ms
Starting structural reductions in SI_LTL mode, iteration 1 : 113/224 places, 110/258 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 113 transition count 97
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 87 transition count 97
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 44 place count 87 transition count 92
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 44 edges and 77 vertex of which 16 / 77 are part of one of the 8 SCC in 2 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 60 place count 69 transition count 87
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 69 transition count 79
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 92 place count 53 transition count 71
Graph (trivial) has 36 edges and 53 vertex of which 16 / 53 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 45 transition count 71
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 101 place count 45 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 117 place count 45 transition count 47
Applied a total of 117 rules in 18 ms. Remains 45 /113 variables (removed 68) and now considering 47/110 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2638085211170924644.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16427259155582011914.kers'
[2026-05-25 22:04:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2638085211170924644.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16427259155582011914.kers]
Normalized transition count is 46 out of 47 initially.
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 46 rows 29 cols 93 entries
Finished phase 1 with 22 SingleSign rule and 2 generalized
[2026-05-25 22:04:12] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16427259155582011914.kers
Total runtime 0 ms.
[2026-05-25 22:04:12] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 22:04:12] [INFO ] Invariant cache hit.
[2026-05-25 22:04:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 22:04:12] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/224 places, 47/258 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4198 ms. Remains : 45/224 places, 47/258 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-06 finished in 4288 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(!p0))) U ((!p2&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0))))))&&((p0 U G(p3))||X(p2)))))'
Support contains 8 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 218 transition count 258
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 25 place count 199 transition count 233
Ensure Unique test removed 9 places
Iterating global reduction 1 with 28 rules applied. Total rules applied 53 place count 190 transition count 233
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 64 place count 190 transition count 222
Applied a total of 64 rules in 6 ms. Remains 190 /224 variables (removed 34) and now considering 222/258 (removed 36) transitions.
[2026-05-25 22:04:12] [INFO ] Flow matrix only has 212 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1752652961666512811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2329694943511890087.kers'
[2026-05-25 22:04:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1752652961666512811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2329694943511890087.kers]
Normalized transition count is 211 out of 212 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 190 cols 694 entries
Finished phase 1 with 130 SingleSign rule and 2 generalized
[2026-05-25 22:04:12] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2329694943511890087.kers
Total runtime 1 ms.
[2026-05-25 22:04:12] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 22:04:12] [INFO ] Flow matrix only has 212 transitions (discarded 10 similar events)
[2026-05-25 22:04:12] [INFO ] Invariant cache hit.
[2026-05-25 22:04:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:04:13] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-25 22:04:13] [INFO ] Flow matrix only has 212 transitions (discarded 10 similar events)
[2026-05-25 22:04:13] [INFO ] Invariant cache hit.
[2026-05-25 22:04:13] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 211/401 variables, 190/248 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/402 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/402 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 258 constraints, problems are : Problem set: 0 solved, 221 unsolved in 11265 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 190/190 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 1/190 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 211/401 variables, 190/248 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 9/257 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 221/478 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 1/402 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (OVERLAPS) 0/402 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 479 constraints, problems are : Problem set: 0 solved, 221 unsolved in 23230 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 190/190 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34511ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 34514ms
Starting structural reductions in LTL mode, iteration 1 : 190/224 places, 222/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34724 ms. Remains : 190/224 places, 222/258 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(!p0))) U ((!p2&&(!p0 U (p1||G(!p0))))||G((!p0 U (p1||G(!p0))))))&&((p0 U G(p3))||X(p2)))))'
Stuttering acceptance computed with spot in 369 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p1))), true, (NOT p2), (AND p0 (NOT p1)), (AND (NOT p3) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-07 finished in 35156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 224 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Graph (complete) has 674 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 217 transition count 206
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 63 rules applied. Total rules applied 115 place count 160 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 159 transition count 200
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 116 place count 159 transition count 199
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 119 place count 157 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 119 place count 157 transition count 198
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 156 transition count 198
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 142 place count 135 transition count 170
Ensure Unique test removed 10 places
Iterating global reduction 3 with 31 rules applied. Total rules applied 173 place count 125 transition count 170
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 20 rules applied. Total rules applied 193 place count 125 transition count 150
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 19 rules applied. Total rules applied 212 place count 113 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 213 place count 112 transition count 143
Applied a total of 213 rules in 25 ms. Remains 112 /224 variables (removed 112) and now considering 143/258 (removed 115) transitions.
[2026-05-25 22:04:48] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14716642981756722000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16966148675819033143.kers'
[2026-05-25 22:04:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14716642981756722000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16966148675819033143.kers]
Normalized transition count is 141 out of 142 initially.
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 141 rows 85 cols 333 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-25 22:04:48] [INFO ] Computed 46 invariants in 0 ms
Computed 46 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16966148675819033143.kers
Total runtime 1 ms.
[2026-05-25 22:04:48] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-25 22:04:48] [INFO ] Flow matrix only has 142 transitions (discarded 1 similar events)
[2026-05-25 22:04:48] [INFO ] Invariant cache hit.
[2026-05-25 22:04:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 22:04:48] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2026-05-25 22:04:48] [INFO ] Redundant transitions in 65 ms returned [24, 30, 31, 42, 43, 55, 57, 65, 66, 69, 79, 92, 93, 95, 99, 102, 103, 104, 110, 111, 112, 114, 118, 121, 122, 124, 128, 129, 130, 131, 137, 138, 142]
Found 33 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 33 transitions
Redundant transitions reduction (with SMT) removed 33 transitions.
Running 86 sub problems to find dead transitions.
[2026-05-25 22:04:48] [INFO ] Flow matrix only has 109 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2492257648829292593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7330146997304569984.kers'
[2026-05-25 22:04:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2492257648829292593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7330146997304569984.kers]
Normalized transition count is 108 out of 109 initially.
Culling duplicate invariants (modulo rational): removing 27 columns.
Culled 27 columns in 0 ms.
// Phase 1: matrix 108 rows 85 cols 248 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-25 22:04:48] [INFO ] Computed 46 invariants in 0 ms
Computed 46 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7330146997304569984.kers
Total runtime 0 ms.
[2026-05-25 22:04:48] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 13/112 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 108/220 variables, 112/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/221 variables, and 167 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1618 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 112/112 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 13/112 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 108/220 variables, 112/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 86/253 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/221 variables, and 253 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2181 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 112/112 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3808ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3808ms
Starting structural reductions in SI_LTL mode, iteration 1 : 112/224 places, 110/258 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 112 transition count 97
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 86 transition count 97
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 44 place count 86 transition count 92
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 42 edges and 76 vertex of which 14 / 76 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 60 place count 69 transition count 87
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 67 place count 69 transition count 80
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 91 place count 53 transition count 72
Graph (trivial) has 35 edges and 53 vertex of which 16 / 53 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 45 transition count 72
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 100 place count 45 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 115 place count 45 transition count 49
Applied a total of 115 rules in 17 ms. Remains 45 /112 variables (removed 67) and now considering 49/110 (removed 61) transitions.
[2026-05-25 22:04:52] [INFO ] Flow matrix only has 48 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10204692194605143664.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4583691135283352861.kers'
[2026-05-25 22:04:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10204692194605143664.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4583691135283352861.kers]
Normalized transition count is 47 out of 48 initially.
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 0 ms.
// Phase 1: matrix 47 rows 30 cols 93 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-05-25 22:04:52] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4583691135283352861.kers
Total runtime 0 ms.
[2026-05-25 22:04:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 22:04:52] [INFO ] Flow matrix only has 48 transitions (discarded 1 similar events)
[2026-05-25 22:04:52] [INFO ] Invariant cache hit.
[2026-05-25 22:04:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 22:04:52] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/224 places, 49/258 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4130 ms. Remains : 45/224 places, 49/258 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-08 finished in 4201 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 X(G(p1))) U X((p2 U (p0 U X(!p3)))))))'
Support contains 8 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 218 transition count 258
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 27 place count 197 transition count 229
Ensure Unique test removed 9 places
Iterating global reduction 1 with 30 rules applied. Total rules applied 57 place count 188 transition count 229
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 68 place count 188 transition count 218
Applied a total of 68 rules in 9 ms. Remains 188 /224 variables (removed 36) and now considering 218/258 (removed 40) transitions.
[2026-05-25 22:04:52] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13984567867136699570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4542224028562174299.kers'
[2026-05-25 22:04:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13984567867136699570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4542224028562174299.kers]
Normalized transition count is 209 out of 210 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 188 cols 686 entries
Finished phase 1 with 128 SingleSign rule and 2 generalized
[2026-05-25 22:04:52] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4542224028562174299.kers
Total runtime 1 ms.
[2026-05-25 22:04:52] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 22:04:52] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2026-05-25 22:04:52] [INFO ] Invariant cache hit.
[2026-05-25 22:04:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:04:52] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-25 22:04:52] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2026-05-25 22:04:52] [INFO ] Invariant cache hit.
[2026-05-25 22:04:52] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 209/397 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 256 constraints, problems are : Problem set: 0 solved, 217 unsolved in 10733 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 209/397 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 217/472 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/398 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/398 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 473 constraints, problems are : Problem set: 0 solved, 217 unsolved in 20927 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31674ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 31674ms
Starting structural reductions in LTL mode, iteration 1 : 188/224 places, 218/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31891 ms. Remains : 188/224 places, 218/258 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 X(G(p1))) U X((p2 U (p0 U X(!p3)))))))'
Stuttering acceptance computed with spot in 521 ms :[(NOT p1), p3, p3, p3, p3, p3, p3, true, p3, p3, p3, p3, p3, p3, (OR (NOT p1) p3)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-09
Stuttering criterion allowed to conclude after 899 steps with 224 reset in 22 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-09 finished in 32492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(X((p1||G(p2))) U G(p3))))))'
Support contains 8 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 218 transition count 258
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 26 place count 198 transition count 232
Ensure Unique test removed 10 places
Iterating global reduction 1 with 30 rules applied. Total rules applied 56 place count 188 transition count 232
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 66 place count 188 transition count 222
Applied a total of 66 rules in 7 ms. Remains 188 /224 variables (removed 36) and now considering 222/258 (removed 36) transitions.
[2026-05-25 22:05:24] [INFO ] Flow matrix only has 213 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12678522765709009773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6970840539254850160.kers'
[2026-05-25 22:05:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12678522765709009773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6970840539254850160.kers]
Normalized transition count is 212 out of 213 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 212 rows 188 cols 692 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-25 22:05:24] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6970840539254850160.kers
Total runtime 2 ms.
[2026-05-25 22:05:24] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-25 22:05:24] [INFO ] Flow matrix only has 213 transitions (discarded 9 similar events)
[2026-05-25 22:05:24] [INFO ] Invariant cache hit.
[2026-05-25 22:05:24] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-25 22:05:24] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-25 22:05:24] [INFO ] Flow matrix only has 213 transitions (discarded 9 similar events)
[2026-05-25 22:05:24] [INFO ] Invariant cache hit.
[2026-05-25 22:05:24] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 212/400 variables, 188/245 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 10/255 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 1/401 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/401 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 256 constraints, problems are : Problem set: 0 solved, 221 unsolved in 9211 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 188/188 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (OVERLAPS) 212/400 variables, 188/245 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 10/255 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 221/476 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 1/401 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (OVERLAPS) 0/401 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 477 constraints, problems are : Problem set: 0 solved, 221 unsolved in 20927 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 188/188 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30151ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 30152ms
Starting structural reductions in LTL mode, iteration 1 : 188/224 places, 222/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30395 ms. Remains : 188/224 places, 222/258 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(X((p1||G(p2))) U G(p3))))))'
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3) p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-10 finished in 30804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(!X(X(((G(p1)||!p2)&&F(p2)))))))'
Support contains 6 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 218 transition count 258
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 26 place count 198 transition count 231
Ensure Unique test removed 9 places
Iterating global reduction 1 with 29 rules applied. Total rules applied 55 place count 189 transition count 231
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 66 place count 189 transition count 220
Applied a total of 66 rules in 6 ms. Remains 189 /224 variables (removed 35) and now considering 220/258 (removed 38) transitions.
[2026-05-25 22:05:55] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18354321660421405443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6760275514844784922.kers'
[2026-05-25 22:05:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18354321660421405443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6760275514844784922.kers]
Normalized transition count is 210 out of 211 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 189 cols 690 entries
Finished phase 1 with 129 SingleSign rule and 2 generalized
[2026-05-25 22:05:55] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6760275514844784922.kers
Total runtime 2 ms.
[2026-05-25 22:05:55] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 22:05:55] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
[2026-05-25 22:05:55] [INFO ] Invariant cache hit.
[2026-05-25 22:05:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:05:55] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-25 22:05:55] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
[2026-05-25 22:05:55] [INFO ] Invariant cache hit.
[2026-05-25 22:05:55] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 257 constraints, problems are : Problem set: 0 solved, 219 unsolved in 11334 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 210/399 variables, 189/247 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 9/256 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 219/475 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 476 constraints, problems are : Problem set: 0 solved, 219 unsolved in 21279 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32626ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 32627ms
Starting structural reductions in LTL mode, iteration 1 : 189/224 places, 220/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32833 ms. Remains : 189/224 places, 220/258 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G(!X(X(((G(p1)||!p2)&&F(p2)))))))'
Stuttering acceptance computed with spot in 659 ms :[(AND p2 p1), (AND (NOT p0) p2 p1), (AND p2 p1), p1, p2, true, (AND p2 p1 (NOT p0)), (AND p1 p2), (AND p2 (NOT p0)), (AND p1 (NOT p0)), (AND p1 p2), (AND p1 (NOT p0) p2), (AND p1 p2), (AND p1 p2), (AND p1 (NOT p0) p2), (AND p1 p2), (NOT p0), (AND p1 p2)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-11
Entered a terminal (fully accepting) state of product in 576 steps with 0 reset in 7 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-11 finished in 33554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Support contains 6 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 221 transition count 258
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 199 transition count 228
Ensure Unique test removed 10 places
Iterating global reduction 1 with 32 rules applied. Total rules applied 57 place count 189 transition count 228
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 69 place count 189 transition count 216
Applied a total of 69 rules in 5 ms. Remains 189 /224 variables (removed 35) and now considering 216/258 (removed 42) transitions.
[2026-05-25 22:06:29] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3595367112611295443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12254260514150307240.kers'
[2026-05-25 22:06:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3595367112611295443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12254260514150307240.kers]
Normalized transition count is 207 out of 208 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 207 rows 186 cols 676 entries
Finished phase 1 with 129 SingleSign rule and 0 generalized
[2026-05-25 22:06:29] [INFO ] Computed 60 invariants in 2 ms
Computed 60 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12254260514150307240.kers
Total runtime 3 ms.
[2026-05-25 22:06:29] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 22:06:29] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2026-05-25 22:06:29] [INFO ] Invariant cache hit.
[2026-05-25 22:06:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:06:29] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2026-05-25 22:06:29] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2026-05-25 22:06:29] [INFO ] Invariant cache hit.
[2026-05-25 22:06:29] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 207/396 variables, 189/249 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 9/258 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 1/397 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 0/397 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 259 constraints, problems are : Problem set: 0 solved, 215 unsolved in 11095 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 207/396 variables, 189/249 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 9/258 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 215/473 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 1/397 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (OVERLAPS) 0/397 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 474 constraints, problems are : Problem set: 0 solved, 215 unsolved in 20749 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 189/189 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31858ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 31858ms
Starting structural reductions in LTL mode, iteration 1 : 189/224 places, 216/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32080 ms. Remains : 189/224 places, 216/258 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0)||p1)))))'
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-12 finished in 32237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((!p1 U p2)))))'
Support contains 4 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 218 transition count 258
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 26 place count 198 transition count 231
Ensure Unique test removed 10 places
Iterating global reduction 1 with 30 rules applied. Total rules applied 56 place count 188 transition count 231
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 68 place count 188 transition count 219
Applied a total of 68 rules in 7 ms. Remains 188 /224 variables (removed 36) and now considering 219/258 (removed 39) transitions.
[2026-05-25 22:07:01] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17196130466625670874.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14979614602511343724.kers'
[2026-05-25 22:07:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17196130466625670874.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14979614602511343724.kers]
Normalized transition count is 209 out of 210 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 188 cols 684 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-25 22:07:01] [INFO ] Computed 57 invariants in 0 ms
Computed 57 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14979614602511343724.kers
Total runtime 1 ms.
[2026-05-25 22:07:01] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 22:07:01] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
[2026-05-25 22:07:01] [INFO ] Invariant cache hit.
[2026-05-25 22:07:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:07:01] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-25 22:07:01] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
[2026-05-25 22:07:01] [INFO ] Invariant cache hit.
[2026-05-25 22:07:01] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 209/397 variables, 188/245 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 1/398 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/398 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 255 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9142 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 209/397 variables, 188/245 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 218/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 473 constraints, problems are : Problem set: 0 solved, 218 unsolved in 20677 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29832ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 29832ms
Starting structural reductions in LTL mode, iteration 1 : 188/224 places, 219/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30052 ms. Remains : 188/224 places, 219/258 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((!p0 U p1))||p2)))'
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-13 finished in 30140 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(F(p0))&&F(p1))))'
Support contains 3 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 218 transition count 258
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 27 place count 197 transition count 229
Ensure Unique test removed 9 places
Iterating global reduction 1 with 30 rules applied. Total rules applied 57 place count 188 transition count 229
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 68 place count 188 transition count 218
Applied a total of 68 rules in 8 ms. Remains 188 /224 variables (removed 36) and now considering 218/258 (removed 40) transitions.
[2026-05-25 22:07:31] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2746720418471214393.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17255677909864584662.kers'
[2026-05-25 22:07:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2746720418471214393.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17255677909864584662.kers]
Normalized transition count is 209 out of 210 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 188 cols 686 entries
Finished phase 1 with 128 SingleSign rule and 2 generalized
[2026-05-25 22:07:31] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17255677909864584662.kers
Total runtime 2 ms.
[2026-05-25 22:07:31] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 22:07:31] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2026-05-25 22:07:31] [INFO ] Invariant cache hit.
[2026-05-25 22:07:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:07:31] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-25 22:07:31] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
[2026-05-25 22:07:31] [INFO ] Invariant cache hit.
[2026-05-25 22:07:31] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 209/397 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 1/398 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 0/398 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 256 constraints, problems are : Problem set: 0 solved, 217 unsolved in 11355 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 209/397 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 217/472 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/398 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/398 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 473 constraints, problems are : Problem set: 0 solved, 217 unsolved in 19955 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31323ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 31324ms
Starting structural reductions in LTL mode, iteration 1 : 188/224 places, 218/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31533 ms. Remains : 188/224 places, 218/258 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-14 finished in 31743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X((G(p0) U p1)))) U (!p2 U X(p2))))))'
Support contains 6 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 258/258 transitions.
Ensure Unique test removed 3 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 219 transition count 258
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 26 place count 198 transition count 229
Ensure Unique test removed 10 places
Iterating global reduction 1 with 31 rules applied. Total rules applied 57 place count 188 transition count 229
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 69 place count 188 transition count 217
Applied a total of 69 rules in 9 ms. Remains 188 /224 variables (removed 36) and now considering 217/258 (removed 41) transitions.
[2026-05-25 22:08:03] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4417724105173183881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8683545458623213226.kers'
[2026-05-25 22:08:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4417724105173183881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8683545458623213226.kers]
Normalized transition count is 208 out of 209 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 208 rows 187 cols 680 entries
Finished phase 1 with 130 SingleSign rule and 0 generalized
[2026-05-25 22:08:03] [INFO ] Computed 58 invariants in 1 ms
Computed 58 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8683545458623213226.kers
Total runtime 2 ms.
[2026-05-25 22:08:03] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 22:08:03] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
[2026-05-25 22:08:03] [INFO ] Invariant cache hit.
[2026-05-25 22:08:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2026-05-25 22:08:03] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2026-05-25 22:08:03] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
[2026-05-25 22:08:03] [INFO ] Invariant cache hit.
[2026-05-25 22:08:03] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 1/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 208/396 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 1/397 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 0/397 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 256 constraints, problems are : Problem set: 0 solved, 216 unsolved in 10348 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 1/188 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 208/396 variables, 188/246 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 9/255 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 216/471 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 1/397 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (OVERLAPS) 0/397 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 472 constraints, problems are : Problem set: 0 solved, 216 unsolved in 22592 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32962ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 32963ms
Starting structural reductions in LTL mode, iteration 1 : 188/224 places, 217/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33188 ms. Remains : 188/224 places, 217/258 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(X((G(p0) U p1)))) U (!p2 U X(p2))))))'
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-15 finished in 33522 ms.
All properties solved by simple procedures.
Total runtime 438524 ms.

BK_STOP 1779746916694

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-3A"
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 NoC3x3-PT-3A, 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 r194-tall-177969914000292"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3A.tgz
mv NoC3x3-PT-3A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;