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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.2K Mar 8 06:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 8 06:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 8 06:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 8 06:43 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.6K Mar 16 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 16 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 16 08:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 8 06:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 8 06:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 8 06:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 8 06:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 16 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:12 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 81K 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-1A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-1A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779741526073

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-1A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 20:38:47] [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 20:38:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 20:38:48] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2026-05-25 20:38:48] [INFO ] Transformed 165 places.
[2026-05-25 20:38:48] [INFO ] Transformed 355 transitions.
[2026-05-25 20:38:48] [INFO ] Found NUPN structural information;
[2026-05-25 20:38:48] [INFO ] Parsed PT model containing 165 places and 355 transitions and 1069 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 108 transitions
Reduce redundant transitions removed 108 transitions.
FORMULA NoC3x3-PT-1A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1A-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 247/247 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 143 transition count 215
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 143 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 68 place count 143 transition count 191
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 74 place count 137 transition count 191
Applied a total of 74 rules in 63 ms. Remains 137 /165 variables (removed 28) and now considering 191/247 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11225501641860507827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-496657814582571863.kers'
[2026-05-25 20:38:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11225501641860507827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-496657814582571863.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 191 rows 137 cols 623 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-25 20:38:48] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-496657814582571863.kers
Total runtime 1 ms.
[2026-05-25 20:38:48] [INFO ] Implicit Places using invariants in 357 ms returned []
[2026-05-25 20:38:48] [INFO ] Invariant cache hit.
[2026-05-25 20:38:49] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2026-05-25 20:38:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 191/328 variables, 137/171 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/328 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 171 constraints, problems are : Problem set: 0 solved, 190 unsolved in 7366 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 191/328 variables, 137/171 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 190/361 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 361 constraints, problems are : Problem set: 0 solved, 190 unsolved in 9128 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16569ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 16589ms
Starting structural reductions in LTL mode, iteration 1 : 137/165 places, 191/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17388 ms. Remains : 137/165 places, 191/247 transitions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 191/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2026-05-25 20:39:05] [INFO ] Invariant cache hit.
[2026-05-25 20:39:05] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 20:39:05] [INFO ] Invariant cache hit.
[2026-05-25 20:39:05] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 137/137 places, 191/191 transitions.
Support contains 37 out of 137 places after structural reductions.
[2026-05-25 20:39:06] [INFO ] Flatten gal took : 44 ms
[2026-05-25 20:39:06] [INFO ] Flatten gal took : 19 ms
[2026-05-25 20:39:06] [INFO ] Input system was already deterministic with 191 transitions.
RANDOM walk for 27758 steps (6 resets) in 940 ms. (29 steps per ms) remains 0/29 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 191/191 transitions.
Graph (trivial) has 83 edges and 137 vertex of which 44 / 137 are part of one of the 19 SCC in 2 ms
Free SCC test removed 25 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 105 transition count 121
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 40 place count 91 transition count 121
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 46 place count 85 transition count 115
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 85 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 66 place count 85 transition count 101
Applied a total of 66 rules in 35 ms. Remains 85 /137 variables (removed 52) and now considering 101/191 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15283589646660082420.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3478177024383497488.kers'
[2026-05-25 20:39:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15283589646660082420.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3478177024383497488.kers]
Normalized transition count is 100 out of 101 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 100 rows 72 cols 233 entries
Finished phase 1 with 57 SingleSign rule and 0 generalized
[2026-05-25 20:39:07] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3478177024383497488.kers
Total runtime 1 ms.
[2026-05-25 20:39:07] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-25 20:39:07] [INFO ] Invariant cache hit.
[2026-05-25 20:39:07] [INFO ] State equation strengthened by 27 read => feed constraints.
[2026-05-25 20:39:07] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2026-05-25 20:39:07] [INFO ] Redundant transitions in 42 ms returned []
Running 86 sub problems to find dead transitions.
[2026-05-25 20:39:07] [INFO ] Invariant cache hit.
[2026-05-25 20:39:07] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 100/185 variables, 85/113 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 27/140 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 0/185 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/186 variables, and 140 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1919 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 85/85 constraints, ReadFeed: 27/27 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/85 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 100/185 variables, 85/113 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 27/140 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 86/226 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/186 variables, and 226 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1829 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 85/85 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3765ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3766ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/137 places, 101/191 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4167 ms. Remains : 85/137 places, 101/191 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 193 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-00 finished in 4445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 191/191 transitions.
Graph (trivial) has 83 edges and 137 vertex of which 44 / 137 are part of one of the 19 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 105 transition count 121
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 40 place count 91 transition count 121
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 46 place count 85 transition count 115
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 85 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 66 place count 85 transition count 101
Applied a total of 66 rules in 17 ms. Remains 85 /137 variables (removed 52) and now considering 101/191 (removed 90) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-470579166117434540.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6128050929540858608.kers'
[2026-05-25 20:39:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-470579166117434540.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6128050929540858608.kers]
Normalized transition count is 100 out of 101 initially.
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 100 rows 72 cols 236 entries
Finished phase 1 with 57 SingleSign rule and 0 generalized
[2026-05-25 20:39:11] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6128050929540858608.kers
Total runtime 0 ms.
[2026-05-25 20:39:11] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 20:39:11] [INFO ] Invariant cache hit.
[2026-05-25 20:39:11] [INFO ] State equation strengthened by 26 read => feed constraints.
[2026-05-25 20:39:11] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2026-05-25 20:39:11] [INFO ] Redundant transitions in 37 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/137 places, 101/191 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 85/137 places, 101/191 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-01 finished in 266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((((X(X(p0))&&F(p1)) U p2)&&F(p3)) U p2))'
Support contains 5 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 191/191 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 132 transition count 186
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 132 transition count 186
Applied a total of 10 rules in 11 ms. Remains 132 /137 variables (removed 5) and now considering 186/191 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1031238641657231980.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4197108199171068691.kers'
[2026-05-25 20:39:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1031238641657231980.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4197108199171068691.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 132 cols 603 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-25 20:39:11] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4197108199171068691.kers
Total runtime 1 ms.
[2026-05-25 20:39:11] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 20:39:11] [INFO ] Invariant cache hit.
[2026-05-25 20:39:11] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-25 20:39:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 166 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6129 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 185/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 351 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8323 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14472ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 14473ms
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 186/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14682 ms. Remains : 132/137 places, 186/191 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((((X(X(p0))&&F(p1)) U p2)&&F(p3)) U p2))'
Stuttering acceptance computed with spot in 969 ms :[(OR (AND (NOT p2) (NOT p1) (NOT p3) p0) (AND (NOT p2) (NOT p1) p3 p0) (AND (NOT p2) p1 (NOT p3) p0) (AND (NOT p2) p1 p3 p0) (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p1) p3 (NOT p0)) (AND (NOT p2) p1 (NOT p3) (NOT p0)) (AND (NOT p2) p1 p3 (NOT p0))), (NOT p0), (NOT p1), (NOT p3), (NOT p0), true]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 87 steps with 3 reset in 3 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-02 finished in 15700 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) U X(p1)))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 191/191 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 132 transition count 186
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 132 transition count 186
Applied a total of 10 rules in 16 ms. Remains 132 /137 variables (removed 5) and now considering 186/191 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2934293232000813056.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16230785661698349512.kers'
[2026-05-25 20:39:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2934293232000813056.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16230785661698349512.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 132 cols 603 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-25 20:39:27] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16230785661698349512.kers
Total runtime 1 ms.
[2026-05-25 20:39:27] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 20:39:27] [INFO ] Invariant cache hit.
[2026-05-25 20:39:27] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 186/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 132/137 places, 186/191 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(p1)))'
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-04
Product exploration explored 100000 steps with 249 reset in 404 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 1 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-04 finished in 778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(F(!p1)))))))'
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 191/191 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 131 transition count 185
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 131 transition count 185
Applied a total of 12 rules in 6 ms. Remains 131 /137 variables (removed 6) and now considering 185/191 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8177444137755208001.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9159029836541689958.kers'
[2026-05-25 20:39:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8177444137755208001.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9159029836541689958.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 131 cols 599 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-25 20:39:28] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9159029836541689958.kers
Total runtime 2 ms.
[2026-05-25 20:39:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 20:39:28] [INFO ] Invariant cache hit.
[2026-05-25 20:39:28] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2026-05-25 20:39:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 165 constraints, problems are : Problem set: 0 solved, 184 unsolved in 6116 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 349 constraints, problems are : Problem set: 0 solved, 184 unsolved in 8533 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14669ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 14670ms
Starting structural reductions in LTL mode, iteration 1 : 131/137 places, 185/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14845 ms. Remains : 131/137 places, 185/191 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(F(p0))))||p1)))'
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-05
Product exploration explored 100000 steps with 17571 reset in 236 ms.
Stack based approach found an accepted trace after 23 steps with 3 reset with depth 11 and stack size 11 in 0 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-05 finished in 15277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)||G(p1)))||G(p2)))'
Support contains 6 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 191/191 transitions.
Graph (trivial) has 74 edges and 137 vertex of which 38 / 137 are part of one of the 16 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 109 transition count 141
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 109 transition count 141
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 109 transition count 137
Applied a total of 17 rules in 14 ms. Remains 109 /137 variables (removed 28) and now considering 137/191 (removed 54) transitions.
[2026-05-25 20:39:43] [INFO ] Flow matrix only has 122 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-8869410740153089905.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1682280489310432839.kers'
[2026-05-25 20:39:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8869410740153089905.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1682280489310432839.kers]
Normalized transition count is 121 out of 122 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 121 rows 103 cols 369 entries
Finished phase 1 with 75 SingleSign rule and 0 generalized
[2026-05-25 20:39:43] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1682280489310432839.kers
Total runtime 0 ms.
[2026-05-25 20:39:43] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 20:39:43] [INFO ] Flow matrix only has 122 transitions (discarded 15 similar events)
[2026-05-25 20:39:43] [INFO ] Invariant cache hit.
[2026-05-25 20:39:43] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-25 20:39:43] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2026-05-25 20:39:43] [INFO ] Redundant transitions in 4 ms returned []
Running 136 sub problems to find dead transitions.
[2026-05-25 20:39:43] [INFO ] Flow matrix only has 122 transitions (discarded 15 similar events)
[2026-05-25 20:39:43] [INFO ] Invariant cache hit.
[2026-05-25 20:39:43] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 121/230 variables, 109/143 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 48/191 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 1/231 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/231 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 192 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5261 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 109/109 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (OVERLAPS) 121/230 variables, 109/143 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 48/191 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 136/327 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 1/231 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 0/231 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 328 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6155 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 109/109 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11430ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 11430ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/137 places, 137/191 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11665 ms. Remains : 109/137 places, 137/191 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)||G(p1)))||G(p2)))'
Stuttering acceptance computed with spot in 664 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-06 finished in 12373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(X((X(F(p1))||G(!p2))))) U p3))'
Support contains 6 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 191/191 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 132 transition count 186
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 132 transition count 186
Applied a total of 10 rules in 9 ms. Remains 132 /137 variables (removed 5) and now considering 186/191 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17936200216268210627.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8791432542826353599.kers'
[2026-05-25 20:39:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17936200216268210627.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8791432542826353599.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 132 cols 603 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-25 20:39:55] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8791432542826353599.kers
Total runtime 1 ms.
[2026-05-25 20:39:55] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 20:39:55] [INFO ] Invariant cache hit.
[2026-05-25 20:39:56] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-25 20:39:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 166 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6134 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 185/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 351 constraints, problems are : Problem set: 0 solved, 185 unsolved in 9331 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15480ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 15481ms
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 186/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15838 ms. Remains : 132/137 places, 186/191 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X(X((X(F(p1))||G(!p2))))) U p3))'
Stuttering acceptance computed with spot in 163 ms :[(NOT p3), (AND (NOT p1) p2), (AND (NOT p1) p2), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-07
Product exploration explored 100000 steps with 13083 reset in 256 ms.
Stack based approach found an accepted trace after 847 steps with 105 reset with depth 3 and stack size 3 in 2 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-07 finished in 16302 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 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 191/191 transitions.
Graph (trivial) has 84 edges and 137 vertex of which 46 / 137 are part of one of the 20 SCC in 0 ms
Free SCC test removed 26 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 106 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 106 transition count 134
Applied a total of 11 rules in 24 ms. Remains 106 /137 variables (removed 31) and now considering 134/191 (removed 57) transitions.
[2026-05-25 20:40:12] [INFO ] Flow matrix only has 115 transitions (discarded 19 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2395727123199072447.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10036278991754271297.kers'
[2026-05-25 20:40:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2395727123199072447.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10036278991754271297.kers]
Normalized transition count is 114 out of 115 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 114 rows 100 cols 341 entries
Finished phase 1 with 72 SingleSign rule and 0 generalized
[2026-05-25 20:40:12] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-10036278991754271297.kers
Total runtime 8 ms.
[2026-05-25 20:40:12] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-25 20:40:12] [INFO ] Flow matrix only has 115 transitions (discarded 19 similar events)
[2026-05-25 20:40:12] [INFO ] Invariant cache hit.
[2026-05-25 20:40:12] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-25 20:40:12] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2026-05-25 20:40:12] [INFO ] Redundant transitions in 3 ms returned []
Running 133 sub problems to find dead transitions.
[2026-05-25 20:40:12] [INFO ] Flow matrix only has 115 transitions (discarded 19 similar events)
[2026-05-25 20:40:12] [INFO ] Invariant cache hit.
[2026-05-25 20:40:12] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 114/220 variables, 106/140 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 56/196 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 1/221 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/221 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 197 constraints, problems are : Problem set: 0 solved, 133 unsolved in 4275 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 106/106 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 114/220 variables, 106/140 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 56/196 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 133/329 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 1/221 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/221 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 330 constraints, problems are : Problem set: 0 solved, 133 unsolved in 6150 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 106/106 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10440ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 10441ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/137 places, 134/191 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10729 ms. Remains : 106/137 places, 134/191 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 34 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-08
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-08 finished in 10800 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(p0)))) U ((p1&&X(p2)) U X(G(p1)))))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 191/191 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 132 transition count 186
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 132 transition count 186
Applied a total of 10 rules in 5 ms. Remains 132 /137 variables (removed 5) and now considering 186/191 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-312498119825209333.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9984627683021617499.kers'
[2026-05-25 20:40:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-312498119825209333.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9984627683021617499.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 132 cols 603 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-25 20:40:22] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9984627683021617499.kers
Total runtime 0 ms.
[2026-05-25 20:40:23] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 20:40:23] [INFO ] Invariant cache hit.
[2026-05-25 20:40:23] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-25 20:40:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 166 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6274 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 185/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 351 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8488 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14774ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 14774ms
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 186/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14954 ms. Remains : 132/137 places, 186/191 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(p0)))) U ((p1&&X(p2)) U X(G(p1)))))'
Stuttering acceptance computed with spot in 640 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-09
Entered a terminal (fully accepting) state of product in 25635 steps with 4234 reset in 68 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-09 finished in 15724 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 G(!p1))||X(F(p2)))))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 191/191 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 131 transition count 185
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 131 transition count 185
Applied a total of 12 rules in 3 ms. Remains 131 /137 variables (removed 6) and now considering 185/191 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-736651537206658143.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17287260562309842922.kers'
[2026-05-25 20:40:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-736651537206658143.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17287260562309842922.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 131 cols 599 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-25 20:40:38] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17287260562309842922.kers
Total runtime 1 ms.
[2026-05-25 20:40:38] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 20:40:38] [INFO ] Invariant cache hit.
[2026-05-25 20:40:38] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2026-05-25 20:40:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 165 constraints, problems are : Problem set: 0 solved, 184 unsolved in 6113 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 349 constraints, problems are : Problem set: 0 solved, 184 unsolved in 8703 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14825ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 14826ms
Starting structural reductions in LTL mode, iteration 1 : 131/137 places, 185/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14991 ms. Remains : 131/137 places, 185/191 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 G(!p1))||X(F(p2)))))'
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p2) p1), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (NOT p2), (AND p1 (NOT p2))]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-10
Product exploration explored 100000 steps with 29441 reset in 194 ms.
Product exploration explored 100000 steps with 29442 reset in 244 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 7 factoid took 979 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 13109 steps (2 resets) in 93 ms. (139 steps per ms) remains 0/4 properties
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Knowledge-based reduction took 1372 ms.
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2026-05-25 20:40:56] [INFO ] Invariant cache hit.
[2026-05-25 20:40:56] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-25 20:40:56] [INFO ] Invariant cache hit.
[2026-05-25 20:40:56] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 131/131 places, 185/185 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 11500 steps (2 resets) in 66 ms. (171 steps per ms) remains 0/4 properties
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Knowledge-based reduction took 462 ms.
Stuttering acceptance computed with spot in 182 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 29487 reset in 184 ms.
Product exploration explored 100000 steps with 29345 reset in 213 ms.
Spot run failed in 79 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin17178487310007777798
[2026-05-25 20:40:58] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17178487310007777798
Running compilation step : cd /tmp/ltsmin17178487310007777798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 413 ms.
Running link step : cd /tmp/ltsmin17178487310007777798;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin17178487310007777798;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased9288206645124498935.hoa' '--buchi-type=spotba'
LTSmin run took 289 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-1A-LTLFireability-10 finished in 20090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 191/191 transitions.
Graph (trivial) has 80 edges and 137 vertex of which 42 / 137 are part of one of the 18 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 106 transition count 123
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 40 place count 92 transition count 123
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 46 place count 86 transition count 117
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 86 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 66 place count 86 transition count 103
Applied a total of 66 rules in 15 ms. Remains 86 /137 variables (removed 51) and now considering 103/191 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5808665133526627704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4672677443777078326.kers'
[2026-05-25 20:40:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5808665133526627704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4672677443777078326.kers]
Normalized transition count is 102 out of 103 initially.
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 102 rows 74 cols 245 entries
Finished phase 1 with 58 SingleSign rule and 0 generalized
[2026-05-25 20:40:58] [INFO ] Computed 28 invariants in 0 ms
Computed 28 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4672677443777078326.kers
Total runtime 1 ms.
[2026-05-25 20:40:58] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 20:40:58] [INFO ] Invariant cache hit.
[2026-05-25 20:40:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2026-05-25 20:40:58] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2026-05-25 20:40:59] [INFO ] Redundant transitions in 50 ms returned []
Running 88 sub problems to find dead transitions.
[2026-05-25 20:40:59] [INFO ] Invariant cache hit.
[2026-05-25 20:40:59] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 102/188 variables, 86/114 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 25/139 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 0/188 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/189 variables, and 139 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1868 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 86/86 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 102/188 variables, 86/114 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 25/139 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 88/227 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 0/188 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/189 variables, and 227 constraints, problems are : Problem set: 0 solved, 88 unsolved in 1905 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 86/86 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3780ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 3780ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/137 places, 103/191 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4000 ms. Remains : 86/137 places, 103/191 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-11 finished in 4149 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((X(X(!p0))&&G((p1 U (p2 U !p3)))))))'
Support contains 6 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 191/191 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 132 transition count 186
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 132 transition count 186
Applied a total of 10 rules in 3 ms. Remains 132 /137 variables (removed 5) and now considering 186/191 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5820059044614785684.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3238209778806836965.kers'
[2026-05-25 20:41:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5820059044614785684.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3238209778806836965.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 186 rows 132 cols 603 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-25 20:41:02] [INFO ] Computed 34 invariants in 1 ms
Computed 34 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3238209778806836965.kers
Total runtime 1 ms.
[2026-05-25 20:41:03] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 20:41:03] [INFO ] Invariant cache hit.
[2026-05-25 20:41:03] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2026-05-25 20:41:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 166 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6326 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 185/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 351 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8153 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14492ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 14492ms
Starting structural reductions in LTL mode, iteration 1 : 132/137 places, 186/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14665 ms. Remains : 132/137 places, 186/191 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((X(X(p0))&&G((p1 U (p2 U !p3)))))))'
Stuttering acceptance computed with spot in 738 ms :[(OR (NOT p0) p3), (OR (NOT p0) p3), (NOT p0), p3, p3, p3, (NOT p0), (AND (NOT p0) p3), (NOT p0), (AND (NOT p0) p3), (AND (NOT p0) p3), (AND (NOT p0) p3), (AND p1 (NOT p2) p3), (AND (NOT p0) p3), (AND p3 (NOT p2) p1 (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 223 ms.
Stack based approach found an accepted trace after 16798 steps with 1 reset with depth 12377 and stack size 11518 in 45 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-12 finished in 15726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))&&((!p1&&X(p1))||X(G(p1)))))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 191/191 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 131 transition count 185
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 131 transition count 185
Applied a total of 12 rules in 3 ms. Remains 131 /137 variables (removed 6) and now considering 185/191 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3391775953839959009.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7432319985758312917.kers'
[2026-05-25 20:41:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3391775953839959009.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7432319985758312917.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 131 cols 599 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-25 20:41:18] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7432319985758312917.kers
Total runtime 3 ms.
[2026-05-25 20:41:18] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 20:41:18] [INFO ] Invariant cache hit.
[2026-05-25 20:41:18] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2026-05-25 20:41:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 165 constraints, problems are : Problem set: 0 solved, 184 unsolved in 6111 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 349 constraints, problems are : Problem set: 0 solved, 184 unsolved in 8635 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14756ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 14757ms
Starting structural reductions in LTL mode, iteration 1 : 131/137 places, 185/191 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14927 ms. Remains : 131/137 places, 185/191 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))&&(X(G(p1))||(!p1&&X(p1)))))'
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : NoC3x3-PT-1A-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1A-LTLFireability-14 finished in 15252 ms.
All properties solved by simple procedures.
Total runtime 166113 ms.

BK_STOP 1779741693941

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

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

Sequence of Actions to be Executed by the VM

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

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

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