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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 5.7K Mar 8 06:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Mar 8 06:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 8 06:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 8 06:46 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.7K Mar 16 08:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 16 08:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 16 08:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 16 08:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 8 06:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Mar 8 06:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 8 06:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 8 06:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 16 08:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 16 08:17 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 745K 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-8A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779767352871

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-8A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-26 03:49:14] [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-26 03:49:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 03:49:14] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2026-05-26 03:49:14] [INFO ] Transformed 317 places.
[2026-05-26 03:49:14] [INFO ] Transformed 4293 transitions.
[2026-05-26 03:49:14] [INFO ] Found NUPN structural information;
[2026-05-26 03:49:14] [INFO ] Parsed PT model containing 317 places and 4293 transitions and 9691 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 3607 transitions
Reduce redundant transitions removed 3607 transitions.
FORMULA NoC3x3-PT-8A-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 686/686 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 262 transition count 567
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 262 transition count 567
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 166 place count 262 transition count 511
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 175 place count 253 transition count 511
Applied a total of 175 rules in 67 ms. Remains 253 /317 variables (removed 64) and now considering 511/686 (removed 175) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-305990269785856978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14036976278047923905.kers'
[2026-05-26 03:49:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-305990269785856978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14036976278047923905.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 511 rows 253 cols 1768 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-26 03:49:14] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14036976278047923905.kers
Total runtime 3 ms.
[2026-05-26 03:49:14] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-26 03:49:14] [INFO ] Invariant cache hit.
[2026-05-26 03:49:15] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2026-05-26 03:49:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (OVERLAPS) 511/764 variables, 253/310 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/764 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/764 variables, and 310 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (OVERLAPS) 511/764 variables, 253/310 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/764 variables, 510/820 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/764 variables, and 820 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 60231ms
Starting structural reductions in LTL mode, iteration 1 : 253/317 places, 511/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60958 ms. Remains : 253/317 places, 511/686 transitions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 511/511 transitions.
Applied a total of 0 rules in 11 ms. Remains 253 /253 variables (removed 0) and now considering 511/511 (removed 0) transitions.
[2026-05-26 03:50:15] [INFO ] Invariant cache hit.
[2026-05-26 03:50:15] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-26 03:50:15] [INFO ] Invariant cache hit.
[2026-05-26 03:50:15] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 253/253 places, 511/511 transitions.
Support contains 23 out of 253 places after structural reductions.
[2026-05-26 03:50:15] [INFO ] Flatten gal took : 67 ms
[2026-05-26 03:50:15] [INFO ] Flatten gal took : 33 ms
[2026-05-26 03:50:16] [INFO ] Input system was already deterministic with 511 transitions.
RANDOM walk for 40000 steps (8 resets) in 1405 ms. (28 steps per ms) remains 1/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
[2026-05-26 03:50:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 233/253 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 511/764 variables, 253/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/764 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 764/764 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 233/253 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 511/764 variables, 253/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/764 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/764 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/764 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 764/764 variables, and 311 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 435ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 511/511 transitions.
Graph (trivial) has 159 edges and 253 vertex of which 73 / 253 are part of one of the 32 SCC in 4 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 162 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 0 with 42 rules applied. Total rules applied 43 place count 191 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 109 transitions
Redundant transition composition rules discarded 109 transitions
Iterating global reduction 0 with 109 rules applied. Total rules applied 152 place count 191 transition count 219
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 175 place count 191 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 176 place count 190 transition count 218
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 33 rules applied. Total rules applied 209 place count 181 transition count 194
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 233 place count 157 transition count 194
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 157 transition count 194
Applied a total of 234 rules in 59 ms. Remains 157 /253 variables (removed 96) and now considering 194/511 (removed 317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 157/253 places, 194/511 transitions.
RANDOM walk for 5438 steps (0 resets) in 78 ms. (68 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-8A-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((F(p0)&&F(p1)))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 511/511 transitions.
Graph (trivial) has 163 edges and 253 vertex of which 75 / 253 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 201 transition count 346
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 177 transition count 346
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 176 transition count 345
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 176 transition count 345
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 112 place count 154 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 248 place count 154 transition count 187
Applied a total of 248 rules in 32 ms. Remains 154 /253 variables (removed 99) and now considering 187/511 (removed 324) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3804813470698090536.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7989539309455336850.kers'
[2026-05-26 03:50:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3804813470698090536.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7989539309455336850.kers]
Normalized transition count is 186 out of 187 initially.
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 0 ms.
// Phase 1: matrix 186 rows 132 cols 376 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-26 03:50:17] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7989539309455336850.kers
Total runtime 1 ms.
[2026-05-26 03:50:17] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-26 03:50:17] [INFO ] Invariant cache hit.
[2026-05-26 03:50:17] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-26 03:50:17] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2026-05-26 03:50:17] [INFO ] Redundant transitions in 8 ms returned []
Running 162 sub problems to find dead transitions.
[2026-05-26 03:50:17] [INFO ] Invariant cache hit.
[2026-05-26 03:50:17] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 186/340 variables, 154/202 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 112/314 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 0/340 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/341 variables, and 314 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5889 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 154/154 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 186/340 variables, 154/202 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 112/314 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 162/476 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/340 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/341 variables, and 476 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5266 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 154/154 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11168ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 11168ms
Starting structural reductions in SI_LTL mode, iteration 1 : 154/253 places, 187/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11457 ms. Remains : 154/253 places, 187/511 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)&&F(p1)))'
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-00 finished in 11771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 511/511 transitions.
Graph (trivial) has 159 edges and 253 vertex of which 73 / 253 are part of one of the 32 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 202 transition count 348
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 178 transition count 348
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 177 transition count 347
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 177 transition count 347
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 110 place count 156 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 132 transitions
Redundant transition composition rules discarded 132 transitions
Iterating global reduction 2 with 132 rules applied. Total rules applied 242 place count 156 transition count 194
Applied a total of 242 rules in 28 ms. Remains 156 /253 variables (removed 97) and now considering 194/511 (removed 317) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1524919255531669749.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5220242358661623694.kers'
[2026-05-26 03:50:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1524919255531669749.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5220242358661623694.kers]
Normalized transition count is 193 out of 194 initially.
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 0 ms.
// Phase 1: matrix 193 rows 135 cols 408 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-26 03:50:29] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5220242358661623694.kers
Total runtime 1 ms.
[2026-05-26 03:50:29] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-26 03:50:29] [INFO ] Invariant cache hit.
[2026-05-26 03:50:29] [INFO ] State equation strengthened by 108 read => feed constraints.
[2026-05-26 03:50:29] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2026-05-26 03:50:29] [INFO ] Redundant transitions in 39 ms returned []
Running 169 sub problems to find dead transitions.
[2026-05-26 03:50:29] [INFO ] Invariant cache hit.
[2026-05-26 03:50:29] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 193/349 variables, 156/204 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 108/312 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 0/349 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/350 variables, and 312 constraints, problems are : Problem set: 0 solved, 169 unsolved in 6009 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 156/156 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 193/349 variables, 156/204 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 108/312 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 169/481 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (OVERLAPS) 0/349 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/350 variables, and 481 constraints, problems are : Problem set: 0 solved, 169 unsolved in 5802 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 156/156 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11823ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 11824ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/253 places, 194/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12128 ms. Remains : 156/253 places, 194/511 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-02 finished in 12241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 511/511 transitions.
Graph (trivial) has 164 edges and 253 vertex of which 75 / 253 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 201 transition count 346
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 177 transition count 346
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 176 transition count 345
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 176 transition count 345
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 114 place count 153 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 250 place count 153 transition count 186
Applied a total of 250 rules in 25 ms. Remains 153 /253 variables (removed 100) and now considering 186/511 (removed 325) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17179838798365333405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15183595308776606967.kers'
[2026-05-26 03:50:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17179838798365333405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15183595308776606967.kers]
Normalized transition count is 185 out of 186 initially.
Culling duplicate invariants (modulo rational): removing 23 columns.
Culled 23 columns in 0 ms.
// Phase 1: matrix 185 rows 130 cols 372 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-26 03:50:41] [INFO ] Computed 48 invariants in 0 ms
Computed 48 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15183595308776606967.kers
Total runtime 1 ms.
[2026-05-26 03:50:41] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-26 03:50:41] [INFO ] Invariant cache hit.
[2026-05-26 03:50:41] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-26 03:50:41] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2026-05-26 03:50:41] [INFO ] Redundant transitions in 3 ms returned []
Running 161 sub problems to find dead transitions.
[2026-05-26 03:50:41] [INFO ] Invariant cache hit.
[2026-05-26 03:50:41] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 185/338 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 112/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 0/338 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/339 variables, and 313 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5699 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 185/338 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 112/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 161/474 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/338 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/339 variables, and 474 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5414 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11124ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 11125ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/253 places, 186/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11384 ms. Remains : 153/253 places, 186/511 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 36 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-03 finished in 11453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0||F(p1)))) U (!p1&&X(F(p2))))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 511/511 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 252 transition count 510
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 252 transition count 510
Applied a total of 2 rules in 9 ms. Remains 252 /253 variables (removed 1) and now considering 510/511 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16479757349887075761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9384919796963420951.kers'
[2026-05-26 03:50:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16479757349887075761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9384919796963420951.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 510 rows 252 cols 1764 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-26 03:50:52] [INFO ] Computed 57 invariants in 2 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9384919796963420951.kers
Total runtime 3 ms.
[2026-05-26 03:50:53] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-26 03:50:53] [INFO ] Invariant cache hit.
[2026-05-26 03:50:53] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2026-05-26 03:50:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 252/253 places, 510/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60420 ms. Remains : 252/253 places, 510/511 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((p0||F(p1)))) U (!p1&&X(F(p2))))))'
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-05
Product exploration explored 100000 steps with 8 reset in 447 ms.
Stack based approach found an accepted trace after 2123 steps with 1 reset with depth 1862 and stack size 1840 in 13 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-05 finished in 61144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F((X(p0) U !X(p1))) U p0)) U X(!p0))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 511/511 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 252 transition count 510
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 252 transition count 510
Applied a total of 2 rules in 7 ms. Remains 252 /253 variables (removed 1) and now considering 510/511 (removed 1) transitions.
[2026-05-26 03:51:54] [INFO ] Invariant cache hit.
[2026-05-26 03:51:54] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-26 03:51:54] [INFO ] Invariant cache hit.
[2026-05-26 03:51:54] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 252/253 places, 510/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 252/253 places, 510/511 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F((X(p0) U !X(p1))) U p0)) U X(!p0))))'
Stuttering acceptance computed with spot in 264 ms :[p0, p0, p0, (AND p1 p0), p1, (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-06
Product exploration explored 100000 steps with 33333 reset in 491 ms.
Product exploration explored 100000 steps with 33333 reset in 498 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 18 ms. Proved property starting from automaton with 7 states, 11 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-8A-LTLFireability-06 finished in 1604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1||X(X(G(p2)))))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 511/511 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 252 transition count 510
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 252 transition count 510
Applied a total of 2 rules in 8 ms. Remains 252 /253 variables (removed 1) and now considering 510/511 (removed 1) transitions.
[2026-05-26 03:51:55] [INFO ] Invariant cache hit.
[2026-05-26 03:51:55] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-26 03:51:55] [INFO ] Invariant cache hit.
[2026-05-26 03:51:55] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 252/253 places, 510/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 252/253 places, 510/511 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1||X(X(G(p2)))))))'
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 591 ms.
Product exploration explored 100000 steps with 50000 reset in 609 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 15 factoid took 22 ms. Proved property starting from automaton with 9 states, 19 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 28 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-8A-LTLFireability-07 finished in 1865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X((F(p1) U X(X(p2))))))))'
Support contains 5 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 511/511 transitions.
Applied a total of 0 rules in 4 ms. Remains 253 /253 variables (removed 0) and now considering 511/511 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10116527029757148016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13423445790366753895.kers'
[2026-05-26 03:51:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10116527029757148016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13423445790366753895.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 511 rows 253 cols 1768 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-26 03:51:57] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13423445790366753895.kers
Total runtime 2 ms.
[2026-05-26 03:51:57] [INFO ] Implicit Places using invariants in 100 ms returned []
[2026-05-26 03:51:57] [INFO ] Invariant cache hit.
[2026-05-26 03:51:57] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2026-05-26 03:51:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (OVERLAPS) 511/764 variables, 253/310 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/764 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/764 variables, and 310 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 510 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (OVERLAPS) 511/764 variables, 253/310 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/764 variables, 510/820 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/764 variables, and 820 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Finished structural reductions in LTL mode , in 1 iterations and 60397 ms. Remains : 253/253 places, 511/511 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X((F(p1) U X(X(p2))))))))'
Stuttering acceptance computed with spot in 935 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-08
Product exploration explored 100000 steps with 12 reset in 348 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-08 finished in 61727 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((p1||G(p2)))) U p3))'
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 511/511 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 252 transition count 510
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 252 transition count 510
Applied a total of 2 rules in 5 ms. Remains 252 /253 variables (removed 1) and now considering 510/511 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2756070481503755161.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17567984407022182193.kers'
[2026-05-26 03:53:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2756070481503755161.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17567984407022182193.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 510 rows 252 cols 1764 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-26 03:53:00] [INFO ] Computed 57 invariants in 1 ms
Computed 57 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17567984407022182193.kers
Total runtime 3 ms.
[2026-05-26 03:53:00] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-26 03:53:00] [INFO ] Invariant cache hit.
[2026-05-26 03:53:00] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2026-05-26 03:53:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 252/253 places, 510/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60409 ms. Remains : 252/253 places, 510/511 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((p1||G(p2)))) U p3))'
Stuttering acceptance computed with spot in 132 ms :[(NOT p3), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-10
Entered a terminal (fully accepting) state of product in 5685 steps with 55 reset in 29 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-10 finished in 61845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!((p0 U p1) U X(p0)) U (F(p1)&&p2))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 511/511 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 252 transition count 510
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 252 transition count 510
Applied a total of 2 rules in 11 ms. Remains 252 /253 variables (removed 1) and now considering 510/511 (removed 1) transitions.
[2026-05-26 03:54:01] [INFO ] Invariant cache hit.
[2026-05-26 03:54:01] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-26 03:54:01] [INFO ] Invariant cache hit.
[2026-05-26 03:54:01] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 252/253 places, 510/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 252/253 places, 510/511 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!((p0 U p1) U X(p0)) U (F(p1)&&p2))))'
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), p0, p0, (AND p0 p1), (NOT p1), true, (AND p1 p0), (AND p1 (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-12
Product exploration explored 100000 steps with 25008 reset in 436 ms.
Stack based approach found an accepted trace after 47 steps with 12 reset with depth 3 and stack size 3 in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-12 finished in 1113 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(p0))))'
Support contains 3 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 511/511 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 252 transition count 510
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 252 transition count 510
Applied a total of 2 rules in 5 ms. Remains 252 /253 variables (removed 1) and now considering 510/511 (removed 1) transitions.
[2026-05-26 03:54:02] [INFO ] Invariant cache hit.
[2026-05-26 03:54:02] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-26 03:54:02] [INFO ] Invariant cache hit.
[2026-05-26 03:54:02] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 252/253 places, 510/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 252/253 places, 510/511 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(p0))))'
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-13 finished in 556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((X(p0)||G(p1))))||G((p2||G(p0))))))'
Support contains 2 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 511/511 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 252 transition count 510
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 252 transition count 510
Applied a total of 2 rules in 7 ms. Remains 252 /253 variables (removed 1) and now considering 510/511 (removed 1) transitions.
[2026-05-26 03:54:02] [INFO ] Invariant cache hit.
[2026-05-26 03:54:02] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-26 03:54:02] [INFO ] Invariant cache hit.
[2026-05-26 03:54:03] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 252/253 places, 510/511 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 252/253 places, 510/511 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((X(p0)||G(p1))))||G((p2||G(p0))))))'
Stuttering acceptance computed with spot in 588 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-14
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-14 finished in 913 ms.
All properties solved by simple procedures.
Total runtime 289652 ms.

BK_STOP 1779767643924

--------------------
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-8A"
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-8A, 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-177969914100372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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