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.r146-tall-177961074000107.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 FunctionPointer-PT-b128, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074000107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 6.8K Mar 7 07:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 7 07:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 7 07:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 7 07:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 07:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 7 07:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 7 07:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 7 07:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b128-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b128-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779682443626

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 04:14:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 04:14:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 04:14:04] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2026-05-25 04:14:04] [INFO ] Transformed 306 places.
[2026-05-25 04:14:04] [INFO ] Transformed 840 transitions.
[2026-05-25 04:14:04] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b128-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b128-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 213 transition count 648
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 34 place count 188 transition count 506
Iterating global reduction 1 with 25 rules applied. Total rules applied 59 place count 188 transition count 506
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 95 place count 188 transition count 470
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 109 place count 174 transition count 442
Iterating global reduction 2 with 14 rules applied. Total rules applied 123 place count 174 transition count 442
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 131 place count 174 transition count 434
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 135 place count 170 transition count 426
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 170 transition count 426
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 141 place count 168 transition count 418
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 168 transition count 418
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 166 transition count 414
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 166 transition count 414
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 165 transition count 410
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 165 transition count 410
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 150 place count 164 transition count 406
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 164 transition count 406
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 163 transition count 404
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 163 transition count 404
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 154 place count 162 transition count 402
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 162 transition count 402
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 156 place count 161 transition count 400
Iterating global reduction 3 with 1 rules applied. Total rules applied 157 place count 161 transition count 400
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 160 transition count 398
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 160 transition count 398
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 159 transition count 396
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 159 transition count 396
Applied a total of 161 rules in 102 ms. Remains 159 /222 variables (removed 63) and now considering 396/648 (removed 252) transitions.
[2026-05-25 04:14:05] [INFO ] Flow matrix only has 272 transitions (discarded 124 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18144472175467030340.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4728243941076079962.kers'
[2026-05-25 04:14:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18144472175467030340.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4728243941076079962.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 272 rows 159 cols 768 entries
Finished phase 1 with 156 SingleSign rule and 0 generalized
[2026-05-25 04:14:05] [INFO ] Computed 3 invariants in 1 ms
Computed 3 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4728243941076079962.kers
Total runtime 2 ms.
[2026-05-25 04:14:05] [INFO ] Implicit Places using invariants in 306 ms returned []
[2026-05-25 04:14:05] [INFO ] Flow matrix only has 272 transitions (discarded 124 similar events)
[2026-05-25 04:14:05] [INFO ] Invariant cache hit.
[2026-05-25 04:14:05] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-25 04:14:06] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2026-05-25 04:14:06] [INFO ] Flow matrix only has 272 transitions (discarded 124 similar events)
[2026-05-25 04:14:06] [INFO ] Invariant cache hit.
[2026-05-25 04:14:06] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 272/431 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 56/218 constraints. Problems are: Problem set: 0 solved, 394 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 7 (OVERLAPS) 0/431 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 394 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 218 constraints, problems are : Problem set: 0 solved, 394 unsolved in 11975 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 159/159 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 1/159 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (OVERLAPS) 272/431 variables, 159/162 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/431 variables, 56/218 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 394/612 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 2/614 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 431/431 variables, and 614 constraints, problems are : Problem set: 0 solved, 394 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 159/159 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 42375ms problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 42389ms
Starting structural reductions in LTL mode, iteration 1 : 159/222 places, 396/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43292 ms. Remains : 159/222 places, 396/648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 396/396 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 396/396 (removed 0) transitions.
[2026-05-25 04:14:48] [INFO ] Flow matrix only has 272 transitions (discarded 124 similar events)
[2026-05-25 04:14:48] [INFO ] Invariant cache hit.
[2026-05-25 04:14:48] [INFO ] Implicit Places using invariants in 104 ms returned []
[2026-05-25 04:14:48] [INFO ] Flow matrix only has 272 transitions (discarded 124 similar events)
[2026-05-25 04:14:48] [INFO ] Invariant cache hit.
[2026-05-25 04:14:48] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-25 04:14:48] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 159/159 places, 396/396 transitions.
Support contains 33 out of 159 places after structural reductions.
[2026-05-25 04:14:49] [INFO ] Flatten gal took : 48 ms
[2026-05-25 04:14:49] [INFO ] Flatten gal took : 25 ms
[2026-05-25 04:14:49] [INFO ] Input system was already deterministic with 396 transitions.
RANDOM walk for 40171 steps (21 resets) in 815 ms. (49 steps per ms) remains 2/21 properties
BEST_FIRST walk for 40004 steps (17 resets) in 175 ms. (227 steps per ms) remains 1/2 properties
[2026-05-25 04:14:49] [INFO ] Flow matrix only has 272 transitions (discarded 124 similar events)
[2026-05-25 04:14:49] [INFO ] Invariant cache hit.
[2026-05-25 04:14:49] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/23 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 160/183 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/203 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 191/394 variables, 105/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/394 variables, 55/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/400 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/400 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 31/431 variables, 29/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/431 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/431 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 431/431 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 159/159 constraints, ReadFeed: 56/56 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/23 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 160/183 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/203 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 191/394 variables, 105/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/394 variables, 55/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 6/400 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/400 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 31/431 variables, 29/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/431 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/431 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 431/431 variables, and 219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 159/159 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 330ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 396/396 transitions.
Graph (complete) has 645 edges and 159 vertex of which 134 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 134 transition count 348
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 126 transition count 328
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 126 transition count 328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 126 transition count 324
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 75 place count 120 transition count 308
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 120 transition count 308
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 115 transition count 294
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 115 transition count 294
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 96 place count 110 transition count 274
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 110 transition count 274
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 106 place count 105 transition count 260
Iterating global reduction 2 with 5 rules applied. Total rules applied 111 place count 105 transition count 260
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 116 place count 100 transition count 248
Iterating global reduction 2 with 5 rules applied. Total rules applied 121 place count 100 transition count 248
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 126 place count 95 transition count 236
Iterating global reduction 2 with 5 rules applied. Total rules applied 131 place count 95 transition count 236
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 136 place count 90 transition count 226
Iterating global reduction 2 with 5 rules applied. Total rules applied 141 place count 90 transition count 226
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 146 place count 85 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 151 place count 85 transition count 216
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 154 place count 82 transition count 210
Iterating global reduction 2 with 3 rules applied. Total rules applied 157 place count 82 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 81 transition count 208
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 81 transition count 208
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 160 place count 80 transition count 206
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 80 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 80 transition count 202
Applied a total of 165 rules in 58 ms. Remains 80 /159 variables (removed 79) and now considering 202/396 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 80/159 places, 202/396 transitions.
RANDOM walk for 35744 steps (7 resets) in 166 ms. (214 steps per ms) remains 0/1 properties
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 857 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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&&F(G(p1)))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 396/396 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 396
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 150 transition count 376
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 150 transition count 376
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 21 place count 150 transition count 372
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 26 place count 145 transition count 358
Iterating global reduction 2 with 5 rules applied. Total rules applied 31 place count 145 transition count 358
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 35 place count 141 transition count 348
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 141 transition count 348
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 137 transition count 334
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 137 transition count 334
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 133 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 133 transition count 324
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 129 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 129 transition count 314
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 125 transition count 304
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 125 transition count 304
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 122 transition count 298
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 122 transition count 298
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 119 transition count 292
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 119 transition count 292
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 117 transition count 288
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 117 transition count 288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 116 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 116 transition count 286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 115 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 115 transition count 284
Applied a total of 91 rules in 38 ms. Remains 115 /159 variables (removed 44) and now considering 284/396 (removed 112) transitions.
[2026-05-25 04:14:50] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11200992456413601578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14131284533382153226.kers'
[2026-05-25 04:14:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11200992456413601578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14131284533382153226.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 193 rows 115 cols 536 entries
Finished phase 1 with 112 SingleSign rule and 1 generalized
[2026-05-25 04:14:50] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14131284533382153226.kers
Total runtime 1 ms.
[2026-05-25 04:14:50] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 04:14:50] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2026-05-25 04:14:50] [INFO ] Invariant cache hit.
[2026-05-25 04:14:50] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 04:14:50] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-25 04:14:50] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2026-05-25 04:14:50] [INFO ] Invariant cache hit.
[2026-05-25 04:14:50] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 193/308 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 282 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/308 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 160 constraints, problems are : Problem set: 0 solved, 282 unsolved in 6896 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 193/308 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 282/442 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 443 constraints, problems are : Problem set: 0 solved, 282 unsolved in 25308 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 115/115 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 32309ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 32313ms
Starting structural reductions in LTL mode, iteration 1 : 115/159 places, 284/396 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32752 ms. Remains : 115/159 places, 284/396 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&&F(G(p1)))))'
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-00
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 4 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-00 finished in 33183 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((G(p1) U p2))))'
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 396/396 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 396
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 151 transition count 380
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 380
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 19 place count 151 transition count 376
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 146 transition count 362
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 146 transition count 362
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 33 place count 142 transition count 352
Iterating global reduction 2 with 4 rules applied. Total rules applied 37 place count 142 transition count 352
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 41 place count 138 transition count 336
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 138 transition count 336
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 134 transition count 324
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 134 transition count 324
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 130 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 130 transition count 314
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 126 transition count 304
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 126 transition count 304
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 123 transition count 298
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 123 transition count 298
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 78 place count 120 transition count 292
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 120 transition count 292
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 118 transition count 288
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 118 transition count 288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 117 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 117 transition count 286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 116 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 116 transition count 284
Applied a total of 89 rules in 26 ms. Remains 116 /159 variables (removed 43) and now considering 284/396 (removed 112) transitions.
[2026-05-25 04:15:23] [INFO ] Flow matrix only has 195 transitions (discarded 89 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11143667760397982372.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13712941968509982755.kers'
[2026-05-25 04:15:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11143667760397982372.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13712941968509982755.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 195 rows 116 cols 542 entries
Finished phase 1 with 113 SingleSign rule and 1 generalized
[2026-05-25 04:15:23] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13712941968509982755.kers
Total runtime 0 ms.
[2026-05-25 04:15:23] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-25 04:15:23] [INFO ] Flow matrix only has 195 transitions (discarded 89 similar events)
[2026-05-25 04:15:23] [INFO ] Invariant cache hit.
[2026-05-25 04:15:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-25 04:15:23] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-25 04:15:23] [INFO ] Flow matrix only has 195 transitions (discarded 89 similar events)
[2026-05-25 04:15:23] [INFO ] Invariant cache hit.
[2026-05-25 04:15:23] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 195/311 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 45/163 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 282 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/311 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 163 constraints, problems are : Problem set: 0 solved, 282 unsolved in 7306 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 195/311 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 45/163 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 282/445 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 2/447 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 447 constraints, problems are : Problem set: 0 solved, 282 unsolved in 22758 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 30149ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 30150ms
Starting structural reductions in LTL mode, iteration 1 : 116/159 places, 284/396 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30586 ms. Remains : 116/159 places, 284/396 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((G(p1) U p2))))'
Stuttering acceptance computed with spot in 233 ms :[(NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 225 ms.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 15 factoid took 20 ms. Proved property starting from automaton with 5 states, 9 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 29 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b128-LTLCardinality-01 finished in 31328 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(p0)&&F(p1))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 396/396 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 396
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 150 transition count 374
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 150 transition count 374
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 150 transition count 372
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 143 transition count 352
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 143 transition count 352
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 39 place count 137 transition count 336
Iterating global reduction 2 with 6 rules applied. Total rules applied 45 place count 137 transition count 336
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 51 place count 131 transition count 314
Iterating global reduction 2 with 6 rules applied. Total rules applied 57 place count 131 transition count 314
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 125 transition count 298
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 125 transition count 298
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 75 place count 119 transition count 284
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 119 transition count 284
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 114 transition count 272
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 114 transition count 272
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 96 place count 109 transition count 262
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 109 transition count 262
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 106 place count 104 transition count 252
Iterating global reduction 2 with 5 rules applied. Total rules applied 111 place count 104 transition count 252
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 101 transition count 246
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 100 transition count 244
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 99 transition count 242
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 99 transition count 242
Applied a total of 121 rules in 26 ms. Remains 99 /159 variables (removed 60) and now considering 242/396 (removed 154) transitions.
[2026-05-25 04:15:54] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17606695130931888415.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17887851297918311512.kers'
[2026-05-25 04:15:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17606695130931888415.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17887851297918311512.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 99 cols 452 entries
Finished phase 1 with 96 SingleSign rule and 1 generalized
[2026-05-25 04:15:54] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17887851297918311512.kers
Total runtime 1 ms.
[2026-05-25 04:15:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 04:15:54] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2026-05-25 04:15:54] [INFO ] Invariant cache hit.
[2026-05-25 04:15:54] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 04:15:55] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2026-05-25 04:15:55] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2026-05-25 04:15:55] [INFO ] Invariant cache hit.
[2026-05-25 04:15:55] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 164/263 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 140 constraints, problems are : Problem set: 0 solved, 240 unsolved in 5844 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 164/263 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 240/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 382 constraints, problems are : Problem set: 0 solved, 240 unsolved in 18216 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 24134ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 24135ms
Starting structural reductions in LTL mode, iteration 1 : 99/159 places, 242/396 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24459 ms. Remains : 99/159 places, 242/396 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(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 515 steps with 6 reset in 10 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-02 finished in 24634 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 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 396/396 transitions.
Graph (complete) has 857 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 149 transition count 372
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 149 transition count 372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 23 place count 149 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 142 transition count 348
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 142 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 136 transition count 332
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 136 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 55 place count 130 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 61 place count 130 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 124 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 124 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 78 place count 119 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 119 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 88 place count 114 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 93 place count 114 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 97 place count 110 transition count 262
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 110 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 105 place count 106 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 109 place count 106 transition count 254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 104 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 104 transition count 250
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 103 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 103 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 102 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 102 transition count 246
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 102 transition count 244
Applied a total of 119 rules in 62 ms. Remains 102 /159 variables (removed 57) and now considering 244/396 (removed 152) transitions.
[2026-05-25 04:16:19] [INFO ] Flow matrix only has 167 transitions (discarded 77 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12744280404566363984.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5775373744993444847.kers'
[2026-05-25 04:16:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12744280404566363984.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5775373744993444847.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 102 cols 466 entries
Finished phase 1 with 99 SingleSign rule and 1 generalized
[2026-05-25 04:16:19] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5775373744993444847.kers
Total runtime 1 ms.
[2026-05-25 04:16:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 04:16:19] [INFO ] Flow matrix only has 167 transitions (discarded 77 similar events)
[2026-05-25 04:16:19] [INFO ] Invariant cache hit.
[2026-05-25 04:16:19] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 04:16:19] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2026-05-25 04:16:19] [INFO ] Redundant transitions in 14 ms returned []
Running 242 sub problems to find dead transitions.
[2026-05-25 04:16:19] [INFO ] Flow matrix only has 167 transitions (discarded 77 similar events)
[2026-05-25 04:16:19] [INFO ] Invariant cache hit.
[2026-05-25 04:16:19] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 167/269 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 242 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/269 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 144 constraints, problems are : Problem set: 0 solved, 242 unsolved in 5504 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 167/269 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 40/144 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 242/386 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 389 constraints, problems are : Problem set: 0 solved, 242 unsolved in 19225 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 24800ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 24801ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/159 places, 244/396 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25231 ms. Remains : 102/159 places, 244/396 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 35 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-05
Stuttering criterion allowed to conclude after 406 steps with 3 reset in 4 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-05 finished in 25307 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)&&(G(p0)||X(!p0))))'
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 396/396 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 396
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 149 transition count 372
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 149 transition count 372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 23 place count 149 transition count 368
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 30 place count 142 transition count 348
Iterating global reduction 2 with 7 rules applied. Total rules applied 37 place count 142 transition count 348
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 43 place count 136 transition count 332
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 136 transition count 332
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 130 transition count 310
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 130 transition count 310
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 124 transition count 294
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 118 transition count 280
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 118 transition count 280
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 112 transition count 266
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 112 transition count 266
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 107 transition count 256
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 107 transition count 256
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 111 place count 103 transition count 248
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 103 transition count 248
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 100 transition count 242
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 99 transition count 240
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 98 transition count 238
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 98 transition count 238
Applied a total of 125 rules in 18 ms. Remains 98 /159 variables (removed 61) and now considering 238/396 (removed 158) transitions.
[2026-05-25 04:16:44] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7297267085725620494.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15885312474713896201.kers'
[2026-05-25 04:16:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7297267085725620494.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15885312474713896201.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 98 cols 448 entries
Finished phase 1 with 95 SingleSign rule and 1 generalized
[2026-05-25 04:16:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15885312474713896201.kers
Total runtime 0 ms.
[2026-05-25 04:16:44] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 04:16:44] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2026-05-25 04:16:44] [INFO ] Invariant cache hit.
[2026-05-25 04:16:44] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 04:16:45] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2026-05-25 04:16:45] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2026-05-25 04:16:45] [INFO ] Invariant cache hit.
[2026-05-25 04:16:45] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 162/260 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 139 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5716 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 162/260 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 236/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 375 constraints, problems are : Problem set: 0 solved, 236 unsolved in 11745 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17509ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 17512ms
Starting structural reductions in LTL mode, iteration 1 : 98/159 places, 238/396 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17869 ms. Remains : 98/159 places, 238/396 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)&&(G(p0)||X(!p0))))'
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), false, true, true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-07
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-07 finished in 18108 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 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 396/396 transitions.
Graph (complete) has 857 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 150 transition count 374
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 150 transition count 374
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 21 place count 150 transition count 370
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 144 transition count 354
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 144 transition count 354
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 140 transition count 342
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 140 transition count 342
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 136 transition count 326
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 136 transition count 326
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 132 transition count 316
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 132 transition count 316
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 128 transition count 306
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 128 transition count 306
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 124 transition count 296
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 124 transition count 296
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 77 place count 120 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 81 place count 120 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 85 place count 116 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 116 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 114 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 114 transition count 276
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 113 transition count 274
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 113 transition count 274
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 112 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 112 transition count 272
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 101 place count 112 transition count 268
Applied a total of 101 rules in 51 ms. Remains 112 /159 variables (removed 47) and now considering 268/396 (removed 128) transitions.
[2026-05-25 04:17:02] [INFO ] Flow matrix only has 185 transitions (discarded 83 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10496635641747843146.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13905361126394094691.kers'
[2026-05-25 04:17:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10496635641747843146.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13905361126394094691.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 185 rows 112 cols 520 entries
Finished phase 1 with 109 SingleSign rule and 1 generalized
[2026-05-25 04:17:02] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13905361126394094691.kers
Total runtime 2 ms.
[2026-05-25 04:17:02] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-25 04:17:02] [INFO ] Flow matrix only has 185 transitions (discarded 83 similar events)
[2026-05-25 04:17:02] [INFO ] Invariant cache hit.
[2026-05-25 04:17:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 04:17:03] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2026-05-25 04:17:03] [INFO ] Redundant transitions in 14 ms returned []
Running 266 sub problems to find dead transitions.
[2026-05-25 04:17:03] [INFO ] Flow matrix only has 185 transitions (discarded 83 similar events)
[2026-05-25 04:17:03] [INFO ] Invariant cache hit.
[2026-05-25 04:17:03] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 185/297 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 43/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 157 constraints, problems are : Problem set: 0 solved, 266 unsolved in 6502 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 185/297 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 43/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 266/423 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 423 constraints, problems are : Problem set: 0 solved, 266 unsolved in 15954 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22533ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 22534ms
Starting structural reductions in SI_LTL mode, iteration 1 : 112/159 places, 268/396 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22997 ms. Remains : 112/159 places, 268/396 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 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-08
Stuttering criterion allowed to conclude after 241 steps with 3 reset in 3 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-08 finished in 23173 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(p0))||G(p1)))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 396/396 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 396
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 150 transition count 374
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 150 transition count 374
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 150 transition count 372
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 26 place count 143 transition count 352
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 143 transition count 352
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 39 place count 137 transition count 336
Iterating global reduction 2 with 6 rules applied. Total rules applied 45 place count 137 transition count 336
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 51 place count 131 transition count 314
Iterating global reduction 2 with 6 rules applied. Total rules applied 57 place count 131 transition count 314
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 125 transition count 298
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 125 transition count 298
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 75 place count 119 transition count 284
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 119 transition count 284
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 87 place count 113 transition count 270
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 113 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 98 place count 108 transition count 260
Iterating global reduction 2 with 5 rules applied. Total rules applied 103 place count 108 transition count 260
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 108 place count 103 transition count 250
Iterating global reduction 2 with 5 rules applied. Total rules applied 113 place count 103 transition count 250
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 101 transition count 246
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 100 transition count 244
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 120 place count 99 transition count 242
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 99 transition count 242
Applied a total of 121 rules in 18 ms. Remains 99 /159 variables (removed 60) and now considering 242/396 (removed 154) transitions.
[2026-05-25 04:17:26] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15059175363145370655.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15350041065645768969.kers'
[2026-05-25 04:17:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15059175363145370655.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15350041065645768969.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 164 rows 99 cols 452 entries
Finished phase 1 with 96 SingleSign rule and 1 generalized
[2026-05-25 04:17:26] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15350041065645768969.kers
Total runtime 1 ms.
[2026-05-25 04:17:26] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 04:17:26] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2026-05-25 04:17:26] [INFO ] Invariant cache hit.
[2026-05-25 04:17:26] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-25 04:17:26] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2026-05-25 04:17:26] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2026-05-25 04:17:26] [INFO ] Invariant cache hit.
[2026-05-25 04:17:26] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 164/263 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 140 constraints, problems are : Problem set: 0 solved, 240 unsolved in 5880 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 164/263 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 240/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 0/263 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 381 constraints, problems are : Problem set: 0 solved, 240 unsolved in 15515 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 21476ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 21477ms
Starting structural reductions in LTL mode, iteration 1 : 99/159 places, 242/396 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21815 ms. Remains : 99/159 places, 242/396 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(p0))||G(p1)))'
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 217 steps with 1 reset in 1 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-12 finished in 22005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(((X(p1)&&F((p2||X(p3))))||X(G(p1))))))))'
Support contains 7 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 396/396 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 396
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 151 transition count 376
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 376
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 19 place count 151 transition count 372
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 146 transition count 358
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 146 transition count 358
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 34 place count 141 transition count 344
Iterating global reduction 2 with 5 rules applied. Total rules applied 39 place count 141 transition count 344
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 43 place count 137 transition count 330
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 137 transition count 330
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 133 transition count 322
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 133 transition count 322
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 129 transition count 312
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 129 transition count 312
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 125 transition count 302
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 125 transition count 302
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 122 transition count 296
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 122 transition count 296
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 119 transition count 290
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 119 transition count 290
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 118 transition count 288
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 118 transition count 288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 117 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 117 transition count 286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 116 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 116 transition count 284
Applied a total of 89 rules in 23 ms. Remains 116 /159 variables (removed 43) and now considering 284/396 (removed 112) transitions.
[2026-05-25 04:17:48] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-271535167466849688.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13620944208490638306.kers'
[2026-05-25 04:17:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-271535167466849688.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13620944208490638306.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 193 rows 116 cols 536 entries
Finished phase 1 with 113 SingleSign rule and 1 generalized
[2026-05-25 04:17:48] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13620944208490638306.kers
Total runtime 1 ms.
[2026-05-25 04:17:48] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 04:17:48] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2026-05-25 04:17:48] [INFO ] Invariant cache hit.
[2026-05-25 04:17:48] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 04:17:48] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2026-05-25 04:17:48] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2026-05-25 04:17:48] [INFO ] Invariant cache hit.
[2026-05-25 04:17:48] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 193/309 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 43/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/309 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 161 constraints, problems are : Problem set: 0 solved, 282 unsolved in 7095 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 193/309 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 43/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 282/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 3/446 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 446 constraints, problems are : Problem set: 0 solved, 282 unsolved in 24092 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 31260ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 31261ms
Starting structural reductions in LTL mode, iteration 1 : 116/159 places, 284/396 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31668 ms. Remains : 116/159 places, 284/396 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(((X(p1)&&F((p2||X(p3))))||X(G(p1))))))))'
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-13
Product exploration explored 100000 steps with 3891 reset in 273 ms.
Product exploration explored 100000 steps with 3852 reset in 317 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge based reduction with 11 factoid took 71 ms. Reduced automaton from 8 states, 14 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 4 AP (stutter sensitive).
RANDOM walk for 40056 steps (17 resets) in 150 ms. (265 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (20 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
[2026-05-25 04:18:20] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2026-05-25 04:18:20] [INFO ] Invariant cache hit.
[2026-05-25 04:18:20] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 102/154 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/236 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 21/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/243 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 58/301 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/309 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/309 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 161 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 45/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 102/154 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 82/236 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 21/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/243 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 58/301 variables, 37/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 11/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/301 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/309 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 568ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5417 steps, including 10 resets, run visited all 1 properties in 13 ms. (steps per millisecond=416 )
Parikh walk visited 1 properties in 16 ms.
Knowledge based reduction with 11 factoid took 127 ms. Reduced automaton from 5 states, 6 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Knowledge-based reduction took 1116 ms.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 284/284 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2026-05-25 04:18:21] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2026-05-25 04:18:21] [INFO ] Invariant cache hit.
[2026-05-25 04:18:22] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 04:18:22] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2026-05-25 04:18:22] [INFO ] Invariant cache hit.
[2026-05-25 04:18:22] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 04:18:22] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 408 ms. Remains : 116/116 places, 284/284 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge based reduction with 6 factoid took 53 ms. Reduced automaton from 5 states, 6 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 4 AP (stutter sensitive).
RANDOM walk for 40131 steps (13 resets) in 90 ms. (441 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (23 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 111 ms. (357 steps per ms) remains 3/3 properties
[2026-05-25 04:18:22] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2026-05-25 04:18:22] [INFO ] Invariant cache hit.
[2026-05-25 04:18:22] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 102/154 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 82/236 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 21/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/243 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/243 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 58/301 variables, 37/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/301 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/309 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/309 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/309 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 161 constraints, problems are : Problem set: 0 solved, 3 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 45/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 102/154 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 82/236 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 21/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 7/243 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 58/301 variables, 37/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/301 variables, 11/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/301 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 8/309 variables, 5/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/309 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/309 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 166 constraints, problems are : Problem set: 0 solved, 3 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 998ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 271 ms.
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 284/284 transitions.
Graph (complete) has 471 edges and 116 vertex of which 95 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 95 transition count 242
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 95 transition count 236
Applied a total of 49 rules in 16 ms. Remains 95 /116 variables (removed 21) and now considering 236/284 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 95/116 places, 236/284 transitions.
RANDOM walk for 37523 steps (8 resets) in 131 ms. (284 steps per ms) remains 0/3 properties
Knowledge based reduction with 6 factoid took 107 ms. Reduced automaton from 5 states, 6 edges and 4 AP (stutter sensitive) to 5 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Knowledge-based reduction took 2007 ms.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 2083 reset in 262 ms.
Product exploration explored 100000 steps with 2146 reset in 393 ms.
Spot run failed in 90 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/ltsmin17041366383625104414
[2026-05-25 04:18:25] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17041366383625104414
Running compilation step : cd /tmp/ltsmin17041366383625104414;'/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 738 ms.
Running link step : cd /tmp/ltsmin17041366383625104414;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17041366383625104414;'/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/stateBased12431381311550168839.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 284/284 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2026-05-25 04:18:40] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2026-05-25 04:18:40] [INFO ] Invariant cache hit.
[2026-05-25 04:18:40] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 04:18:40] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2026-05-25 04:18:40] [INFO ] Invariant cache hit.
[2026-05-25 04:18:40] [INFO ] State equation strengthened by 43 read => feed constraints.
[2026-05-25 04:18:40] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 406 ms. Remains : 116/116 places, 284/284 transitions.
Built C files in :
/tmp/ltsmin13462230325843512615
[2026-05-25 04:18:40] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13462230325843512615
Running compilation step : cd /tmp/ltsmin13462230325843512615;'/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 396 ms.
Running link step : cd /tmp/ltsmin13462230325843512615;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13462230325843512615;'/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/stateBased14718029481947726479.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 04:18:56] [INFO ] Flatten gal took : 15 ms
[2026-05-25 04:18:56] [INFO ] Flatten gal took : 15 ms
[2026-05-25 04:18:56] [INFO ] Time to serialize gal into /tmp/LTL12771477118927100676.gal : 4 ms
[2026-05-25 04:18:56] [INFO ] Time to serialize properties into /tmp/LTL17948023493216815023.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12771477118927100676.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2162845514244506955.hoa' '-atoms' '/tmp/LTL17948023493216815023.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17948023493216815023.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2162845514244506955.hoa
Detected timeout of ITS tools.
[2026-05-25 04:19:11] [INFO ] Flatten gal took : 17 ms
[2026-05-25 04:19:11] [INFO ] Flatten gal took : 11 ms
[2026-05-25 04:19:11] [INFO ] Time to serialize gal into /tmp/LTL11170164484988916780.gal : 3 ms
[2026-05-25 04:19:11] [INFO ] Time to serialize properties into /tmp/LTL4799598373848373265.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11170164484988916780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4799598373848373265.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(l242<2)")))||((F("(l242<2)"))&&(X((X(G("(l177<=l93)")))||((X("(l177<=l93)"))&&(F(("(s2>l273)")||(X("(l276>l63)")))))))))))
Formula 0 simplified : G(FG!"(l242<2)" & (G!"(l242<2)" | X(XF!"(l177<=l93)" & (X!"(l177<=l93)" | G(!"(s2>l273)" & X!"(l276>l63)")))))
Detected timeout of ITS tools.
[2026-05-25 04:19:26] [INFO ] Flatten gal took : 12 ms
[2026-05-25 04:19:26] [INFO ] Applying decomposition
[2026-05-25 04:19:26] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11228957162101220630.txt' '-o' '/tmp/graph11228957162101220630.bin' '-w' '/tmp/graph11228957162101220630.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11228957162101220630.bin' '-l' '-1' '-v' '-w' '/tmp/graph11228957162101220630.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:19:26] [INFO ] Decomposing Gal with order
[2026-05-25 04:19:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:19:26] [INFO ] Removed a total of 47 redundant transitions.
[2026-05-25 04:19:26] [INFO ] Flatten gal took : 63 ms
[2026-05-25 04:19:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 4 ms.
[2026-05-25 04:19:26] [INFO ] Time to serialize gal into /tmp/LTL15285210843809557724.gal : 3 ms
[2026-05-25 04:19:26] [INFO ] Time to serialize properties into /tmp/LTL15108880114961132092.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15285210843809557724.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15108880114961132092.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(gi1.gu0.l242<2)")))||((F("(gi1.gu0.l242<2)"))&&(X((X(G("(gu3.l177<=gu3.l93)")))||((X("(gu3.l177<=gu3.l93)"))&&(F(("(gu1.s2...203
Formula 0 simplified : G(FG!"(gi1.gu0.l242<2)" & (G!"(gi1.gu0.l242<2)" | X(XF!"(gu3.l177<=gu3.l93)" & (X!"(gu3.l177<=gu3.l93)" | G(!"(gu1.s2>gu1.l273)" & X...181
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b128-LTLCardinality-13 finished in 113470 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 G(p1)) U X((p2||G(F(!p2))))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 396/396 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 150 transition count 372
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 150 transition count 372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 150 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 143 transition count 348
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 143 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 138 transition count 336
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 138 transition count 336
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 133 transition count 318
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 133 transition count 318
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 128 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 128 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 123 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 123 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 118 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 118 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 114 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 114 transition count 272
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 98 place count 110 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 110 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 107 transition count 258
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 107 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 106 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 106 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 105 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 105 transition count 254
Applied a total of 112 rules in 23 ms. Remains 105 /159 variables (removed 54) and now considering 254/396 (removed 142) transitions.
[2026-05-25 04:19:41] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9832452071867078805.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15973923525778439375.kers'
[2026-05-25 04:19:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9832452071867078805.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15973923525778439375.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 105 cols 484 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-25 04:19:41] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15973923525778439375.kers
Total runtime 3 ms.
[2026-05-25 04:19:41] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-25 04:19:41] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2026-05-25 04:19:41] [INFO ] Invariant cache hit.
[2026-05-25 04:19:41] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 04:19:41] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2026-05-25 04:19:41] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2026-05-25 04:19:41] [INFO ] Invariant cache hit.
[2026-05-25 04:19:41] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 172/277 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/277 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 148 constraints, problems are : Problem set: 0 solved, 252 unsolved in 5477 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 172/277 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 252/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 400 constraints, problems are : Problem set: 0 solved, 252 unsolved in 14329 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19877ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 19878ms
Starting structural reductions in LTL mode, iteration 1 : 105/159 places, 254/396 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20256 ms. Remains : 105/159 places, 254/396 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 G(p1)) U X((p2||G(F(!p2))))))'
Stuttering acceptance computed with spot in 451 ms :[false, false, false, false, p2, p2, (AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-14
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-14 finished in 20760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 396/396 transitions.
Graph (complete) has 857 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 150 transition count 374
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 150 transition count 374
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 21 place count 150 transition count 370
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 144 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 144 transition count 352
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 139 transition count 338
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 139 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 134 transition count 320
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 134 transition count 320
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 129 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 129 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 124 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 124 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 78 place count 119 transition count 286
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 119 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 115 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 115 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 95 place count 111 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 99 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 109 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 109 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 107 place count 109 transition count 262
Applied a total of 107 rules in 34 ms. Remains 109 /159 variables (removed 50) and now considering 262/396 (removed 134) transitions.
[2026-05-25 04:20:02] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3589592214712085405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16895495969781524127.kers'
[2026-05-25 04:20:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3589592214712085405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16895495969781524127.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 109 cols 500 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-05-25 04:20:02] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16895495969781524127.kers
Total runtime 1 ms.
[2026-05-25 04:20:02] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 04:20:02] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2026-05-25 04:20:02] [INFO ] Invariant cache hit.
[2026-05-25 04:20:02] [INFO ] State equation strengthened by 41 read => feed constraints.
[2026-05-25 04:20:02] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2026-05-25 04:20:02] [INFO ] Redundant transitions in 3 ms returned []
Running 260 sub problems to find dead transitions.
[2026-05-25 04:20:02] [INFO ] Flow matrix only has 179 transitions (discarded 83 similar events)
[2026-05-25 04:20:02] [INFO ] Invariant cache hit.
[2026-05-25 04:20:02] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 152 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6214 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 260/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/288 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 412 constraints, problems are : Problem set: 0 solved, 260 unsolved in 12069 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18342ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 18343ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/159 places, 262/396 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18696 ms. Remains : 109/159 places, 262/396 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 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b128-LTLCardinality-15
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b128-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b128-LTLCardinality-15 finished in 18816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(((X(p1)&&F((p2||X(p3))))||X(G(p1))))))))'
Spot run failed in 44 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 04:20:21] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13466929731274860449
[2026-05-25 04:20:21] [INFO ] Computing symmetric may disable matrix : 396 transitions.
[2026-05-25 04:20:21] [INFO ] Applying decomposition
[2026-05-25 04:20:21] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:20:21] [INFO ] Computing symmetric may enable matrix : 396 transitions.
[2026-05-25 04:20:21] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:20:21] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10616204800991540681.txt' '-o' '/tmp/graph10616204800991540681.bin' '-w' '/tmp/graph10616204800991540681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10616204800991540681.bin' '-l' '-1' '-v' '-w' '/tmp/graph10616204800991540681.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:20:21] [INFO ] Decomposing Gal with order
[2026-05-25 04:20:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:20:21] [INFO ] Computing Do-Not-Accords matrix : 396 transitions.
[2026-05-25 04:20:21] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 04:20:21] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13466929731274860449
Running compilation step : cd /tmp/ltsmin13466929731274860449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
[2026-05-25 04:20:21] [INFO ] Removed a total of 127 redundant transitions.
[2026-05-25 04:20:21] [INFO ] Flatten gal took : 48 ms
[2026-05-25 04:20:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 8 ms.
[2026-05-25 04:20:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality11151562681865771684.gal : 3 ms
[2026-05-25 04:20:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality18376654378484169937.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11151562681865771684.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18376654378484169937.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(gi1.gu0.l242<2)")))||((F("(gi1.gu0.l242<2)"))&&(X(((X("(gu10.l177<=gu10.l93)"))&&(F(("(gu1.s2>gu1.l273)")||(X("(gu6.l276>g...207
Formula 0 simplified : G(FG!"(gi1.gu0.l242<2)" & (G!"(gi1.gu0.l242<2)" | X(XF!"(gu10.l177<=gu10.l93)" & (X!"(gu10.l177<=gu10.l93)" | G(!"(gu1.s2>gu1.l273)"...185
Compilation finished in 862 ms.
Running link step : cd /tmp/ltsmin13466929731274860449;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13466929731274860449;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(((X((LTLAPp1==true))&&<>(((LTLAPp2==true)||X((LTLAPp3==true)))))||X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 04:42:28] [INFO ] Flatten gal took : 152 ms
[2026-05-25 04:42:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality14539700072388581100.gal : 25 ms
[2026-05-25 04:42:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality6872564623282312967.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14539700072388581100.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6872564623282312967.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(l242<2)")))||((F("(l242<2)"))&&(X(((X("(l177<=l93)"))&&(F(("(s2>l273)")||(X("(l276>l63)")))))||(X(G("(l177<=l93)")))))))))
Formula 0 simplified : G(FG!"(l242<2)" & (G!"(l242<2)" | X(XF!"(l177<=l93)" & (X!"(l177<=l93)" | G(!"(s2>l273)" & X!"(l276>l63)")))))
Detected timeout of ITS tools.
[2026-05-25 05:04:35] [INFO ] Flatten gal took : 269 ms
[2026-05-25 05:04:36] [INFO ] Input system was already deterministic with 396 transitions.
[2026-05-25 05:04:43] [INFO ] Transformed 159 places.
[2026-05-25 05:04:43] [INFO ] Transformed 396 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 05:04:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality17118538765608223851.gal : 9 ms
[2026-05-25 05:04:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality16149198651283065968.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17118538765608223851.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16149198651283065968.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(F("(l242<2)")))||((F("(l242<2)"))&&(X(((X("(l177<=l93)"))&&(F(("(s2>l273)")||(X("(l276>l63)")))))||(X(G("(l177<=l93)")))))))))
Formula 0 simplified : G(FG!"(l242<2)" & (G!"(l242<2)" | X(XF!"(l177<=l93)" & (X!"(l177<=l93)" | G(!"(s2>l273)" & X!"(l276>l63)")))))

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="FunctionPointer-PT-b128"
export BK_EXAMINATION="LTLCardinality"
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 FunctionPointer-PT-b128, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074000107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b128.tgz
mv FunctionPointer-PT-b128 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;