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-177961074200419.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074200419
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-12b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779725569995

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
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
LTLCardinality PT
Running Version 202604301425
[2026-05-25 16:12:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 16:12:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 16:12:51] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2026-05-25 16:12:51] [INFO ] Transformed 264 places.
[2026-05-25 16:12:51] [INFO ] Transformed 277 transitions.
[2026-05-25 16:12:51] [INFO ] Found NUPN structural information;
[2026-05-25 16:12:51] [INFO ] Parsed PT model containing 264 places and 277 transitions and 677 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 277/277 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 263 transition count 277
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 237 transition count 251
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 237 transition count 251
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 64 place count 226 transition count 240
Iterating global reduction 1 with 11 rules applied. Total rules applied 75 place count 226 transition count 240
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 84 place count 226 transition count 231
Applied a total of 84 rules in 73 ms. Remains 226 /264 variables (removed 38) and now considering 231/277 (removed 46) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13682775400398251433.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7374175378133740958.kers'
[2026-05-25 16:12:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13682775400398251433.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7374175378133740958.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 231 rows 226 cols 583 entries
Finished phase 1 with 212 SingleSign rule and 1 generalized
[2026-05-25 16:12:51] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7374175378133740958.kers
Total runtime 2 ms.
[2026-05-25 16:12:51] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-25 16:12:51] [INFO ] Invariant cache hit.
[2026-05-25 16:12:51] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 230 sub problems to find dead transitions.
[2026-05-25 16:12:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 231/456 variables, 225/238 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 1/457 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 239 constraints, problems are : Problem set: 0 solved, 230 unsolved in 16061 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 231/456 variables, 225/238 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 230/468 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 1/457 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 469 constraints, problems are : Problem set: 0 solved, 230 unsolved in 17029 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33162ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 33181ms
Starting structural reductions in LTL mode, iteration 1 : 226/264 places, 231/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33765 ms. Remains : 226/264 places, 231/277 transitions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 231/231 transitions.
Applied a total of 0 rules in 6 ms. Remains 226 /226 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2026-05-25 16:13:25] [INFO ] Invariant cache hit.
[2026-05-25 16:13:25] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 16:13:25] [INFO ] Invariant cache hit.
[2026-05-25 16:13:25] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 226/226 places, 231/231 transitions.
Support contains 32 out of 226 places after structural reductions.
[2026-05-25 16:13:25] [INFO ] Flatten gal took : 35 ms
[2026-05-25 16:13:25] [INFO ] Flatten gal took : 19 ms
[2026-05-25 16:13:25] [INFO ] Input system was already deterministic with 231 transitions.
Support contains 28 out of 226 places (down from 32) after GAL structural reductions.
RANDOM walk for 40000 steps (359 resets) in 997 ms. (40 steps per ms) remains 2/20 properties
BEST_FIRST walk for 40004 steps (50 resets) in 108 ms. (367 steps per ms) remains 1/2 properties
BEST_FIRST walk for 25911 steps (27 resets) in 57 ms. (446 steps per ms) remains 0/1 properties
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 44 stabilizing places and 44 stable transitions
Graph (complete) has 348 edges and 226 vertex of which 210 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||G(!p1)) U X(X(p2))))'
Support contains 6 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 231/231 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 221 transition count 226
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 221 transition count 226
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 218 transition count 223
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 218 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 218 transition count 221
Applied a total of 18 rules in 20 ms. Remains 218 /226 variables (removed 8) and now considering 221/231 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4616192927089460124.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10397134719571721014.kers'
[2026-05-25 16:13:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4616192927089460124.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10397134719571721014.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:13:26] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10397134719571721014.kers
Total runtime 1 ms.
[2026-05-25 16:13:26] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-25 16:13:26] [INFO ] Invariant cache hit.
[2026-05-25 16:13:26] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-25 16:13:26] [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 14073 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 17402 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 31503ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 31504ms
Starting structural reductions in LTL mode, iteration 1 : 218/226 places, 221/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31725 ms. Remains : 218/226 places, 221/231 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||G(!p1)) U X(X(p2))))'
Stuttering acceptance computed with spot in 562 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) p1), (NOT p2), true, (NOT p2), (AND (NOT p2) p1), (NOT p2), (AND p1 (NOT p2)), p1]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLCardinality-00
Product exploration explored 100000 steps with 33333 reset in 265 ms.
Product exploration explored 100000 steps with 33333 reset in 141 ms.
Computed a total of 40 stabilizing places and 40 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.4 ms
Computed a total of 40 stabilizing places and 40 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 14 factoid took 19 ms. Proved property starting from automaton with 11 states, 21 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 31 ms.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-12b-LTLCardinality-00 finished in 32824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((((p1&&X(G(p2))) U p3)&&p0)))))'
Support contains 5 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 231/231 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 220 transition count 225
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 220 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 220 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 217 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 217 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 217 transition count 219
Applied a total of 21 rules in 20 ms. Remains 217 /226 variables (removed 9) and now considering 219/231 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3360891940624307350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16710124324224433410.kers'
[2026-05-25 16:13:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3360891940624307350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16710124324224433410.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:13:59] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16710124324224433410.kers
Total runtime 2 ms.
[2026-05-25 16:13:59] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-25 16:13:59] [INFO ] Invariant cache hit.
[2026-05-25 16:13:59] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-25 16:13:59] [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 13584 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 18807 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 32412ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 32417ms
Starting structural reductions in LTL mode, iteration 1 : 217/226 places, 219/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32748 ms. Remains : 217/226 places, 219/231 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((((p1&&X(G(p2))) U p3)&&p0)))))'
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLCardinality-02 finished in 33005 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 226 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 226/226 places, 231/231 transitions.
Graph (trivial) has 192 edges and 226 vertex of which 6 / 226 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 220 transition count 117
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 111 rules applied. Total rules applied 219 place count 113 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 220 place count 112 transition count 113
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 220 place count 112 transition count 84
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 278 place count 83 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 279 place count 82 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 280 place count 82 transition count 83
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 354 place count 45 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 355 place count 45 transition count 45
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 356 place count 44 transition count 44
Iterating global reduction 4 with 1 rules applied. Total rules applied 357 place count 44 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
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 361 place count 42 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 362 place count 41 transition count 52
Applied a total of 362 rules in 40 ms. Remains 41 /226 variables (removed 185) and now considering 52/231 (removed 179) transitions.
[2026-05-25 16:14:32] [INFO ] Flow matrix only has 41 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12241757694088663175.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8871710660732650399.kers'
[2026-05-25 16:14:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12241757694088663175.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8871710660732650399.kers]
Normalized transition count is 40 out of 41 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 40 rows 41 cols 140 entries
Finished phase 1 with 27 SingleSign rule and 1 generalized
[2026-05-25 16:14:32] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8871710660732650399.kers
Total runtime 4 ms.
[2026-05-25 16:14:32] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 16:14:32] [INFO ] Flow matrix only has 41 transitions (discarded 11 similar events)
[2026-05-25 16:14:32] [INFO ] Invariant cache hit.
[2026-05-25 16:14:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 16:14:32] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2026-05-25 16:14:32] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2026-05-25 16:14:32] [INFO ] Flow matrix only has 41 transitions (discarded 11 similar events)
[2026-05-25 16:14:32] [INFO ] Invariant cache hit.
[2026-05-25 16:14:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 12/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 40/81 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1/82 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 55 constraints, problems are : Problem set: 0 solved, 27 unsolved in 696 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 12/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 40/81 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 27/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 1/82 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 82 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1030 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1740ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 1740ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/226 places, 52/231 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1912 ms. Remains : 41/226 places, 52/231 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 33 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLCardinality-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLCardinality-03 finished in 1970 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((X(p0) U (p0&&G(p1))))))'
Support contains 2 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 231/231 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 219 transition count 224
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 219 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 219 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 216 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 216 transition count 220
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 216 transition count 218
Applied a total of 23 rules in 15 ms. Remains 216 /226 variables (removed 10) and now considering 218/231 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7794176701072573647.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11803402341147512030.kers'
[2026-05-25 16:14:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7794176701072573647.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11803402341147512030.kers]
Culled 0 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:14:34] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11803402341147512030.kers
Total runtime 3 ms.
[2026-05-25 16:14:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 16:14:34] [INFO ] Invariant cache hit.
[2026-05-25 16:14:34] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-25 16:14:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 1/434 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 229 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14046 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 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/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 217/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 1/434 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 446 constraints, problems are : Problem set: 0 solved, 217 unsolved in 17675 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31739ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 31740ms
Starting structural reductions in LTL mode, iteration 1 : 216/226 places, 218/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31956 ms. Remains : 216/226 places, 218/231 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((X(p0) U (p0&&G(p1))))))'
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLCardinality-05
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLCardinality-05 finished in 32145 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(X((X(p0) U p1))))'
Support contains 1 out of 226 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 231/231 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 220 transition count 225
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 220 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 220 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 218 transition count 222
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 218 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 218 transition count 220
Applied a total of 19 rules in 10 ms. Remains 218 /226 variables (removed 8) and now considering 220/231 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11805360660824473559.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6768047313249017188.kers'
[2026-05-25 16:15:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11805360660824473559.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6768047313249017188.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:15:06] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6768047313249017188.kers
Total runtime 1 ms.
[2026-05-25 16:15:06] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-25 16:15:06] [INFO ] Invariant cache hit.
[2026-05-25 16:15:06] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-25 16:15:06] [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 14025 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 17857 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 31904ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 31904ms
Starting structural reductions in LTL mode, iteration 1 : 218/226 places, 220/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32114 ms. Remains : 218/226 places, 220/231 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(p0) U p1))))'
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLCardinality-06
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLCardinality-06 finished in 32219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(p0) U p1))) U (p1 U G(p2))))'
Support contains 6 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 231/231 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 219 transition count 224
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 219 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 219 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 216 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 216 transition count 220
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 216 transition count 218
Applied a total of 23 rules in 10 ms. Remains 216 /226 variables (removed 10) and now considering 218/231 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2973987216341612541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15003416873243936195.kers'
[2026-05-25 16:15:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2973987216341612541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15003416873243936195.kers]
Culled 0 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:15:38] [INFO ] Computed 13 invariants in 1 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15003416873243936195.kers
Total runtime 1 ms.
[2026-05-25 16:15:38] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 16:15:38] [INFO ] Invariant cache hit.
[2026-05-25 16:15:38] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2026-05-25 16:15:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 1/434 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 229 constraints, problems are : Problem set: 0 solved, 217 unsolved in 13601 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 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/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 217/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 1/434 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 446 constraints, problems are : Problem set: 0 solved, 217 unsolved in 17693 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31311ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 31312ms
Starting structural reductions in LTL mode, iteration 1 : 216/226 places, 218/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31518 ms. Remains : 216/226 places, 218/231 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((F(p0) U p1))) U (p1 U G(p2))))'
Stuttering acceptance computed with spot in 323 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLCardinality-12
Product exploration explored 100000 steps with 24960 reset in 114 ms.
Product exploration explored 100000 steps with 25000 reset in 108 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 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/216 stabilizing places and 39/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 16 factoid took 89 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (358 resets) in 385 ms. (103 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40003 steps (61 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (60 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (58 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (58 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
[2026-05-25 16:16:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 179/185 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/215 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/434 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 229 constraints, problems are : Problem set: 0 solved, 4 unsolved in 197 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 179/185 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/215 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/434 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/434 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 233 constraints, problems are : Problem set: 0 solved, 4 unsolved in 407 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 608ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 100 ms.
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 218/218 transitions.
Graph (trivial) has 172 edges and 216 vertex of which 6 / 216 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 328 edges and 211 vertex of which 195 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 195 transition count 114
Reduce places removed 92 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 95 rules applied. Total rules applied 191 place count 103 transition count 111
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 194 place count 100 transition count 111
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 194 place count 100 transition count 84
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 248 place count 73 transition count 84
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 261 place count 60 transition count 71
Iterating global reduction 3 with 13 rules applied. Total rules applied 274 place count 60 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 274 place count 60 transition count 70
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 276 place count 59 transition count 70
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 340 place count 27 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 59 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 342 place count 26 transition count 37
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 343 place count 26 transition count 36
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 352 place count 17 transition count 18
Iterating global reduction 5 with 9 rules applied. Total rules applied 361 place count 17 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 364 place count 15 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 20 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 14 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 367 place count 14 transition count 15
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 368 place count 14 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 369 place count 14 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 370 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 8 with 4 rules applied. Total rules applied 374 place count 12 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 376 place count 10 transition count 10
Applied a total of 376 rules in 18 ms. Remains 10 /216 variables (removed 206) and now considering 10/218 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 10/216 places, 10/218 transitions.
RANDOM walk for 26681 steps (6 resets) in 47 ms. (555 steps per ms) remains 0/2 properties
Knowledge based reduction with 16 factoid took 216 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 1683 ms.
Stuttering acceptance computed with spot in 308 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Applied a total of 0 rules in 2 ms. Remains 216 /216 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2026-05-25 16:16:12] [INFO ] Invariant cache hit.
[2026-05-25 16:16:12] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 16:16:12] [INFO ] Invariant cache hit.
[2026-05-25 16:16:12] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 216/216 places, 218/218 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 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/216 stabilizing places and 39/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 16 factoid took 88 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (351 resets) in 145 ms. (273 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (59 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (59 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (60 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (66 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
[2026-05-25 16:16:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 179/185 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/215 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/434 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/434 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 229 constraints, problems are : Problem set: 0 solved, 4 unsolved in 181 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 179/185 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/215 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 218/433 variables, 215/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/434 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/434 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 233 constraints, problems are : Problem set: 0 solved, 4 unsolved in 406 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 607ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 216/216 places, 218/218 transitions.
Graph (trivial) has 172 edges and 216 vertex of which 6 / 216 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 328 edges and 211 vertex of which 195 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 195 transition count 114
Reduce places removed 92 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 95 rules applied. Total rules applied 191 place count 103 transition count 111
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 194 place count 100 transition count 111
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 194 place count 100 transition count 84
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 248 place count 73 transition count 84
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 261 place count 60 transition count 71
Iterating global reduction 3 with 13 rules applied. Total rules applied 274 place count 60 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 274 place count 60 transition count 70
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 276 place count 59 transition count 70
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 340 place count 27 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 59 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 342 place count 26 transition count 37
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 343 place count 26 transition count 36
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 352 place count 17 transition count 18
Iterating global reduction 5 with 9 rules applied. Total rules applied 361 place count 17 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 364 place count 15 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 20 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 366 place count 14 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 367 place count 14 transition count 15
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 368 place count 14 transition count 15
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 369 place count 14 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 370 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 8 with 4 rules applied. Total rules applied 374 place count 12 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 376 place count 10 transition count 10
Applied a total of 376 rules in 14 ms. Remains 10 /216 variables (removed 206) and now considering 10/218 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 10/216 places, 10/218 transitions.
RANDOM walk for 36677 steps (8 resets) in 56 ms. (643 steps per ms) remains 0/4 properties
Knowledge based reduction with 16 factoid took 179 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 1450 ms.
Stuttering acceptance computed with spot in 303 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 310 ms :[(NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 24960 reset in 103 ms.
Product exploration explored 100000 steps with 25091 reset in 106 ms.
Spot run failed in 77 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/ltsmin10594266865573924399
[2026-05-25 16:16:15] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10594266865573924399
Running compilation step : cd /tmp/ltsmin10594266865573924399;'/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 488 ms.
Running link step : cd /tmp/ltsmin10594266865573924399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin10594266865573924399;'/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/stateBased6965406098960725868.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Applied a total of 0 rules in 8 ms. Remains 216 /216 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2026-05-25 16:16:30] [INFO ] Invariant cache hit.
[2026-05-25 16:16:30] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-25 16:16:30] [INFO ] Invariant cache hit.
[2026-05-25 16:16:30] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 216/216 places, 218/218 transitions.
Built C files in :
/tmp/ltsmin8212110723462284489
[2026-05-25 16:16:30] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8212110723462284489
Running compilation step : cd /tmp/ltsmin8212110723462284489;'/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 312 ms.
Running link step : cd /tmp/ltsmin8212110723462284489;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8212110723462284489;'/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/stateBased14859097642015797044.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 16:16:45] [INFO ] Flatten gal took : 10 ms
[2026-05-25 16:16:45] [INFO ] Flatten gal took : 9 ms
[2026-05-25 16:16:45] [INFO ] Time to serialize gal into /tmp/LTL7561886424986898446.gal : 3 ms
[2026-05-25 16:16:45] [INFO ] Time to serialize properties into /tmp/LTL1028756181200281565.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7561886424986898446.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3459988653514089505.hoa' '-atoms' '/tmp/LTL1028756181200281565.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((X(X((F("((p91==0)||(p85==1))"))U("((p224==0)||(p225==1))"))))U(("((p224==0)||(p225==1))")U(G("((p67==0)||(p11==1))")))))
Formula 0 simplified : XX(G!"((p91==0)||(p85==1))" R !"((p224==0)||(p225==1))") R (!"((p224==0)||(p225==1))" R F!"((p67==0)||(p11==1))")
Detected timeout of ITS tools.
[2026-05-25 16:17:15] [INFO ] Flatten gal took : 8 ms
[2026-05-25 16:17:15] [INFO ] Applying decomposition
[2026-05-25 16:17:15] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10459474143826922209.txt' '-o' '/tmp/graph10459474143826922209.bin' '-w' '/tmp/graph10459474143826922209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10459474143826922209.bin' '-l' '-1' '-v' '-w' '/tmp/graph10459474143826922209.weights' '-q' '0' '-e' '0.001'
[2026-05-25 16:17:15] [INFO ] Decomposing Gal with order
[2026-05-25 16:17:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 16:17:15] [INFO ] Removed a total of 59 redundant transitions.
[2026-05-25 16:17:15] [INFO ] Flatten gal took : 63 ms
[2026-05-25 16:17:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2026-05-25 16:17:15] [INFO ] Time to serialize gal into /tmp/LTL5908627334124927372.gal : 4 ms
[2026-05-25 16:17:15] [INFO ] Time to serialize properties into /tmp/LTL6769502948868447000.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5908627334124927372.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6769502948868447000.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(X((F("((i5.i0.u33.p91==0)||(i5.i2.u37.p85==1))"))U("((i12.i1.u79.p224==0)||(i12.i1.u79.p225==1))"))))U(("((i12.i1.u79.p224==0)||...228
Formula 0 simplified : XX(G!"((i5.i0.u33.p91==0)||(i5.i2.u37.p85==1))" R !"((i12.i1.u79.p224==0)||(i12.i1.u79.p225==1))") R (!"((i12.i1.u79.p224==0)||(i12....219
Reverse transition relation is NOT exact ! Due to transitions t205, i1.i0.t193, i1.i0.u7.t200, i2.i1.t180, i2.i1.t187, i3.t173, i3.i2.t165, i4.t158, i4.i1....527
Computing Next relation with stutter on 1.05879e+06 deadlock states
112 unique states visited
105 strongly connected components in search stack
119 transitions explored
110 items max in DFS search stack
191 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.93804,75604,1,0,124386,316,2860,204968,164,938,165608
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-12b-LTLCardinality-12 finished in 99531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&X(!p1)) U (G(p1)||X(G(p2)))))'
Support contains 4 out of 226 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 226/226 places, 231/231 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 219 transition count 224
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 219 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 219 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 216 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 216 transition count 220
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 216 transition count 218
Applied a total of 23 rules in 13 ms. Remains 216 /226 variables (removed 10) and now considering 218/231 (removed 13) transitions.
[2026-05-25 16:17:18] [INFO ] Invariant cache hit.
[2026-05-25 16:17:18] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 16:17:18] [INFO ] Invariant cache hit.
[2026-05-25 16:17:18] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 216/226 places, 218/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 216/226 places, 218/231 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(!p1)) U (G(p1)||X(G(p2)))))'
Stuttering acceptance computed with spot in 419 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (NOT p0), true, (NOT p2), (AND (NOT p0) (NOT p1) p2), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLCardinality-13
Product exploration explored 100000 steps with 25065 reset in 129 ms.
Product exploration explored 100000 steps with 24967 reset in 235 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge based reduction with 28 factoid took 79 ms. Reduced automaton from 11 states, 26 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
RANDOM walk for 12170 steps (102 resets) in 35 ms. (338 steps per ms) remains 0/8 properties
Negative knowledge disproves property using: (G p1)
Knowledge based reduction with 28 factoid took 66 ms. Proved property starting from automaton with 7 states, 18 edges and 3 AP (stutter insensitive
Knowledge-based reduction took 166 ms.
FORMULA GPUForwardProgress-PT-12b-LTLCardinality-13 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property GPUForwardProgress-PT-12b-LTLCardinality-13 finished in 1201 ms.
All properties solved by simple procedures.
Total runtime 268138 ms.

BK_STOP 1779725839315

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-12b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-12b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074200419"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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