fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r146-tall-177961074100395
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for GPUForwardProgress-PT-08a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
354.224 15193.00 25988.00 136.20 FFTFFTFFFTTFFFFF 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-177961074100395.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-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.2K Mar 7 11:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 7 11:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 11:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 7 11:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 7 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 195K Mar 7 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 7 11:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 132K Mar 7 11:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:35 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 14K 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-08a-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-08a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779724725845

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 15:58:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 15:58:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:58:47] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2026-05-25 15:58:47] [INFO ] Transformed 40 places.
[2026-05-25 15:58:47] [INFO ] Transformed 49 transitions.
[2026-05-25 15:58:47] [INFO ] Found NUPN structural information;
[2026-05-25 15:58:47] [INFO ] Parsed PT model containing 40 places and 49 transitions and 181 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 39/39 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 39
Applied a total of 1 rules in 14 ms. Remains 39 /40 variables (removed 1) and now considering 39/39 (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-5402274961090569676.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12881298117480719018.kers'
[2026-05-25 15:58:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5402274961090569676.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12881298117480719018.kers]
Normalized transition count is 38 out of 39 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 39 cols 141 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 15:58:47] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12881298117480719018.kers
Total runtime 1 ms.
[2026-05-25 15:58:47] [INFO ] Implicit Places using invariants in 186 ms returned []
[2026-05-25 15:58:47] [INFO ] Invariant cache hit.
[2026-05-25 15:58:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:47] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2026-05-25 15:58:47] [INFO ] Invariant cache hit.
[2026-05-25 15:58:47] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/76 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/77 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 96 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1274 ms.
Refiners :[Domain max(s): 39/39 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/76 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 38/131 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/77 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/78 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/78 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 134 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2066 ms.
Refiners :[Domain max(s): 39/39 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3388ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 3398ms
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 39/39 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3749 ms. Remains : 39/40 places, 39/39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2026-05-25 15:58:50] [INFO ] Invariant cache hit.
[2026-05-25 15:58:51] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 15:58:51] [INFO ] Invariant cache hit.
[2026-05-25 15:58:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:51] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 39/39 places, 39/39 transitions.
Support contains 19 out of 39 places after structural reductions.
[2026-05-25 15:58:51] [INFO ] Flatten gal took : 21 ms
[2026-05-25 15:58:51] [INFO ] Flatten gal took : 6 ms
[2026-05-25 15:58:51] [INFO ] Input system was already deterministic with 39 transitions.
RANDOM walk for 1938 steps (16 resets) in 93 ms. (20 steps per ms) remains 0/13 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 120 edges and 39 vertex of which 30 are kept as prefixes of interest. Removing 9 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' '!(X(G(p0)))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2026-05-25 15:58:51] [INFO ] Invariant cache hit.
[2026-05-25 15:58:51] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 15:58:51] [INFO ] Invariant cache hit.
[2026-05-25 15:58:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:51] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 39/39 places, 39/39 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08a-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08a-LTLCardinality-01 finished in 382 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))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2026-05-25 15:58:51] [INFO ] Invariant cache hit.
[2026-05-25 15:58:51] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-25 15:58:51] [INFO ] Invariant cache hit.
[2026-05-25 15:58:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:52] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 39/39 places, 39/39 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))'
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : GPUForwardProgress-PT-08a-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 274 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 120 edges and 39 vertex of which 30 are kept as prefixes of interest. Removing 9 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 2 factoid took 14 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08a-LTLCardinality-02 finished in 691 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((X((X(X(p0))||G(p1)))||(G(p2) U p3))))'
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2026-05-25 15:58:52] [INFO ] Invariant cache hit.
[2026-05-25 15:58:52] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 15:58:52] [INFO ] Invariant cache hit.
[2026-05-25 15:58:52] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:52] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 39/39 places, 39/39 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((X((X(X(p0))||G(p1)))||(G(p2) U p3))))'
Stuttering acceptance computed with spot in 768 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p3) p2 (NOT p0)), (AND (NOT p3) p2 (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p3) p2 (NOT p0)), (AND (NOT p3) p2 (NOT p1) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p3), (AND p2 (NOT p3) (NOT p1) p0)]
Running random walk in product with property : GPUForwardProgress-PT-08a-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 54 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08a-LTLCardinality-04 finished in 934 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)))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (removed 0) transitions.
[2026-05-25 15:58:53] [INFO ] Invariant cache hit.
[2026-05-25 15:58:53] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 15:58:53] [INFO ] Invariant cache hit.
[2026-05-25 15:58:53] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:53] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 39/39 places, 39/39 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)))'
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08a-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 120 edges and 39 vertex of which 30 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 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 3 factoid took 15 ms. Proved property starting from automaton with 2 states, 2 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 16 ms.
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08a-LTLCardinality-05 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 39 transition count 32
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 32 transition count 32
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 16 place count 31 transition count 31
Applied a total of 16 rules in 14 ms. Remains 31 /39 variables (removed 8) and now considering 31/39 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8544150718319612833.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1014881204715302592.kers'
[2026-05-25 15:58:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8544150718319612833.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1014881204715302592.kers]
Normalized transition count is 30 out of 31 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 31 cols 109 entries
Finished phase 1 with 21 SingleSign rule and 1 generalized
[2026-05-25 15:58:54] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1014881204715302592.kers
Total runtime 0 ms.
[2026-05-25 15:58:54] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 15:58:54] [INFO ] Invariant cache hit.
[2026-05-25 15:58:54] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 15:58:54] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2026-05-25 15:58:54] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2026-05-25 15:58:54] [INFO ] Invariant cache hit.
[2026-05-25 15:58:54] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 30/60 variables, 30/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 1/61 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 1/62 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/62 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 88 constraints, problems are : Problem set: 0 solved, 30 unsolved in 801 ms.
Refiners :[Domain max(s): 31/31 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 31/31 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 30/60 variables, 30/69 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 30/115 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 1/61 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 1/62 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/62 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 0/62 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 118 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1323 ms.
Refiners :[Domain max(s): 31/31 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 31/31 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2135ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 2136ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/39 places, 31/39 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2261 ms. Remains : 31/39 places, 31/39 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-08a-LTLCardinality-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08a-LTLCardinality-06 finished in 2423 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 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 38 transition count 32
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 32 transition count 32
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 14 place count 31 transition count 31
Applied a total of 14 rules in 5 ms. Remains 31 /39 variables (removed 8) and now considering 31/39 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4972589517440330731.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10181989530826174995.kers'
[2026-05-25 15:58:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4972589517440330731.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10181989530826174995.kers]
Normalized transition count is 30 out of 31 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 31 cols 100 entries
Finished phase 1 with 21 SingleSign rule and 1 generalized
[2026-05-25 15:58:56] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10181989530826174995.kers
Total runtime 0 ms.
[2026-05-25 15:58:56] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 15:58:56] [INFO ] Invariant cache hit.
[2026-05-25 15:58:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 15:58:56] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2026-05-25 15:58:56] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2026-05-25 15:58:56] [INFO ] Invariant cache hit.
[2026-05-25 15:58:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 8/31 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 30/61 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1/62 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 72 constraints, problems are : Problem set: 0 solved, 23 unsolved in 454 ms.
Refiners :[Domain max(s): 31/31 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 8/31 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 8/40 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 30/61 variables, 31/71 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 23/94 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 1/62 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 95 constraints, problems are : Problem set: 0 solved, 23 unsolved in 606 ms.
Refiners :[Domain max(s): 31/31 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 31/31 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1069ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 1069ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/39 places, 31/39 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1154 ms. Remains : 31/39 places, 31/39 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 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08a-LTLCardinality-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08a-LTLCardinality-14 finished in 1278 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(X(G(p0))) U p1) U X(X(p2))))'
Support contains 8 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 39/39 (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-16895292932532542610.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2817313274688809104.kers'
[2026-05-25 15:58:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16895292932532542610.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2817313274688809104.kers]
Normalized transition count is 38 out of 39 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 39 cols 141 entries
Finished phase 1 with 29 SingleSign rule and 1 generalized
[2026-05-25 15:58:57] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2817313274688809104.kers
Total runtime 0 ms.
[2026-05-25 15:58:57] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 15:58:57] [INFO ] Invariant cache hit.
[2026-05-25 15:58:57] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-25 15:58:57] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2026-05-25 15:58:57] [INFO ] Invariant cache hit.
[2026-05-25 15:58:57] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/76 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 1/77 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 1/78 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/78 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 0/78 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 96 constraints, problems are : Problem set: 0 solved, 38 unsolved in 801 ms.
Refiners :[Domain max(s): 39/39 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 38/76 variables, 38/85 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 8/93 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 38/131 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/77 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/78 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 0/78 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 134 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1963 ms.
Refiners :[Domain max(s): 39/39 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2771ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 2772ms
Finished structural reductions in LTL mode , in 1 iterations and 2878 ms. Remains : 39/39 places, 39/39 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(X(G(p0))) U p1) U X(X(p2))))'
Stuttering acceptance computed with spot in 390 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-08a-LTLCardinality-15
Stuttering criterion allowed to conclude after 35 steps with 11 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08a-LTLCardinality-15 finished in 3303 ms.
All properties solved by simple procedures.
Total runtime 14030 ms.

BK_STOP 1779724741038

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-08a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074100395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-08a.tgz
mv GPUForwardProgress-PT-08a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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