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.r098-tall-177955695400251.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 DiscoveryGPU-PT-07a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-tall-177955695400251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.6K Mar 6 16:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 6 16:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 6 16:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 6 16:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 15 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 6 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 6 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Mar 6 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 6 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:10 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 25K 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 DiscoveryGPU-PT-07a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-07a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779594926860

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 03:55:27] [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-24 03:55:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 03:55:28] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2026-05-24 03:55:28] [INFO ] Transformed 73 places.
[2026-05-24 03:55:28] [INFO ] Transformed 99 transitions.
[2026-05-24 03:55:28] [INFO ] Found NUPN structural information;
[2026-05-24 03:55:28] [INFO ] Parsed PT model containing 73 places and 99 transitions and 318 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 99/99 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 70 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 70 transition count 96
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 68 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 68 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 67 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 67 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 67 transition count 86
Applied a total of 18 rules in 24 ms. Remains 67 /73 variables (removed 6) and now considering 86/99 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1987417267563391074.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8647672479101277825.kers'
[2026-05-24 03:55:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1987417267563391074.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8647672479101277825.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 86 rows 65 cols 167 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-24 03:55:28] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8647672479101277825.kers
Total runtime 1 ms.
[2026-05-24 03:55:28] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-24 03:55:28] [INFO ] Invariant cache hit.
[2026-05-24 03:55:28] [INFO ] State equation strengthened by 54 read => feed constraints.
[2026-05-24 03:55:28] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 305 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/73 places, 86/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 345 ms. Remains : 66/73 places, 86/99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 86/86 (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-2655520172271368914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7633394554897982011.kers'
[2026-05-24 03:55:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2655520172271368914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7633394554897982011.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 86 rows 65 cols 167 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-24 03:55:28] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7633394554897982011.kers
Total runtime 0 ms.
[2026-05-24 03:55:28] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 03:55:28] [INFO ] Invariant cache hit.
[2026-05-24 03:55:28] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-24 03:55:28] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2026-05-24 03:55:28] [INFO ] Invariant cache hit.
[2026-05-24 03:55:28] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/152 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 40/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 107 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1986 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 86/152 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 40/107 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 85/192 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 192 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1956 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3976ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 3985ms
Finished structural reductions in LTL mode , in 1 iterations and 4126 ms. Remains : 66/66 places, 86/86 transitions.
Support contains 27 out of 66 places after structural reductions.
[2026-05-24 03:55:33] [INFO ] Flatten gal took : 20 ms
[2026-05-24 03:55:33] [INFO ] Flatten gal took : 9 ms
[2026-05-24 03:55:33] [INFO ] Input system was already deterministic with 86 transitions.
RANDOM walk for 918 steps (10 resets) in 79 ms. (11 steps per ms) remains 0/19 properties
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 162 edges and 66 vertex of which 62 are kept as prefixes of interest. Removing 4 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(p0))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 86/86 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 57 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 57 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 54 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 54 transition count 74
Applied a total of 24 rules in 5 ms. Remains 54 /66 variables (removed 12) and now considering 74/86 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10622702191935314342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9193947472538567889.kers'
[2026-05-24 03:55:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10622702191935314342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9193947472538567889.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 74 rows 53 cols 146 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-24 03:55:33] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9193947472538567889.kers
Total runtime 0 ms.
[2026-05-24 03:55:33] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-24 03:55:33] [INFO ] Invariant cache hit.
[2026-05-24 03:55:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-24 03:55:33] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2026-05-24 03:55:33] [INFO ] Invariant cache hit.
[2026-05-24 03:55:33] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/128 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 91 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1204 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/128 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 73/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 164 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1492 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2714ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2715ms
Starting structural reductions in LTL mode, iteration 1 : 54/66 places, 74/86 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2803 ms. Remains : 54/66 places, 74/86 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 290 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-00 finished in 3165 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 X(X(p1))))))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 86/86 transitions.
Graph (complete) has 162 edges and 66 vertex of which 63 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 70 edges and 61 vertex of which 52 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Graph (trivial) has 52 edges and 52 vertex of which 24 / 52 are part of one of the 12 SCC in 2 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 40 transition count 65
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 32 place count 32 transition count 53
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 27 transition count 43
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 27 transition count 43
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 24 transition count 37
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 24 transition count 37
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 21 transition count 31
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 21 transition count 31
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 18 transition count 28
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 18 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 16 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 16 transition count 25
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 12 transition count 21
Applied a total of 69 rules in 29 ms. Remains 12 /66 variables (removed 54) and now considering 21/86 (removed 65) transitions.
[2026-05-24 03:55:37] [INFO ] Flow matrix only has 16 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4201025823752030709.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15489601807951093567.kers'
[2026-05-24 03:55:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4201025823752030709.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15489601807951093567.kers]
Normalized transition count is 15 out of 16 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 15 rows 12 cols 25 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-24 03:55:37] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15489601807951093567.kers
Total runtime 0 ms.
[2026-05-24 03:55:37] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 03:55:37] [INFO ] Flow matrix only has 16 transitions (discarded 5 similar events)
[2026-05-24 03:55:37] [INFO ] Invariant cache hit.
[2026-05-24 03:55:37] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2026-05-24 03:55:37] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2026-05-24 03:55:37] [INFO ] Flow matrix only has 16 transitions (discarded 5 similar events)
[2026-05-24 03:55:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 5/27 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/28 variables, and 12 constraints, problems are : Problem set: 0 solved, 12 unsolved in 102 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 5/27 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/28 variables, and 24 constraints, problems are : Problem set: 0 solved, 12 unsolved in 114 ms.
Refiners :[State Equation: 12/12 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 218ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 219ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/66 places, 21/86 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 12/66 places, 21/86 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 X(X(p1))))))'
Stuttering acceptance computed with spot in 312 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), false]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-03
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-03 finished in 639 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(G(p0))&&F((G(!p1)||(!p1&&F(!p2)))))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 86/86 transitions.
Graph (complete) has 162 edges and 66 vertex of which 63 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 70 edges and 61 vertex of which 52 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Graph (trivial) has 52 edges and 52 vertex of which 28 / 52 are part of one of the 14 SCC in 2 ms
Free SCC test removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 38 transition count 68
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 28 place count 33 transition count 54
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 33 place count 28 transition count 44
Iterating global reduction 2 with 5 rules applied. Total rules applied 38 place count 28 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 24 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 24 transition count 36
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 22 transition count 32
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 22 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 20 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 20 transition count 30
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 2 with 2 rules applied. Total rules applied 56 place count 19 transition count 29
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 2 with 2 rules applied. Total rules applied 58 place count 18 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 18 transition count 26
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 67 place count 13 transition count 21
Applied a total of 67 rules in 16 ms. Remains 13 /66 variables (removed 53) and now considering 21/86 (removed 65) transitions.
[2026-05-24 03:55:37] [INFO ] Flow matrix only has 15 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11145190472513072862.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5538400332059848558.kers'
[2026-05-24 03:55:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11145190472513072862.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5538400332059848558.kers]
Normalized transition count is 14 out of 15 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 14 rows 13 cols 25 entries
Finished phase 1 with 13 SingleSign rule and 0 generalized
[2026-05-24 03:55:37] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5538400332059848558.kers
Total runtime 0 ms.
[2026-05-24 03:55:37] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 03:55:37] [INFO ] Flow matrix only has 15 transitions (discarded 6 similar events)
[2026-05-24 03:55:37] [INFO ] Invariant cache hit.
[2026-05-24 03:55:37] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2026-05-24 03:55:37] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2026-05-24 03:55:37] [INFO ] Flow matrix only has 15 transitions (discarded 6 similar events)
[2026-05-24 03:55:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 6/27 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/28 variables, and 13 constraints, problems are : Problem set: 0 solved, 10 unsolved in 85 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 6/27 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/28 variables, and 23 constraints, problems are : Problem set: 0 solved, 10 unsolved in 75 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 162ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/66 places, 21/86 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 13/66 places, 21/86 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(G(p0))&&F((G(p1)||(F(p3)&&p2))))))'
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-04 finished in 397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 86/86 transitions.
Graph (complete) has 162 edges and 66 vertex of which 62 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 69 edges and 60 vertex of which 49 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Graph (trivial) has 52 edges and 49 vertex of which 28 / 49 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 35 transition count 65
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 28 place count 30 transition count 51
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 34 place count 24 transition count 39
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 24 transition count 39
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 45 place count 19 transition count 29
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 19 transition count 29
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 15 transition count 21
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 15 transition count 21
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 62 place count 11 transition count 17
Iterating global reduction 2 with 4 rules applied. Total rules applied 66 place count 11 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 10 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 10 transition count 14
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 7 transition count 11
Applied a total of 74 rules in 13 ms. Remains 7 /66 variables (removed 59) and now considering 11/86 (removed 75) transitions.
[2026-05-24 03:55:38] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4382186306309030563.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16212570705899648196.kers'
[2026-05-24 03:55:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4382186306309030563.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16212570705899648196.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 7 cols 13 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 03:55:38] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16212570705899648196.kers
Total runtime 0 ms.
[2026-05-24 03:55:38] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-24 03:55:38] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 03:55:38] [INFO ] Invariant cache hit.
[2026-05-24 03:55:38] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2026-05-24 03:55:38] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 03:55:38] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
[2026-05-24 03:55:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/14 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 7 constraints, problems are : Problem set: 0 solved, 5 unsolved in 40 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/14 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 variables, and 12 constraints, problems are : Problem set: 0 solved, 5 unsolved in 43 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 85ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/66 places, 11/86 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 7/66 places, 11/86 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 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-06 finished in 230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 86/86 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 81
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 57 transition count 77
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 57 transition count 77
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 54 transition count 74
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 54 transition count 74
Applied a total of 24 rules in 10 ms. Remains 54 /66 variables (removed 12) and now considering 74/86 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11313019800072234510.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12024991276952224892.kers'
[2026-05-24 03:55:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11313019800072234510.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12024991276952224892.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 74 rows 53 cols 146 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-24 03:55:38] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12024991276952224892.kers
Total runtime 0 ms.
[2026-05-24 03:55:38] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 03:55:38] [INFO ] Invariant cache hit.
[2026-05-24 03:55:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-24 03:55:38] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2026-05-24 03:55:38] [INFO ] Invariant cache hit.
[2026-05-24 03:55:38] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/128 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 91 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1219 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (OVERLAPS) 74/128 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 36/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 73/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 164 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1501 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2729ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 2729ms
Starting structural reductions in LTL mode, iteration 1 : 54/66 places, 74/86 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2838 ms. Remains : 54/66 places, 74/86 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 146 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 9 stabilizing places and 8 stable transitions
Detected a total of 9/54 stabilizing places and 8/74 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 12 ms. Proved property starting from automaton with 3 states, 4 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-07 finished in 3374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&F(p1)))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 86/86 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 62 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 62 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 59 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 59 transition count 79
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 57 transition count 77
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 57 transition count 77
Applied a total of 18 rules in 8 ms. Remains 57 /66 variables (removed 9) and now considering 77/86 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11081656837778679062.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-857437920129246913.kers'
[2026-05-24 03:55:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11081656837778679062.kers, --Pflows, --basisKERS=/tmp/petrispot-output-857437920129246913.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 77 rows 56 cols 151 entries
Finished phase 1 with 56 SingleSign rule and 0 generalized
[2026-05-24 03:55:41] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-857437920129246913.kers
Total runtime 2 ms.
[2026-05-24 03:55:41] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-24 03:55:41] [INFO ] Invariant cache hit.
[2026-05-24 03:55:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-24 03:55:41] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2026-05-24 03:55:41] [INFO ] Invariant cache hit.
[2026-05-24 03:55:41] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/134 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 37/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 95 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1294 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/134 variables, 57/58 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 37/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 76/171 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 171 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1509 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2813ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 2813ms
Starting structural reductions in LTL mode, iteration 1 : 57/66 places, 77/86 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2914 ms. Remains : 57/66 places, 77/86 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&F(p1)))))'
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-08
Product exploration explored 100000 steps with 9412 reset in 185 ms.
Stack based approach found an accepted trace after 14 steps with 2 reset with depth 7 and stack size 7 in 1 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-08 finished in 3338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((p0&&F(p1))))&&F(p2))))'
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 86/86 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 62 transition count 82
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 62 transition count 82
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 59 transition count 79
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 59 transition count 79
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 56 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 56 transition count 76
Applied a total of 20 rules in 13 ms. Remains 56 /66 variables (removed 10) and now considering 76/86 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-688905617280471095.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12391915098777191198.kers'
[2026-05-24 03:55:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-688905617280471095.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12391915098777191198.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 76 rows 55 cols 150 entries
Finished phase 1 with 55 SingleSign rule and 0 generalized
[2026-05-24 03:55:45] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12391915098777191198.kers
Total runtime 0 ms.
[2026-05-24 03:55:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-24 03:55:45] [INFO ] Invariant cache hit.
[2026-05-24 03:55:45] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-24 03:55:45] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2026-05-24 03:55:45] [INFO ] Invariant cache hit.
[2026-05-24 03:55:45] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 76/132 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 37/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 0/132 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 94 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1317 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 76/132 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 37/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 75/169 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 169 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1467 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2790ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 2791ms
Starting structural reductions in LTL mode, iteration 1 : 56/66 places, 76/86 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2904 ms. Remains : 56/66 places, 76/86 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X((p0&&F(p1))))&&F(p2))))'
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-10
Product exploration explored 100000 steps with 5481 reset in 194 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-10 finished in 3393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 86/86 transitions.
Graph (complete) has 162 edges and 66 vertex of which 62 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 69 edges and 60 vertex of which 49 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Graph (trivial) has 54 edges and 49 vertex of which 28 / 49 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 35 transition count 64
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 30 place count 29 transition count 50
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 36 place count 23 transition count 38
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 23 transition count 38
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 18 transition count 28
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 18 transition count 28
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 13 transition count 18
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 13 transition count 18
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 8 transition count 13
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 8 transition count 13
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 2 with 2 rules applied. Total rules applied 74 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 5 transition count 8
Applied a total of 78 rules in 11 ms. Remains 5 /66 variables (removed 61) and now considering 8/86 (removed 78) transitions.
[2026-05-24 03:55:48] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8435971238089135474.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6557125532281662192.kers'
[2026-05-24 03:55:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8435971238089135474.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6557125532281662192.kers]
Normalized transition count is 5 out of 6 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 5 rows 5 cols 9 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 03:55:48] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6557125532281662192.kers
Total runtime 0 ms.
[2026-05-24 03:55:48] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-24 03:55:48] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 03:55:48] [INFO ] Invariant cache hit.
[2026-05-24 03:55:48] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2026-05-24 03:55:48] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 03:55:48] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 03:55:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 32 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/66 places, 8/86 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 5/66 places, 8/86 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-11 finished in 170 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((G(p0) U X(X(X(!p1)))))))'
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 86/86 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 58 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 58 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 55 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 55 transition count 75
Applied a total of 22 rules in 11 ms. Remains 55 /66 variables (removed 11) and now considering 75/86 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4591847104329485773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-304353859040480936.kers'
[2026-05-24 03:55:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4591847104329485773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-304353859040480936.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 75 rows 54 cols 148 entries
Finished phase 1 with 54 SingleSign rule and 0 generalized
[2026-05-24 03:55:48] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-304353859040480936.kers
Total runtime 0 ms.
[2026-05-24 03:55:48] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-24 03:55:48] [INFO ] Invariant cache hit.
[2026-05-24 03:55:48] [INFO ] State equation strengthened by 36 read => feed constraints.
[2026-05-24 03:55:48] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2026-05-24 03:55:48] [INFO ] Invariant cache hit.
[2026-05-24 03:55:48] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/130 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 36/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 92 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 75/130 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 36/92 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 74/166 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 166 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1407 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2646ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 2647ms
Starting structural reductions in LTL mode, iteration 1 : 55/66 places, 75/86 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2731 ms. Remains : 55/66 places, 75/86 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((G(p0) U X(X(X(!p1)))))))'
Stuttering acceptance computed with spot in 378 ms :[p1, p1, p1, p1, p1, p1, true, p1, p1, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 9 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-12 finished in 3163 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 86/86 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 61 transition count 81
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 61 transition count 81
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 58 transition count 78
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 58 transition count 78
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 56 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 56 transition count 76
Applied a total of 20 rules in 8 ms. Remains 56 /66 variables (removed 10) and now considering 76/86 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7132620405886661761.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6526202712562481973.kers'
[2026-05-24 03:55:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7132620405886661761.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6526202712562481973.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 76 rows 55 cols 150 entries
Finished phase 1 with 55 SingleSign rule and 0 generalized
[2026-05-24 03:55:51] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6526202712562481973.kers
Total runtime 0 ms.
[2026-05-24 03:55:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-24 03:55:51] [INFO ] Invariant cache hit.
[2026-05-24 03:55:51] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-24 03:55:51] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2026-05-24 03:55:51] [INFO ] Invariant cache hit.
[2026-05-24 03:55:51] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 76/132 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 37/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 0/132 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 94 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 76/132 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 37/94 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 75/169 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 169 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1545 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 56/56 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2915ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 2915ms
Starting structural reductions in LTL mode, iteration 1 : 56/66 places, 76/86 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3003 ms. Remains : 56/66 places, 76/86 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 92 ms.
Product exploration explored 100000 steps with 33333 reset in 132 ms.
Computed a total of 9 stabilizing places and 8 stable transitions
Graph (complete) has 149 edges and 56 vertex of which 55 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 9 stabilizing places and 8 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 18 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 19 ms.
FORMULA DiscoveryGPU-PT-07a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-07a-LTLCardinality-14 finished in 3380 ms.
All properties solved by simple procedures.
Total runtime 27128 ms.

BK_STOP 1779594955233

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="DiscoveryGPU-PT-07a"
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 DiscoveryGPU-PT-07a, 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 r098-tall-177955695400251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-07a.tgz
mv DiscoveryGPU-PT-07a 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 ;