About the Execution of ITS-Tools for GPUForwardProgress-PT-32a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 505.487 | 204604.00 | 238160.00 | 958.00 | FTFFFFFFTTFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074200492.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-32a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074200492
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 7.1K Mar 7 11:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 7 11:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 7 11:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 11:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 10:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 10:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 11:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Mar 7 11:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 11:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Mar 7 11:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:39 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 50K 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-32a-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-32a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779730671565
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 17:37:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 17:37:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 17:37:52] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2026-05-25 17:37:52] [INFO ] Transformed 136 places.
[2026-05-25 17:37:52] [INFO ] Transformed 169 transitions.
[2026-05-25 17:37:52] [INFO ] Found NUPN structural information;
[2026-05-25 17:37:52] [INFO ] Parsed PT model containing 136 places and 169 transitions and 661 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
FORMULA GPUForwardProgress-PT-32a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 135/135 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 135
Applied a total of 1 rules in 18 ms. Remains 135 /136 variables (removed 1) and now considering 135/135 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11163736947568560390.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-150567284192889716.kers'
[2026-05-25 17:37:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11163736947568560390.kers, --Pflows, --basisKERS=/tmp/petrispot-output-150567284192889716.kers]
Normalized transition count is 134 out of 135 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 135 cols 525 entries
Finished phase 1 with 101 SingleSign rule and 1 generalized
[2026-05-25 17:37:52] [INFO ] Computed 33 invariants in 0 ms
Computed 33 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-150567284192889716.kers
Total runtime 1 ms.
[2026-05-25 17:37:53] [INFO ] Implicit Places using invariants in 270 ms returned []
[2026-05-25 17:37:53] [INFO ] Invariant cache hit.
[2026-05-25 17:37:53] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 17:37:53] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-25 17:37:53] [INFO ] Invariant cache hit.
[2026-05-25 17:37:53] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 33/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 134/268 variables, 134/301 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 32/333 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 1/269 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 1/270 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (OVERLAPS) 0/270 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 336 constraints, problems are : Problem set: 0 solved, 134 unsolved in 7520 ms.
Refiners :[Domain max(s): 135/135 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 135/135 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 33/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 134/268 variables, 134/301 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 32/333 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 134/467 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 1/269 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 1/270 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 134 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 270/270 variables, and 470 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30017 ms.
Refiners :[Domain max(s): 135/135 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 135/135 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37662ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 37673ms
Starting structural reductions in LTL mode, iteration 1 : 135/136 places, 135/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38283 ms. Remains : 135/136 places, 135/135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-25 17:38:31] [INFO ] Invariant cache hit.
[2026-05-25 17:38:31] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-25 17:38:31] [INFO ] Invariant cache hit.
[2026-05-25 17:38:31] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 17:38:31] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 135/135 places, 135/135 transitions.
Support contains 34 out of 135 places after structural reductions.
[2026-05-25 17:38:31] [INFO ] Flatten gal took : 45 ms
[2026-05-25 17:38:31] [INFO ] Flatten gal took : 14 ms
[2026-05-25 17:38:31] [INFO ] Input system was already deterministic with 135 transitions.
Reduction of identical properties reduced properties to check from 36 to 35
RANDOM walk for 40000 steps (76 resets) in 884 ms. (45 steps per ms) remains 1/35 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 1/1 properties
[2026-05-25 17:38:32] [INFO ] Invariant cache hit.
[2026-05-25 17:38:32] [INFO ] State equation strengthened by 33 read => feed constraints.
Problem AtomicPropp34 is UNSAT
After SMT solving in domain Real declared 4/270 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Domain max(s): 0/135 constraints, Generalized P Invariants (flows): 0/33 constraints, State Equation: 0/135 constraints, ReadFeed: 0/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA GPUForwardProgress-PT-32a-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 432 edges and 135 vertex of which 102 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(X(G(p2))&&p1)))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Graph (complete) has 432 edges and 135 vertex of which 102 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.2 ms
Discarding 33 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 31 Pre rules applied. Total rules applied 1 place count 102 transition count 103
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 71 transition count 103
Applied a total of 63 rules in 21 ms. Remains 71 /135 variables (removed 64) and now considering 103/135 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13090542880988366605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9189382270515255288.kers'
[2026-05-25 17:38:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13090542880988366605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9189382270515255288.kers]
Normalized transition count is 102 out of 103 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 71 cols 397 entries
Finished phase 1 with 69 SingleSign rule and 1 generalized
[2026-05-25 17:38:32] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9189382270515255288.kers
Total runtime 0 ms.
[2026-05-25 17:38:32] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 17:38:32] [INFO ] Invariant cache hit.
[2026-05-25 17:38:32] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 17:38:32] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2026-05-25 17:38:32] [INFO ] Redundant transitions in 3 ms returned []
Running 102 sub problems to find dead transitions.
[2026-05-25 17:38:32] [INFO ] Invariant cache hit.
[2026-05-25 17:38:32] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/172 variables, 70/141 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/173 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/174 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/174 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 176 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4500 ms.
Refiners :[Domain max(s): 71/71 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/172 variables, 70/141 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 102/275 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/173 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/174 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/174 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 278 constraints, problems are : Problem set: 0 solved, 102 unsolved in 8634 ms.
Refiners :[Domain max(s): 71/71 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13188ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 13191ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/135 places, 103/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13373 ms. Remains : 71/135 places, 103/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(X(G(p2))&&p1)))))'
Stuttering acceptance computed with spot in 260 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-32a-LTLFireability-00
Stuttering criterion allowed to conclude after 2066 steps with 5 reset in 21 ms.
FORMULA GPUForwardProgress-PT-32a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32a-LTLFireability-00 finished in 13741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((((p0 U p1) U p2)||G(p3))))||(F((((p0 U p1) U p2)||G(p3)))&&X(!p0)))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 11 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-445694055541534480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18265113280847374623.kers'
[2026-05-25 17:38:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-445694055541534480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18265113280847374623.kers]
Normalized transition count is 134 out of 135 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 135 cols 525 entries
Finished phase 1 with 101 SingleSign rule and 1 generalized
[2026-05-25 17:38:46] [INFO ] Computed 33 invariants in 0 ms
Computed 33 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18265113280847374623.kers
Total runtime 1 ms.
[2026-05-25 17:38:46] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-25 17:38:46] [INFO ] Invariant cache hit.
[2026-05-25 17:38:46] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 17:38:46] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-25 17:38:46] [INFO ] Invariant cache hit.
[2026-05-25 17:38:46] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 33/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 134/268 variables, 134/301 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 32/333 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 1/269 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 1/270 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (OVERLAPS) 0/270 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 336 constraints, problems are : Problem set: 0 solved, 134 unsolved in 7037 ms.
Refiners :[Domain max(s): 135/135 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 135/135 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 33/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 134/268 variables, 134/301 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 32/333 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 134/467 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 1/269 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 1/270 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 0/270 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 470 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30017 ms.
Refiners :[Domain max(s): 135/135 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 135/135 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37096ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 37102ms
Finished structural reductions in LTL mode , in 1 iterations and 37443 ms. Remains : 135/135 places, 135/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((((p0 U p1) U p2)||G(p3))))||(F((((p0 U p1) U p2)||G(p3)))&&X(!p0)))))'
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND (NOT p2) (NOT p3) p0)]
Running random walk in product with property : GPUForwardProgress-PT-32a-LTLFireability-01
Product exploration explored 100000 steps with 1442 reset in 425 ms.
Product exploration explored 100000 steps with 1393 reset in 433 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 432 edges and 135 vertex of which 102 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 11 factoid took 142 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (73 resets) in 346 ms. (115 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
[2026-05-25 17:39:25] [INFO ] Invariant cache hit.
[2026-05-25 17:39:25] [INFO ] State equation strengthened by 33 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/134 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 126/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 134/268 variables, 134/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 32/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/269 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/270 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/270 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/270 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 336 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Domain max(s): 135/135 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 135/135 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 126/134 variables, 32/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 126/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 134/268 variables, 134/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 32/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Int declared 269/270 variables, and 335 constraints, problems are : Problem set: 1 solved, 0 unsolved in 113 ms.
Refiners :[Domain max(s): 134/135 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 135/135 constraints, ReadFeed: 32/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 225ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 12 factoid took 213 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p3), (NOT p3), false]
Knowledge-based reduction took 907 ms.
Stuttering acceptance computed with spot in 118 ms :[(NOT p3), (NOT p3), false]
Support contains 2 out of 135 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Graph (complete) has 432 edges and 135 vertex of which 102 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 101 transition count 104
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 72 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 61 place count 71 transition count 103
Applied a total of 61 rules in 20 ms. Remains 71 /135 variables (removed 64) and now considering 103/135 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1842899533183161394.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9370886754996030970.kers'
[2026-05-25 17:39:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1842899533183161394.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9370886754996030970.kers]
Normalized transition count is 102 out of 103 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 71 cols 300 entries
Finished phase 1 with 69 SingleSign rule and 1 generalized
[2026-05-25 17:39:26] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9370886754996030970.kers
Total runtime 0 ms.
[2026-05-25 17:39:26] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 17:39:26] [INFO ] Invariant cache hit.
[2026-05-25 17:39:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:39:26] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2026-05-25 17:39:26] [INFO ] Redundant transitions in 3 ms returned []
Running 71 sub problems to find dead transitions.
[2026-05-25 17:39:26] [INFO ] Invariant cache hit.
[2026-05-25 17:39:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 102/141 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 32/173 variables, 32/111 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 32/143 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 1/174 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 144 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2069 ms.
Refiners :[Domain max(s): 71/71 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 102/141 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 7/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 32/173 variables, 32/118 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 32/150 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 64/214 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 1/174 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 0/174 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 215 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3423 ms.
Refiners :[Domain max(s): 71/71 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5508ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 5508ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/135 places, 103/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5695 ms. Remains : 71/135 places, 103/135 transitions.
Computed a total of 2 stabilizing places and 34 stable transitions
Computed a total of 2 stabilizing places and 34 stable transitions
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 565 steps (3 resets) in 17 ms. (31 steps per ms) remains 0/4 properties
Knowledge based reduction with 2 factoid took 288 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p3), (NOT p3), false]
Knowledge-based reduction took 651 ms.
Stuttering acceptance computed with spot in 131 ms :[(NOT p3), (NOT p3), false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p3), (NOT p3), false]
Product exploration explored 100000 steps with 1188 reset in 383 ms.
Product exploration explored 100000 steps with 1171 reset in 366 ms.
Built C files in :
/tmp/ltsmin7351260358965089278
[2026-05-25 17:39:33] [INFO ] Computing symmetric may disable matrix : 103 transitions.
[2026-05-25 17:39:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:39:33] [INFO ] Computing symmetric may enable matrix : 103 transitions.
[2026-05-25 17:39:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:39:33] [INFO ] Computing Do-Not-Accords matrix : 103 transitions.
[2026-05-25 17:39:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:39:33] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7351260358965089278
Running compilation step : cd /tmp/ltsmin7351260358965089278;'/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 322 ms.
Running link step : cd /tmp/ltsmin7351260358965089278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7351260358965089278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14627945597155198358.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 103/103 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 71 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 69 transition count 101
Applied a total of 4 rules in 6 ms. Remains 69 /71 variables (removed 2) and now considering 101/103 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4246981518638090888.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4969424295915645663.kers'
[2026-05-25 17:39:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4246981518638090888.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4969424295915645663.kers]
Normalized transition count is 100 out of 101 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 100 rows 69 cols 296 entries
Finished phase 1 with 67 SingleSign rule and 1 generalized
[2026-05-25 17:39:48] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4969424295915645663.kers
Total runtime 0 ms.
[2026-05-25 17:39:48] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-25 17:39:48] [INFO ] Invariant cache hit.
[2026-05-25 17:39:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:39:48] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2026-05-25 17:39:48] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2026-05-25 17:39:48] [INFO ] Invariant cache hit.
[2026-05-25 17:39:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 100/137 variables, 37/75 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 32/169 variables, 32/107 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 32/139 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 1/170 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/170 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 140 constraints, problems are : Problem set: 0 solved, 69 unsolved in 2001 ms.
Refiners :[Domain max(s): 69/69 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 100/137 variables, 37/75 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 32/169 variables, 32/112 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 32/144 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 64/208 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 1/170 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 12 (OVERLAPS) 0/170 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 209 constraints, problems are : Problem set: 0 solved, 69 unsolved in 3039 ms.
Refiners :[Domain max(s): 69/69 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5052ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 5053ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/71 places, 101/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5200 ms. Remains : 69/71 places, 101/103 transitions.
Built C files in :
/tmp/ltsmin8126876701241766680
[2026-05-25 17:39:53] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2026-05-25 17:39:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:39:53] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2026-05-25 17:39:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:39:53] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2026-05-25 17:39:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:39:53] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8126876701241766680
Running compilation step : cd /tmp/ltsmin8126876701241766680;'/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 202 ms.
Running link step : cd /tmp/ltsmin8126876701241766680;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8126876701241766680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1412593594591919970.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 17:40:08] [INFO ] Flatten gal took : 7 ms
[2026-05-25 17:40:08] [INFO ] Flatten gal took : 6 ms
[2026-05-25 17:40:08] [INFO ] Time to serialize gal into /tmp/LTL12866032367009281173.gal : 3 ms
[2026-05-25 17:40:08] [INFO ] Time to serialize properties into /tmp/LTL17634507583817129254.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/LTL12866032367009281173.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5204881562295583175.hoa' '-atoms' '/tmp/LTL17634507583817129254.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17634507583817129254.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5204881562295583175.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t70, t98, t68.t86, t66.t87, t64.t85, t62.t88, t60.t84, t58.t89, t56.t83, t54.t90, t52...459
Computing Next relation with stutter on 4.29497e+09 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
292 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,2.95447,110728,1,0,528,524046,238,475,2656,682491,841
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-32a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GPUForwardProgress-PT-32a-LTLFireability-01 finished in 85750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X((p0 U (p1||G(p0))))) U X(X(X((!p0 U p2)))))))'
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8164356707094329289.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8236905468846261287.kers'
[2026-05-25 17:40:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8164356707094329289.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8236905468846261287.kers]
Normalized transition count is 134 out of 135 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 134 rows 135 cols 525 entries
Finished phase 1 with 101 SingleSign rule and 1 generalized
[2026-05-25 17:40:12] [INFO ] Computed 33 invariants in 0 ms
Computed 33 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8236905468846261287.kers
Total runtime 0 ms.
[2026-05-25 17:40:12] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 17:40:12] [INFO ] Invariant cache hit.
[2026-05-25 17:40:12] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 17:40:12] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-25 17:40:12] [INFO ] Invariant cache hit.
[2026-05-25 17:40:12] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 33/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 134/268 variables, 134/301 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 32/333 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 1/269 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (OVERLAPS) 1/270 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/270 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (OVERLAPS) 0/270 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 336 constraints, problems are : Problem set: 0 solved, 134 unsolved in 7054 ms.
Refiners :[Domain max(s): 135/135 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 135/135 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 33/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 134/268 variables, 134/301 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 32/333 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 134/467 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 1/269 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 1/270 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 12 (OVERLAPS) 0/270 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 470 constraints, problems are : Problem set: 0 solved, 134 unsolved in 30016 ms.
Refiners :[Domain max(s): 135/135 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 135/135 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37102ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 37102ms
Finished structural reductions in LTL mode , in 1 iterations and 37397 ms. Remains : 135/135 places, 135/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X((p0 U (p1||G(p0))))) U X(X(X((!p0 U p2)))))))'
Stuttering acceptance computed with spot in 619 ms :[(AND (NOT p0) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-32a-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32a-LTLFireability-02 finished in 38076 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G(X(p0))||(X(p0)&&((p1 U (p2||G(p1))) U ((X(X(p0))&&(p1 U (p2||G(p1))))||G((p1 U (p2||G(p1))))))))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-25 17:40:50] [INFO ] Invariant cache hit.
[2026-05-25 17:40:50] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 17:40:50] [INFO ] Invariant cache hit.
[2026-05-25 17:40:50] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 17:40:50] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 135/135 places, 135/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G(X(p0))||(X(p0)&&((p1 U (p2||G(p1))) U ((X(X(p0))&&(p1 U (p2||G(p1))))||G((p1 U (p2||G(p1))))))))))'
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-32a-LTLFireability-03
Stuttering criterion allowed to conclude after 46410 steps with 18120 reset in 154 ms.
FORMULA GPUForwardProgress-PT-32a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32a-LTLFireability-03 finished in 824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&((p1 U X(X(p2)))||X(p3))))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-25 17:40:51] [INFO ] Invariant cache hit.
[2026-05-25 17:40:51] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 17:40:51] [INFO ] Invariant cache hit.
[2026-05-25 17:40:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 17:40:51] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 135/135 places, 135/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&((p1 U X(X(p2)))||X(p3))))'
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-32a-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32a-LTLFireability-04 finished in 571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(p1))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-25 17:40:51] [INFO ] Invariant cache hit.
[2026-05-25 17:40:51] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 17:40:51] [INFO ] Invariant cache hit.
[2026-05-25 17:40:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 17:40:51] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 135/135 places, 135/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(p1))))'
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32a-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32a-LTLFireability-05 finished in 457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((((p0&&X(!p0)) U G(p1))||F(!p2))) U p3))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-25 17:40:52] [INFO ] Invariant cache hit.
[2026-05-25 17:40:52] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 17:40:52] [INFO ] Invariant cache hit.
[2026-05-25 17:40:52] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 17:40:52] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 271 ms. Remains : 135/135 places, 135/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((((p0&&X(!p0)) U G(p1))||F(!p2))) U p3))'
Stuttering acceptance computed with spot in 302 ms :[(NOT p3), p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p2 p0), (AND p2 (NOT p1)), (AND p2 (NOT p1) p0)]
Running random walk in product with property : GPUForwardProgress-PT-32a-LTLFireability-07
Stuttering criterion allowed to conclude after 123 steps with 19 reset in 3 ms.
FORMULA GPUForwardProgress-PT-32a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32a-LTLFireability-07 finished in 610 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)) U (X(!p0)&&F((!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-25 17:40:52] [INFO ] Invariant cache hit.
[2026-05-25 17:40:52] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 17:40:52] [INFO ] Invariant cache hit.
[2026-05-25 17:40:52] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 17:40:53] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 135/135 places, 135/135 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)) U (X(!p0)&&F((!p1 U (p2||G(!p1)))))))'
Stuttering acceptance computed with spot in 164 ms :[(OR p0 (AND p1 (NOT p2))), p0, (AND (NOT p2) p1), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32a-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 299 ms.
Product exploration explored 100000 steps with 50000 reset in 306 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 432 edges and 135 vertex of which 102 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 13 factoid took 14 ms. Proved property starting from automaton with 4 states, 9 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 19 ms.
FORMULA GPUForwardProgress-PT-32a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-32a-LTLFireability-08 finished in 1112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p1)||X(p2))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-25 17:40:53] [INFO ] Invariant cache hit.
[2026-05-25 17:40:53] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-25 17:40:53] [INFO ] Invariant cache hit.
[2026-05-25 17:40:54] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 17:40:54] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 316 ms. Remains : 135/135 places, 135/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p1)||X(p2))))'
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-32a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 220 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-32a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32a-LTLFireability-10 finished in 534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((p1 U G(p2))||F(G(p3))))))'
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2026-05-25 17:40:54] [INFO ] Invariant cache hit.
[2026-05-25 17:40:54] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 17:40:54] [INFO ] Invariant cache hit.
[2026-05-25 17:40:54] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 17:40:54] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 135/135 places, 135/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((p1 U G(p2))||F(G(p3))))))'
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), true, (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-32a-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32a-LTLFireability-12 finished in 544 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 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Graph (complete) has 432 edges and 135 vertex of which 102 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.2 ms
Discarding 33 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 31 Pre rules applied. Total rules applied 1 place count 102 transition count 103
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 71 transition count 103
Applied a total of 63 rules in 12 ms. Remains 71 /135 variables (removed 64) and now considering 103/135 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13786450428556220459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14656180442116356905.kers'
[2026-05-25 17:40:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13786450428556220459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14656180442116356905.kers]
Normalized transition count is 102 out of 103 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 71 cols 397 entries
Finished phase 1 with 69 SingleSign rule and 1 generalized
[2026-05-25 17:40:54] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14656180442116356905.kers
Total runtime 1 ms.
[2026-05-25 17:40:55] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 17:40:55] [INFO ] Invariant cache hit.
[2026-05-25 17:40:55] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-25 17:40:55] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2026-05-25 17:40:55] [INFO ] Redundant transitions in 4 ms returned []
Running 102 sub problems to find dead transitions.
[2026-05-25 17:40:55] [INFO ] Invariant cache hit.
[2026-05-25 17:40:55] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/172 variables, 70/141 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 1/173 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/174 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/174 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 176 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4410 ms.
Refiners :[Domain max(s): 71/71 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 102/172 variables, 70/141 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 32/173 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 102/275 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/173 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 1/174 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/174 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/174 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 278 constraints, problems are : Problem set: 0 solved, 102 unsolved in 11085 ms.
Refiners :[Domain max(s): 71/71 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 71/71 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15519ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 15520ms
Starting structural reductions in SI_LTL mode, iteration 1 : 71/135 places, 103/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15698 ms. Remains : 71/135 places, 103/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32a-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32a-LTLFireability-13 finished in 15752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 135/135 transitions.
Graph (complete) has 432 edges and 135 vertex of which 102 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.2 ms
Discarding 33 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 1 place count 101 transition count 101
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 65 place count 69 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 67 place count 68 transition count 100
Applied a total of 67 rules in 15 ms. Remains 68 /135 variables (removed 67) and now considering 100/135 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13895414881900500187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13192489445471636918.kers'
[2026-05-25 17:41:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13895414881900500187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13192489445471636918.kers]
Normalized transition count is 99 out of 100 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 99 rows 68 cols 294 entries
Finished phase 1 with 66 SingleSign rule and 1 generalized
[2026-05-25 17:41:10] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13192489445471636918.kers
Total runtime 2 ms.
[2026-05-25 17:41:10] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-25 17:41:10] [INFO ] Invariant cache hit.
[2026-05-25 17:41:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 17:41:10] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2026-05-25 17:41:10] [INFO ] Redundant transitions in 3 ms returned []
Running 68 sub problems to find dead transitions.
[2026-05-25 17:41:10] [INFO ] Invariant cache hit.
[2026-05-25 17:41:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 99/135 variables, 36/73 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 32/167 variables, 32/105 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 32/137 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 1/168 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 138 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1936 ms.
Refiners :[Domain max(s): 68/68 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (OVERLAPS) 99/135 variables, 36/73 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 32/167 variables, 32/109 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 32/141 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 64/205 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (OVERLAPS) 1/168 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 12 (OVERLAPS) 0/168 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 206 constraints, problems are : Problem set: 0 solved, 68 unsolved in 3236 ms.
Refiners :[Domain max(s): 68/68 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5190ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 5190ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/135 places, 100/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5342 ms. Remains : 68/135 places, 100/135 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32a-LTLFireability-15
Stuttering criterion allowed to conclude after 554 steps with 90 reset in 6 ms.
FORMULA GPUForwardProgress-PT-32a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32a-LTLFireability-15 finished in 5434 ms.
All properties solved by simple procedures.
Total runtime 203535 ms.
BK_STOP 1779730876169
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-32a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-32a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074200492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-32a.tgz
mv GPUForwardProgress-PT-32a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;