About the Execution of ITS-Tools for GPUForwardProgress-PT-12b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 592.668 | 365820.00 | 446458.00 | 12835.40 | FFFFFFFFFFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074200420.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 GPUForwardProgress-PT-12b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074200420
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 8.8K Mar 7 11:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Mar 7 11:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 11:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 11:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 11:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 7 11:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 11:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Mar 7 11:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 65K 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 GPUForwardProgress-PT-12b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779725854486
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 16:17:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 16:17:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 16:17:35] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2026-05-25 16:17:35] [INFO ] Transformed 264 places.
[2026-05-25 16:17:35] [INFO ] Transformed 277 transitions.
[2026-05-25 16:17:35] [INFO ] Found NUPN structural information;
[2026-05-25 16:17:35] [INFO ] Parsed PT model containing 264 places and 277 transitions and 677 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 277/277 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 243 transition count 256
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 243 transition count 256
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 236 transition count 249
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 236 transition count 249
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 62 place count 236 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 235 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 235 transition count 242
Applied a total of 64 rules in 61 ms. Remains 235 /264 variables (removed 29) and now considering 242/277 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8668294016266907490.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15475885536071526187.kers'
[2026-05-25 16:17:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8668294016266907490.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15475885536071526187.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 242 rows 234 cols 605 entries
Finished phase 1 with 220 SingleSign rule and 1 generalized
[2026-05-25 16:17:36] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-15475885536071526187.kers
Total runtime 18 ms.
[2026-05-25 16:17:36] [INFO ] Implicit Places using invariants in 377 ms returned []
[2026-05-25 16:17:36] [INFO ] Invariant cache hit.
[2026-05-25 16:17:36] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2026-05-25 16:17:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 242/476 variables, 234/248 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 1/477 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 249 constraints, problems are : Problem set: 0 solved, 241 unsolved in 18539 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 242/476 variables, 234/248 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 241/489 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 1/477 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/477 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 490 constraints, problems are : Problem set: 0 solved, 241 unsolved in 25353 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44012ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 44050ms
Starting structural reductions in LTL mode, iteration 1 : 235/264 places, 242/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44863 ms. Remains : 235/264 places, 242/277 transitions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2026-05-25 16:18:20] [INFO ] Invariant cache hit.
[2026-05-25 16:18:20] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 16:18:20] [INFO ] Invariant cache hit.
[2026-05-25 16:18:21] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 235/235 places, 242/242 transitions.
Support contains 52 out of 235 places after structural reductions.
[2026-05-25 16:18:21] [INFO ] Flatten gal took : 44 ms
[2026-05-25 16:18:21] [INFO ] Flatten gal took : 18 ms
[2026-05-25 16:18:21] [INFO ] Input system was already deterministic with 242 transitions.
Support contains 50 out of 235 places (down from 52) after GAL structural reductions.
RANDOM walk for 40000 steps (361 resets) in 1247 ms. (32 steps per ms) remains 3/37 properties
BEST_FIRST walk for 40004 steps (47 resets) in 99 ms. (400 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (48 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (48 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
[2026-05-25 16:18:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 220/234 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 242/476 variables, 234/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/477 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/477 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 249 constraints, problems are : Problem set: 0 solved, 2 unsolved in 283 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 220/234 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 242/476 variables, 234/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/477 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/477 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 251 constraints, problems are : Problem set: 0 solved, 2 unsolved in 330 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 618ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 354 ms.
Support contains 14 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 242/242 transitions.
Graph (trivial) has 203 edges and 235 vertex of which 6 / 235 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 230 transition count 118
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 127 rules applied. Total rules applied 245 place count 113 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 248 place count 110 transition count 108
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 248 place count 110 transition count 82
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 300 place count 84 transition count 82
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 302 place count 82 transition count 80
Iterating global reduction 3 with 2 rules applied. Total rules applied 304 place count 82 transition count 80
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 304 place count 82 transition count 79
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 306 place count 81 transition count 79
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 380 place count 44 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 392 place count 44 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 394 place count 43 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 395 place count 43 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 396 place count 42 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 397 place count 41 transition count 38
Applied a total of 397 rules in 39 ms. Remains 41 /235 variables (removed 194) and now considering 38/242 (removed 204) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 41/235 places, 38/242 transitions.
RANDOM walk for 40000 steps (4760 resets) in 468 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (771 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (762 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 193 steps, run visited all 2 properties in 15 ms. (steps per millisecond=12 )
Probabilistic random walk after 193 steps, saw 170 distinct states, run finished after 20 ms. (steps per millisecond=9 ) properties seen :2
FORMULA GPUForwardProgress-PT-12b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 43 stabilizing places and 43 stable transitions
Graph (complete) has 361 edges and 235 vertex of which 218 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 242/242 transitions.
Graph (trivial) has 200 edges and 235 vertex of which 6 / 235 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 355 edges and 230 vertex of which 213 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 212 transition count 119
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 121 rules applied. Total rules applied 236 place count 99 transition count 111
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 239 place count 97 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 240 place count 96 transition count 110
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 240 place count 96 transition count 85
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 290 place count 71 transition count 85
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 302 place count 59 transition count 73
Iterating global reduction 4 with 12 rules applied. Total rules applied 314 place count 59 transition count 73
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 388 place count 22 transition count 36
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 397 place count 13 transition count 18
Iterating global reduction 4 with 9 rules applied. Total rules applied 406 place count 13 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 410 place count 11 transition count 17
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 412 place count 11 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 413 place count 10 transition count 16
Applied a total of 413 rules in 31 ms. Remains 10 /235 variables (removed 225) and now considering 16/242 (removed 226) transitions.
[2026-05-25 16:18:23] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7159221774814921893.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11494233806071931403.kers'
[2026-05-25 16:18:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7159221774814921893.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11494233806071931403.kers]
Normalized transition count is 14 out of 15 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 10 cols 34 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 16:18:23] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11494233806071931403.kers
Total runtime 0 ms.
[2026-05-25 16:18:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2026-05-25 16:18:23] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2026-05-25 16:18:23] [INFO ] Invariant cache hit.
[2026-05-25 16:18:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:18:23] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-25 16:18:23] [INFO ] Redundant transitions in 13 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-25 16:18:23] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2026-05-25 16:18:23] [INFO ] Invariant cache hit.
[2026-05-25 16:18:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/24 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/25 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 11 constraints, problems are : Problem set: 0 solved, 9 unsolved in 109 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/24 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 133 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 247ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/235 places, 16/242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 344 ms. Remains : 10/235 places, 16/242 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 275 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-00 finished in 695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((F(G(!p0)) U p1))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 242/242 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 242
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 223 transition count 231
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 223 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 223 transition count 229
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 217 transition count 223
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 217 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 217 transition count 219
Applied a total of 41 rules in 22 ms. Remains 217 /235 variables (removed 18) and now considering 219/242 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4264616250223199811.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17289900458935932545.kers'
[2026-05-25 16:18:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4264616250223199811.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17289900458935932545.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 217 cols 559 entries
Finished phase 1 with 203 SingleSign rule and 1 generalized
[2026-05-25 16:18:24] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17289900458935932545.kers
Total runtime 1 ms.
[2026-05-25 16:18:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 16:18:24] [INFO ] Invariant cache hit.
[2026-05-25 16:18:24] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-25 16:18:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 219/435 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 1/436 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 230 constraints, problems are : Problem set: 0 solved, 218 unsolved in 13923 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 219/435 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 218/447 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 1/436 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 448 constraints, problems are : Problem set: 0 solved, 218 unsolved in 18712 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32665ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 32667ms
Starting structural reductions in LTL mode, iteration 1 : 217/235 places, 219/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32889 ms. Remains : 217/235 places, 219/242 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)&&X((F(G(!p0)) U p1))))'
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), p0]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-01
Product exploration explored 100000 steps with 2038 reset in 271 ms.
Product exploration explored 100000 steps with 2067 reset in 173 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Graph (complete) has 336 edges and 217 vertex of which 201 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Computed a total of 40 stabilizing places and 40 stable transitions
Knowledge based reduction with 5 factoid took 61 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 333 steps (0 resets) in 6 ms. (47 steps per ms) remains 0/1 properties
Knowledge based reduction with 5 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2026-05-25 16:18:57] [INFO ] Invariant cache hit.
[2026-05-25 16:18:58] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2026-05-25 16:18:58] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2026-05-25 16:18:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 16:18:58] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2026-05-25 16:18:58] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2026-05-25 16:18:58] [INFO ] Computed and/alt/rep : 213/279/213 causal constraints (skipped 5 transitions) in 10 ms.
[2026-05-25 16:18:59] [INFO ] Added : 202 causal constraints over 41 iterations in 815 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1448 ms.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 217 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 217/217 places, 219/219 transitions.
Graph (trivial) has 176 edges and 217 vertex of which 6 / 217 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 330 edges and 212 vertex of which 196 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 97 place count 195 transition count 114
Reduce places removed 95 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 100 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 194 place count 99 transition count 113
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 194 place count 99 transition count 85
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 250 place count 71 transition count 85
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 261 place count 60 transition count 74
Iterating global reduction 3 with 11 rules applied. Total rules applied 272 place count 60 transition count 74
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 346 place count 23 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 347 place count 23 transition count 36
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 357 place count 13 transition count 17
Iterating global reduction 4 with 10 rules applied. Total rules applied 367 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 369 place count 12 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 370 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 371 place count 11 transition count 15
Applied a total of 371 rules in 18 ms. Remains 11 /217 variables (removed 206) and now considering 15/219 (removed 204) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7824295078067290578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7974323380393993291.kers'
[2026-05-25 16:18:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7824295078067290578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7974323380393993291.kers]
Normalized transition count is 14 out of 15 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 11 cols 36 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-25 16:18:59] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7974323380393993291.kers
Total runtime 0 ms.
[2026-05-25 16:18:59] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-25 16:18:59] [INFO ] Invariant cache hit.
[2026-05-25 16:18:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:18:59] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-25 16:18:59] [INFO ] Redundant transitions in 11 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-25 16:18:59] [INFO ] Invariant cache hit.
[2026-05-25 16:18:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/25 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/26 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 12 constraints, problems are : Problem set: 0 solved, 9 unsolved in 108 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/25 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/26 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 21 constraints, problems are : Problem set: 0 solved, 9 unsolved in 116 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 230ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 233ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/217 places, 15/219 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 11/217 places, 15/219 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
[2026-05-25 16:18:59] [INFO ] Invariant cache hit.
[2026-05-25 16:18:59] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2026-05-25 16:18:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:18:59] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 16:18:59] [INFO ] Computed and/alt/rep : 9/23/9 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 16:18:59] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 356 ms.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-01 finished in 35915 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||(p1&&G(p2))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 242/242 transitions.
Graph (trivial) has 195 edges and 235 vertex of which 6 / 235 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 355 edges and 230 vertex of which 213 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 112 place count 212 transition count 122
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 119 rules applied. Total rules applied 231 place count 102 transition count 113
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 235 place count 100 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 237 place count 98 transition count 111
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 237 place count 98 transition count 85
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 289 place count 72 transition count 85
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 301 place count 60 transition count 73
Iterating global reduction 4 with 12 rules applied. Total rules applied 313 place count 60 transition count 73
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 385 place count 24 transition count 37
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 393 place count 16 transition count 21
Iterating global reduction 4 with 8 rules applied. Total rules applied 401 place count 16 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 403 place count 15 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 404 place count 14 transition count 19
Applied a total of 404 rules in 20 ms. Remains 14 /235 variables (removed 221) and now considering 19/242 (removed 223) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3202414191717294937.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3859778869347861343.kers'
[2026-05-25 16:19:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3202414191717294937.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3859778869347861343.kers]
Normalized transition count is 18 out of 19 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 18 rows 14 cols 44 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-25 16:19:00] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3859778869347861343.kers
Total runtime 0 ms.
[2026-05-25 16:19:00] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-25 16:19:00] [INFO ] Invariant cache hit.
[2026-05-25 16:19:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:19:00] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2026-05-25 16:19:00] [INFO ] Redundant transitions in 14 ms returned []
Running 13 sub problems to find dead transitions.
[2026-05-25 16:19:00] [INFO ] Invariant cache hit.
[2026-05-25 16:19:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 18/28 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/32 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/33 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/33 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 15 constraints, problems are : Problem set: 0 solved, 13 unsolved in 145 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 18/28 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 4/32 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 28 constraints, problems are : Problem set: 0 solved, 13 unsolved in 150 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 297ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 298ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/235 places, 19/242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 391 ms. Remains : 14/235 places, 19/242 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||(p1&&G(p2))))))'
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-02
Stuttering criterion allowed to conclude after 32 steps with 2 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-02 finished in 549 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(p1||X(p2))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 242/242 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 242
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 223 transition count 231
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 223 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 223 transition count 229
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 217 transition count 223
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 217 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 217 transition count 219
Applied a total of 41 rules in 12 ms. Remains 217 /235 variables (removed 18) and now considering 219/242 (removed 23) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17032311817483754437.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2434803528308762223.kers'
[2026-05-25 16:19:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17032311817483754437.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2434803528308762223.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 217 cols 559 entries
Finished phase 1 with 203 SingleSign rule and 1 generalized
[2026-05-25 16:19:00] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2434803528308762223.kers
Total runtime 1 ms.
[2026-05-25 16:19:00] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 16:19:00] [INFO ] Invariant cache hit.
[2026-05-25 16:19:00] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-25 16:19:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 219/435 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 1/436 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 230 constraints, problems are : Problem set: 0 solved, 218 unsolved in 13645 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (OVERLAPS) 219/435 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 218/447 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/435 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 1/436 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 448 constraints, problems are : Problem set: 0 solved, 218 unsolved in 18470 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32138ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 32139ms
Starting structural reductions in LTL mode, iteration 1 : 217/235 places, 219/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32392 ms. Remains : 217/235 places, 219/242 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(p1||X(p2))))))'
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-03
Product exploration explored 100000 steps with 870 reset in 153 ms.
Stack based approach found an accepted trace after 15400 steps with 141 reset with depth 187 and stack size 187 in 24 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-03 finished in 32763 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)||X((p2||X(X(p0))))))))'
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 242/242 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 242
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 223 transition count 231
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 223 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 223 transition count 229
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 30 place count 218 transition count 224
Iterating global reduction 2 with 5 rules applied. Total rules applied 35 place count 218 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 218 transition count 221
Applied a total of 38 rules in 14 ms. Remains 218 /235 variables (removed 17) and now considering 221/242 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15386646124187210600.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11541395552735338656.kers'
[2026-05-25 16:19:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15386646124187210600.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11541395552735338656.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 218 cols 563 entries
Finished phase 1 with 204 SingleSign rule and 1 generalized
[2026-05-25 16:19:33] [INFO ] Computed 13 invariants in 2 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11541395552735338656.kers
Total runtime 3 ms.
[2026-05-25 16:19:33] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 16:19:33] [INFO ] Invariant cache hit.
[2026-05-25 16:19:33] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-25 16:19:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 221/438 variables, 217/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 1/439 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/439 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 231 constraints, problems are : Problem set: 0 solved, 220 unsolved in 14289 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 221/438 variables, 217/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 220/450 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 1/439 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/439 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 451 constraints, problems are : Problem set: 0 solved, 220 unsolved in 17395 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31703ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 31704ms
Starting structural reductions in LTL mode, iteration 1 : 218/235 places, 221/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31924 ms. Remains : 218/235 places, 221/242 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)||X((p2||X(X(p0))))))))'
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-05
Product exploration explored 100000 steps with 25031 reset in 99 ms.
Product exploration explored 100000 steps with 25032 reset in 104 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 338 edges and 218 vertex of which 202 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge based reduction with 9 factoid took 68 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 39001 steps (341 resets) in 237 ms. (163 steps per ms) remains 0/5 properties
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Knowledge-based reduction took 482 ms.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 5 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 221/221 transitions.
Applied a total of 0 rules in 8 ms. Remains 218 /218 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2026-05-25 16:20:06] [INFO ] Invariant cache hit.
[2026-05-25 16:20:06] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 16:20:06] [INFO ] Invariant cache hit.
[2026-05-25 16:20:06] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 218/218 places, 221/221 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 338 edges and 218 vertex of which 202 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge based reduction with 9 factoid took 72 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
RANDOM walk for 31853 steps (285 resets) in 132 ms. (239 steps per ms) remains 0/5 properties
Knowledge based reduction with 9 factoid took 131 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Knowledge-based reduction took 502 ms.
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 25052 reset in 96 ms.
Product exploration explored 100000 steps with 25084 reset in 101 ms.
Spot run failed in 84 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/ltsmin70226571819571083
[2026-05-25 16:20:08] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin70226571819571083
Running compilation step : cd /tmp/ltsmin70226571819571083;'/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 449 ms.
Running link step : cd /tmp/ltsmin70226571819571083;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin70226571819571083;'/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/stateBased2289788766371248845.hoa' '--buchi-type=spotba'
LTSmin run took 166 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-05 finished in 35448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 2 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 242/242 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 242
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 224 transition count 232
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 224 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 224 transition count 230
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 28 place count 219 transition count 225
Iterating global reduction 2 with 5 rules applied. Total rules applied 33 place count 219 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 219 transition count 222
Applied a total of 36 rules in 12 ms. Remains 219 /235 variables (removed 16) and now considering 222/242 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6396671965207419027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15686154492594570924.kers'
[2026-05-25 16:20:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6396671965207419027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15686154492594570924.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 219 cols 565 entries
Finished phase 1 with 205 SingleSign rule and 1 generalized
[2026-05-25 16:20:08] [INFO ] Computed 13 invariants in 2 ms
Computed 13 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-15686154492594570924.kers
Total runtime 7 ms.
[2026-05-25 16:20:08] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 16:20:08] [INFO ] Invariant cache hit.
[2026-05-25 16:20:09] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-25 16:20:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 222/440 variables, 218/231 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 1/441 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 0/441 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 232 constraints, problems are : Problem set: 0 solved, 221 unsolved in 14296 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (OVERLAPS) 222/440 variables, 218/231 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 221/452 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 1/441 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/441 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 441/441 variables, and 453 constraints, problems are : Problem set: 0 solved, 221 unsolved in 18445 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32766ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 32767ms
Starting structural reductions in LTL mode, iteration 1 : 219/235 places, 222/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33001 ms. Remains : 219/235 places, 222/242 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Stuttering acceptance computed with spot in 198 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-07 finished in 33233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 242/242 transitions.
Graph (trivial) has 201 edges and 235 vertex of which 6 / 235 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 355 edges and 230 vertex of which 213 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 212 transition count 119
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 122 rules applied. Total rules applied 237 place count 99 transition count 110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 240 place count 96 transition count 110
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 240 place count 96 transition count 85
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 290 place count 71 transition count 85
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 302 place count 59 transition count 73
Iterating global reduction 3 with 12 rules applied. Total rules applied 314 place count 59 transition count 73
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 390 place count 21 transition count 35
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 400 place count 11 transition count 15
Iterating global reduction 3 with 10 rules applied. Total rules applied 410 place count 11 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 414 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 415 place count 8 transition count 13
Applied a total of 415 rules in 17 ms. Remains 8 /235 variables (removed 227) and now considering 13/242 (removed 229) transitions.
[2026-05-25 16:20:42] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4405638869208313761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8777180295486534264.kers'
[2026-05-25 16:20:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4405638869208313761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8777180295486534264.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 8 cols 26 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-25 16:20:42] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8777180295486534264.kers
Total runtime 0 ms.
[2026-05-25 16:20:42] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 16:20:42] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2026-05-25 16:20:42] [INFO ] Invariant cache hit.
[2026-05-25 16:20:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:20:42] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2026-05-25 16:20:42] [INFO ] Redundant transitions in 11 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-25 16:20:42] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2026-05-25 16:20:42] [INFO ] Invariant cache hit.
[2026-05-25 16:20:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 68 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/19 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 78 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 148ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 148ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/235 places, 13/242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 230 ms. Remains : 8/235 places, 13/242 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-09 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p1)))))'
Support contains 15 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 242/242 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 223 transition count 230
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 223 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 223 transition count 228
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 217 transition count 222
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 217 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 42 place count 217 transition count 218
Applied a total of 42 rules in 11 ms. Remains 217 /235 variables (removed 18) and now considering 218/242 (removed 24) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13477272841940828666.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17669973304723653573.kers'
[2026-05-25 16:20:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13477272841940828666.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17669973304723653573.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 218 rows 216 cols 557 entries
Finished phase 1 with 202 SingleSign rule and 1 generalized
[2026-05-25 16:20:42] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17669973304723653573.kers
Total runtime 4 ms.
[2026-05-25 16:20:42] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-25 16:20:42] [INFO ] Invariant cache hit.
[2026-05-25 16:20:42] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-25 16:20:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/434 variables, 216/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 1/435 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/435 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/435 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 231 constraints, problems are : Problem set: 0 solved, 217 unsolved in 13685 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/434 variables, 216/230 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 217/447 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 1/435 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/435 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/435 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 448 constraints, problems are : Problem set: 0 solved, 217 unsolved in 15206 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28908ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 28910ms
Starting structural reductions in LTL mode, iteration 1 : 217/235 places, 218/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29102 ms. Remains : 217/235 places, 218/242 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&p1))))'
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 90 ms.
Product exploration explored 100000 steps with 33333 reset in 100 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 337 edges and 217 vertex of which 200 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/217 stabilizing places and 39/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 15 ms. Proved property starting from automaton with 3 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-10 finished in 29478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1)) U (F(p2) U p3)))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 242/242 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 242
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 224 transition count 232
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 224 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 224 transition count 230
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 27 place count 220 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 220 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 220 transition count 223
Applied a total of 34 rules in 12 ms. Remains 220 /235 variables (removed 15) and now considering 223/242 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12926213886923158618.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9082312458876631724.kers'
[2026-05-25 16:21:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12926213886923158618.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9082312458876631724.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 223 rows 220 cols 567 entries
Finished phase 1 with 206 SingleSign rule and 1 generalized
[2026-05-25 16:21:11] [INFO ] Computed 13 invariants in 2 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9082312458876631724.kers
Total runtime 3 ms.
[2026-05-25 16:21:11] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 16:21:11] [INFO ] Invariant cache hit.
[2026-05-25 16:21:12] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2026-05-25 16:21:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 223/442 variables, 219/232 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 1/443 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (OVERLAPS) 0/443 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 233 constraints, problems are : Problem set: 0 solved, 222 unsolved in 14332 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/219 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 223/442 variables, 219/232 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 222/454 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 1/443 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 455 constraints, problems are : Problem set: 0 solved, 222 unsolved in 19348 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33700ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 33701ms
Starting structural reductions in LTL mode, iteration 1 : 220/235 places, 223/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33932 ms. Remains : 220/235 places, 223/242 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1)) U (F(p2) U p3)))'
Stuttering acceptance computed with spot in 436 ms :[(NOT p3), (AND p3 (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-11
Product exploration explored 100000 steps with 2597 reset in 119 ms.
Product exploration explored 100000 steps with 2761 reset in 128 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 340 edges and 220 vertex of which 204 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/220 stabilizing places and 39/223 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 43 factoid took 101 ms. Reduced automaton from 9 states, 24 edges and 4 AP (stutter sensitive) to 8 states, 23 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (353 resets) in 485 ms. (82 steps per ms) remains 2/20 properties
BEST_FIRST walk for 40003 steps (47 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (46 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
[2026-05-25 16:21:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 215/219 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 223/442 variables, 219/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/443 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 233 constraints, problems are : Problem set: 0 solved, 2 unsolved in 248 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 215/219 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 223/442 variables, 219/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/443 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 235 constraints, problems are : Problem set: 0 solved, 2 unsolved in 213 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 464ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 4936 steps, including 90 resets, run visited all 2 properties in 46 ms. (steps per millisecond=107 )
Parikh walk visited 2 properties in 50 ms.
Knowledge based reduction with 43 factoid took 393 ms. Reduced automaton from 8 states, 23 edges and 4 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), false, false, false]
[2026-05-25 16:21:48] [INFO ] Invariant cache hit.
[2026-05-25 16:21:48] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2026-05-25 16:21:48] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2026-05-25 16:21:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 16:21:48] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2026-05-25 16:21:48] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2026-05-25 16:21:48] [INFO ] Computed and/alt/rep : 217/287/217 causal constraints (skipped 5 transitions) in 12 ms.
[2026-05-25 16:21:49] [INFO ] Added : 199 causal constraints over 40 iterations in 693 ms. Result :sat
Could not prove EG (NOT p2)
[2026-05-25 16:21:49] [INFO ] Invariant cache hit.
[2026-05-25 16:21:49] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 3 ms returned sat
[2026-05-25 16:21:49] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2026-05-25 16:21:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 16:21:49] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 3 ms returned sat
[2026-05-25 16:21:49] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2026-05-25 16:21:49] [INFO ] Computed and/alt/rep : 217/287/217 causal constraints (skipped 5 transitions) in 15 ms.
[2026-05-25 16:21:50] [INFO ] Added : 212 causal constraints over 43 iterations in 809 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 3869 ms.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), false, false, false]
Support contains 2 out of 220 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 220/220 places, 223/223 transitions.
Graph (trivial) has 176 edges and 220 vertex of which 6 / 220 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 334 edges and 215 vertex of which 199 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 198 transition count 119
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 191 place count 104 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 192 place count 103 transition count 118
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 192 place count 103 transition count 91
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 246 place count 76 transition count 91
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 257 place count 65 transition count 80
Iterating global reduction 3 with 11 rules applied. Total rules applied 268 place count 65 transition count 80
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 342 place count 28 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 343 place count 28 transition count 42
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 353 place count 18 transition count 23
Iterating global reduction 4 with 10 rules applied. Total rules applied 363 place count 18 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 367 place count 16 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 368 place count 15 transition count 21
Applied a total of 368 rules in 16 ms. Remains 15 /220 variables (removed 205) and now considering 21/223 (removed 202) transitions.
[2026-05-25 16:21:50] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17002922518264294839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15305711797688748318.kers'
[2026-05-25 16:21:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17002922518264294839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15305711797688748318.kers]
Normalized transition count is 19 out of 20 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 19 rows 15 cols 46 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-25 16:21:50] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15305711797688748318.kers
Total runtime 0 ms.
[2026-05-25 16:21:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 16:21:50] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
[2026-05-25 16:21:50] [INFO ] Invariant cache hit.
[2026-05-25 16:21:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:21:50] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2026-05-25 16:21:50] [INFO ] Redundant transitions in 12 ms returned []
Running 13 sub problems to find dead transitions.
[2026-05-25 16:21:50] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
[2026-05-25 16:21:50] [INFO ] Invariant cache hit.
[2026-05-25 16:21:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/34 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/35 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 16 constraints, problems are : Problem set: 0 solved, 13 unsolved in 141 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 19/30 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 4/34 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 29 constraints, problems are : Problem set: 0 solved, 13 unsolved in 184 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 328ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 328ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/220 places, 21/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 415 ms. Remains : 15/220 places, 21/223 transitions.
Computed a total of 4 stabilizing places and 6 stable transitions
Computed a total of 4 stabilizing places and 6 stable transitions
Detected a total of 4/15 stabilizing places and 6/21 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
RANDOM walk for 144 steps (4 resets) in 7 ms. (18 steps per ms) remains 0/6 properties
Knowledge based reduction with 6 factoid took 346 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), false, false, false]
[2026-05-25 16:21:51] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
[2026-05-25 16:21:51] [INFO ] Invariant cache hit.
[2026-05-25 16:21:52] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2026-05-25 16:21:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:21:52] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 16:21:52] [INFO ] Computed and/alt/rep : 13/24/13 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 16:21:52] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p2)
[2026-05-25 16:21:52] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
[2026-05-25 16:21:52] [INFO ] Invariant cache hit.
[2026-05-25 16:21:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 16:21:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 16:21:52] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2026-05-25 16:21:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:21:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 16:21:52] [INFO ] Computed and/alt/rep : 13/24/13 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 16:21:52] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p3)
Knowledge-based reduction took 995 ms.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), false, false, false]
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p2) (NOT p3)), (NOT p2), (NOT p3), false, false, false]
Stuttering criterion allowed to conclude after 22 steps with 5 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-11 finished in 40735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((X(X(p1)) U ((X(X(p1))&&G(p2))||X(X(G(p1)))))))))'
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 242/242 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 242
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 224 transition count 232
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 224 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 224 transition count 230
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 29 place count 218 transition count 224
Iterating global reduction 2 with 6 rules applied. Total rules applied 35 place count 218 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 218 transition count 220
Applied a total of 39 rules in 7 ms. Remains 218 /235 variables (removed 17) and now considering 220/242 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2915197686155543295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3411907761413597960.kers'
[2026-05-25 16:21:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2915197686155543295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3411907761413597960.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 218 cols 561 entries
Finished phase 1 with 204 SingleSign rule and 1 generalized
[2026-05-25 16:21:52] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3411907761413597960.kers
Total runtime 2 ms.
[2026-05-25 16:21:52] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 16:21:52] [INFO ] Invariant cache hit.
[2026-05-25 16:21:52] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-25 16:21:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 220/437 variables, 217/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 1/438 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/438 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 231 constraints, problems are : Problem set: 0 solved, 219 unsolved in 14360 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 220/437 variables, 217/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 219/449 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 1/438 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/438 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 438/438 variables, and 450 constraints, problems are : Problem set: 0 solved, 219 unsolved in 19846 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34223ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 34229ms
Starting structural reductions in LTL mode, iteration 1 : 218/235 places, 220/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34440 ms. Remains : 218/235 places, 220/242 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((X(X(p1)) U ((X(X(p1))&&G(p2))||X(X(G(p1)))))))))'
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 4854 steps with 76 reset in 16 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-12 finished in 34882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!((p0 U p1) U p2)) U p3))'
Support contains 19 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 242/242 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 224 transition count 231
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 224 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 224 transition count 229
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 219 transition count 224
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 219 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 37 place count 219 transition count 221
Applied a total of 37 rules in 18 ms. Remains 219 /235 variables (removed 16) and now considering 221/242 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1793310227169518648.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12635065261660412980.kers'
[2026-05-25 16:22:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1793310227169518648.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12635065261660412980.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 221 rows 218 cols 563 entries
Finished phase 1 with 204 SingleSign rule and 1 generalized
[2026-05-25 16:22:27] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12635065261660412980.kers
Total runtime 1 ms.
[2026-05-25 16:22:27] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-25 16:22:27] [INFO ] Invariant cache hit.
[2026-05-25 16:22:27] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-25 16:22:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 221/439 variables, 218/232 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 1/440 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/440 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 233 constraints, problems are : Problem set: 0 solved, 220 unsolved in 14200 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/218 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 221/439 variables, 218/232 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 220/452 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 1/440 variables, 1/453 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 453 constraints, problems are : Problem set: 0 solved, 220 unsolved in 18282 ms.
Refiners :[Generalized P Invariants (flows): 14/14 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32497ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 32498ms
Starting structural reductions in LTL mode, iteration 1 : 219/235 places, 221/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32689 ms. Remains : 219/235 places, 221/242 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!((p0 U p1) U p2)) U p3))'
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p3), p2, (AND p1 p2), p1, (OR (NOT p3) p2)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-13
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-13 finished in 32957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 242/242 transitions.
Graph (trivial) has 201 edges and 235 vertex of which 6 / 235 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 355 edges and 230 vertex of which 213 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 115 place count 212 transition count 119
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 123 rules applied. Total rules applied 238 place count 99 transition count 109
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 241 place count 96 transition count 109
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 241 place count 96 transition count 82
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 295 place count 69 transition count 82
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 306 place count 58 transition count 71
Iterating global reduction 3 with 11 rules applied. Total rules applied 317 place count 58 transition count 71
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 395 place count 19 transition count 32
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 406 place count 8 transition count 10
Iterating global reduction 3 with 11 rules applied. Total rules applied 417 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 418 place count 7 transition count 9
Applied a total of 418 rules in 14 ms. Remains 7 /235 variables (removed 228) and now considering 9/242 (removed 233) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2409722248672292185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8476542230356306771.kers'
[2026-05-25 16:23:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2409722248672292185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8476542230356306771.kers]
Normalized transition count is 8 out of 9 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 8 rows 7 cols 16 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-25 16:23:00] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8476542230356306771.kers
Total runtime 0 ms.
[2026-05-25 16:23:00] [INFO ] Implicit Places using invariants in 27 ms returned []
[2026-05-25 16:23:00] [INFO ] Invariant cache hit.
[2026-05-25 16:23:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-25 16:23:00] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2026-05-25 16:23:00] [INFO ] Redundant transitions in 10 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-25 16:23:00] [INFO ] Invariant cache hit.
[2026-05-25 16:23:00] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/15 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 11 constraints, problems are : Problem set: 0 solved, 7 unsolved in 77 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/15 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/16 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 18 constraints, problems are : Problem set: 0 solved, 7 unsolved in 96 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 176ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 176ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/235 places, 9/242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 7/235 places, 9/242 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 37 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-14
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-14 finished in 316 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(((G((p0||G(p1))) U G(p2))||X(X(F(p3))))))'
Support contains 4 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 242/242 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 242
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 222 transition count 230
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 222 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 222 transition count 228
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 32 place count 217 transition count 223
Iterating global reduction 2 with 5 rules applied. Total rules applied 37 place count 217 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 217 transition count 220
Applied a total of 40 rules in 13 ms. Remains 217 /235 variables (removed 18) and now considering 220/242 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13313620988978501933.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12538153646729094479.kers'
[2026-05-25 16:23:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13313620988978501933.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12538153646729094479.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 217 cols 561 entries
Finished phase 1 with 203 SingleSign rule and 1 generalized
[2026-05-25 16:23:00] [INFO ] Computed 13 invariants in 2 ms
Computed 13 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12538153646729094479.kers
Total runtime 3 ms.
[2026-05-25 16:23:00] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 16:23:00] [INFO ] Invariant cache hit.
[2026-05-25 16:23:01] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-25 16:23:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 220/436 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 1/437 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 230 constraints, problems are : Problem set: 0 solved, 219 unsolved in 14188 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/216 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 220/436 variables, 216/229 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 219/448 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 1/437 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 449 constraints, problems are : Problem set: 0 solved, 219 unsolved in 17327 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31533ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 31534ms
Starting structural reductions in LTL mode, iteration 1 : 217/235 places, 220/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31763 ms. Remains : 217/235 places, 220/242 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(((G((p0||G(p1))) U G(p2))||X(X(F(p3))))))'
Stuttering acceptance computed with spot in 592 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p3) p2 (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) p0 (NOT p1)), (NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (AND (NOT p3) p2 (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1) p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-15
Product exploration explored 100000 steps with 30018 reset in 115 ms.
Product exploration explored 100000 steps with 30079 reset in 121 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 337 edges and 217 vertex of which 201 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/217 stabilizing places and 39/220 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 39 factoid took 256 ms. Reduced automaton from 13 states, 44 edges and 4 AP (stutter sensitive) to 13 states, 44 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (360 resets) in 422 ms. (94 steps per ms) remains 20/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
[2026-05-25 16:23:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 213/217 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
Problem apf10 is UNSAT
Problem apf18 is UNSAT
Problem apf21 is UNSAT
Problem apf24 is UNSAT
Problem apf26 is UNSAT
Problem apf28 is UNSAT
At refinement iteration 3 (OVERLAPS) 220/437 variables, 217/230 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/230 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/437 variables, 0/230 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 230 constraints, problems are : Problem set: 10 solved, 10 unsolved in 477 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 213/217 variables, 13/13 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/13 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 220/437 variables, 217/230 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 10/240 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/240 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/240 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 240 constraints, problems are : Problem set: 10 solved, 10 unsolved in 701 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 217/217 constraints, PredecessorRefiner: 10/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1185ms problems are : Problem set: 10 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Finished Parikh walk after 168 steps, including 1 resets, run visited all 10 properties in 7 ms. (steps per millisecond=24 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 8 ms.
Found 10 invariant AP formulas.
Knowledge based reduction with 49 factoid took 742 ms. Reduced automaton from 13 states, 44 edges and 4 AP (stutter sensitive) to 11 states, 29 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 513 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p1) p2 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND p0 (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1) p2), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Knowledge-based reduction took 3018 ms.
Stuttering acceptance computed with spot in 460 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p1) p2 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND p0 (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1) p2), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Support contains 4 out of 217 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 220/220 transitions.
Applied a total of 0 rules in 4 ms. Remains 217 /217 variables (removed 0) and now considering 220/220 (removed 0) transitions.
[2026-05-25 16:23:36] [INFO ] Invariant cache hit.
[2026-05-25 16:23:36] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 16:23:36] [INFO ] Invariant cache hit.
[2026-05-25 16:23:37] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 217/217 places, 220/220 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 337 edges and 217 vertex of which 201 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/217 stabilizing places and 39/220 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge based reduction with 21 factoid took 213 ms. Reduced automaton from 11 states, 29 edges and 4 AP (stutter sensitive) to 11 states, 29 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (347 resets) in 259 ms. (153 steps per ms) remains 6/19 properties
BEST_FIRST walk for 40003 steps (45 resets) in 83 ms. (476 steps per ms) remains 1/6 properties
BEST_FIRST walk for 34818 steps (46 resets) in 55 ms. (621 steps per ms) remains 0/1 properties
Knowledge based reduction with 21 factoid took 580 ms. Reduced automaton from 11 states, 29 edges and 4 AP (stutter sensitive) to 11 states, 29 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 452 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p1) p2 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND p0 (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1) p2), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Knowledge-based reduction took 1383 ms.
Stuttering acceptance computed with spot in 425 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p1) p2 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND p0 (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1) p2), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 497 ms :[(OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p1) p2 (NOT p3)), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), (AND p0 (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1) p2), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 29987 reset in 110 ms.
Product exploration explored 100000 steps with 30017 reset in 114 ms.
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/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/ltsmin1734471502562496459
[2026-05-25 16:23:39] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1734471502562496459
Running compilation step : cd /tmp/ltsmin1734471502562496459;'/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 336 ms.
Running link step : cd /tmp/ltsmin1734471502562496459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1734471502562496459;'/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/stateBased10588144439352431785.hoa' '--buchi-type=spotba'
LTSmin run took 97 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-15 finished in 39471 ms.
All properties solved by simple procedures.
Total runtime 364640 ms.
BK_STOP 1779726220306
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-12b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-12b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074200420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-12b.tgz
mv GPUForwardProgress-PT-12b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;