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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 5.6K Mar 6 16:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 6 16:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 6 16:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 6 16:41 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.8K Mar 15 09:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 16:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Mar 6 16:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 6 16:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 6 16:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:13 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 39K 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-11a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779599392070

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-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 05:09:53] [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 05:09:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:09:53] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2026-05-24 05:09:53] [INFO ] Transformed 113 places.
[2026-05-24 05:09:53] [INFO ] Transformed 155 transitions.
[2026-05-24 05:09:53] [INFO ] Found NUPN structural information;
[2026-05-24 05:09:53] [INFO ] Parsed PT model containing 113 places and 155 transitions and 498 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 106 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 106 transition count 148
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 100 transition count 142
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 100 transition count 142
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 94 transition count 130
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 94 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 43 place count 94 transition count 125
Applied a total of 43 rules in 31 ms. Remains 94 /113 variables (removed 19) and now considering 125/155 (removed 30) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4628447735919884996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8324950294748192686.kers'
[2026-05-24 05:09:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4628447735919884996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8324950294748192686.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 125 rows 92 cols 245 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-05-24 05:09:53] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8324950294748192686.kers
Total runtime 1 ms.
[2026-05-24 05:09:53] [INFO ] Implicit Places using invariants in 191 ms returned []
[2026-05-24 05:09:53] [INFO ] Invariant cache hit.
[2026-05-24 05:09:53] [INFO ] State equation strengthened by 82 read => feed constraints.
[2026-05-24 05:09:53] [INFO ] Implicit Places using invariants and state equation in 174 ms returned [93]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 405 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/113 places, 125/155 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 451 ms. Remains : 93/113 places, 125/155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 125/125 (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-5606839112417803066.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17509979851098552080.kers'
[2026-05-24 05:09:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5606839112417803066.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17509979851098552080.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 125 rows 92 cols 245 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-05-24 05:09:53] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17509979851098552080.kers
Total runtime 0 ms.
[2026-05-24 05:09:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-24 05:09:53] [INFO ] Invariant cache hit.
[2026-05-24 05:09:53] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-24 05:09:54] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2026-05-24 05:09:54] [INFO ] Invariant cache hit.
[2026-05-24 05:09:54] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/218 variables, 93/94 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 60/154 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 154 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3466 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 125/218 variables, 93/94 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 60/154 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 124/278 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 278 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3701 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 93/93 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7207ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 7224ms
Finished structural reductions in LTL mode , in 1 iterations and 7410 ms. Remains : 93/93 places, 125/125 transitions.
Support contains 26 out of 93 places after structural reductions.
[2026-05-24 05:10:01] [INFO ] Flatten gal took : 25 ms
[2026-05-24 05:10:01] [INFO ] Flatten gal took : 10 ms
[2026-05-24 05:10:01] [INFO ] Input system was already deterministic with 125 transitions.
Support contains 25 out of 93 places (down from 26) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 2465 steps (18 resets) in 112 ms. (21 steps per ms) remains 0/15 properties
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 241 edges and 93 vertex of which 89 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 125/125 transitions.
Graph (complete) has 241 edges and 93 vertex of which 89 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 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 104 edges and 87 vertex of which 77 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Graph (trivial) has 83 edges and 77 vertex of which 42 / 77 are part of one of the 21 SCC in 1 ms
Free SCC test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 56 transition count 101
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 44 place count 47 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 46 transition count 79
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 55 place count 36 transition count 59
Iterating global reduction 3 with 10 rules applied. Total rules applied 65 place count 36 transition count 59
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 75 place count 26 transition count 39
Iterating global reduction 3 with 10 rules applied. Total rules applied 85 place count 26 transition count 39
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 93 place count 18 transition count 23
Iterating global reduction 3 with 8 rules applied. Total rules applied 101 place count 18 transition count 23
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 109 place count 10 transition count 15
Iterating global reduction 3 with 8 rules applied. Total rules applied 117 place count 10 transition count 15
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 3 with 2 rules applied. Total rules applied 119 place count 9 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 9 transition count 13
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 6 transition count 10
Applied a total of 125 rules in 22 ms. Remains 6 /93 variables (removed 87) and now considering 10/125 (removed 115) transitions.
[2026-05-24 05:10:01] [INFO ] Flow matrix only has 8 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-17181949061845995546.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7205804407858251176.kers'
[2026-05-24 05:10:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17181949061845995546.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7205804407858251176.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 6 cols 13 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-24 05:10:01] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7205804407858251176.kers
Total runtime 0 ms.
[2026-05-24 05:10:01] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-24 05:10:01] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 05:10:01] [INFO ] Invariant cache hit.
[2026-05-24 05:10:01] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2026-05-24 05:10:01] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 05:10:01] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 05:10:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/13 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 5 unsolved in 42 ms.
Refiners :[State Equation: 6/6 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/13 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 60 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/93 places, 10/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 6/93 places, 10/125 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 127 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-04 finished in 348 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(X(X(X(G(X(X(p0))))))))&&(X(p1) U p2)))'
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 125/125 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 90 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 90 transition count 122
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 87 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 87 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 85 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 85 transition count 117
Applied a total of 16 rules in 10 ms. Remains 85 /93 variables (removed 8) and now considering 117/125 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11118606405360063542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5572662328668804369.kers'
[2026-05-24 05:10:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11118606405360063542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5572662328668804369.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 117 rows 84 cols 231 entries
Finished phase 1 with 84 SingleSign rule and 0 generalized
[2026-05-24 05:10:02] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5572662328668804369.kers
Total runtime 0 ms.
[2026-05-24 05:10:02] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 05:10:02] [INFO ] Invariant cache hit.
[2026-05-24 05:10:02] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 05:10:02] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2026-05-24 05:10:02] [INFO ] Invariant cache hit.
[2026-05-24 05:10:02] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 117/202 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 57/143 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 0/202 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 143 constraints, problems are : Problem set: 0 solved, 116 unsolved in 2644 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 117/202 variables, 85/86 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 57/143 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 116/259 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 259 constraints, problems are : Problem set: 0 solved, 116 unsolved in 3214 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5877ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 5878ms
Starting structural reductions in LTL mode, iteration 1 : 85/93 places, 117/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6052 ms. Remains : 85/93 places, 117/125 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(X(X(X(G(X(X(p0))))))))&&(X(p1) U p2)))'
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-05 finished in 6458 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 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 125/125 transitions.
Graph (complete) has 241 edges and 93 vertex of which 89 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 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 104 edges and 87 vertex of which 77 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Graph (trivial) has 83 edges and 77 vertex of which 40 / 77 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 57 transition count 99
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 46 place count 46 transition count 79
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 55 place count 37 transition count 61
Iterating global reduction 2 with 9 rules applied. Total rules applied 64 place count 37 transition count 61
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 29 transition count 45
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 29 transition count 45
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 88 place count 21 transition count 29
Iterating global reduction 2 with 8 rules applied. Total rules applied 96 place count 21 transition count 29
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 104 place count 13 transition count 21
Iterating global reduction 2 with 8 rules applied. Total rules applied 112 place count 13 transition count 21
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 116 place count 11 transition count 19
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 117 place count 11 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 120 place count 8 transition count 15
Applied a total of 120 rules in 14 ms. Remains 8 /93 variables (removed 85) and now considering 15/125 (removed 110) transitions.
[2026-05-24 05:10:08] [INFO ] Flow matrix only has 12 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-1027128596449652044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11954152143118617297.kers'
[2026-05-24 05:10:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1027128596449652044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11954152143118617297.kers]
Normalized transition count is 11 out of 12 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 8 cols 18 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-24 05:10:08] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11954152143118617297.kers
Total runtime 1 ms.
[2026-05-24 05:10:08] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 05:10:08] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
[2026-05-24 05:10:08] [INFO ] Invariant cache hit.
[2026-05-24 05:10:08] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2026-05-24 05:10:08] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-24 05:10:08] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
[2026-05-24 05:10:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/19 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/20 variables, and 8 constraints, problems are : Problem set: 0 solved, 8 unsolved in 62 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 4/19 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/20 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 60 ms.
Refiners :[State Equation: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/93 places, 15/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 8/93 places, 15/125 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 49 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-07
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-07 finished in 253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0||X(!p1))) U (G((X((!p0||X(!p1)))||(!p1&&G(!p2))))||(!p1&&(X((!p0||X(!p1)))||G(!p2))))))'
Support contains 6 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 125/125 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 90 transition count 122
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 90 transition count 122
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 87 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 87 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 86 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 86 transition count 118
Applied a total of 14 rules in 20 ms. Remains 86 /93 variables (removed 7) and now considering 118/125 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13947436408057927459.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15786844601022021491.kers'
[2026-05-24 05:10:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13947436408057927459.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15786844601022021491.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 118 rows 85 cols 233 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-24 05:10:08] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15786844601022021491.kers
Total runtime 1 ms.
[2026-05-24 05:10:08] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-24 05:10:08] [INFO ] Invariant cache hit.
[2026-05-24 05:10:08] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-24 05:10:09] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2026-05-24 05:10:09] [INFO ] Invariant cache hit.
[2026-05-24 05:10:09] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/204 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 57/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 0/204 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 144 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2590 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/204 variables, 86/87 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 57/144 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 117/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 261 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2992 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5595ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 5596ms
Starting structural reductions in LTL mode, iteration 1 : 86/93 places, 118/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5745 ms. Remains : 86/93 places, 118/125 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0||X(!p1))) U (G((X((!p0||X(!p1)))||(!p1&&G(!p2))))||(!p1&&(X((!p0||X(!p1)))||G(!p2))))))'
Stuttering acceptance computed with spot in 243 ms :[(AND p0 p1), (AND p0 p1), (AND p1 p2 p0), p1, true, (AND p2 p1), p2]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-08 finished in 6030 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 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 125/125 transitions.
Graph (complete) has 241 edges and 93 vertex of which 89 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 104 edges and 87 vertex of which 77 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Graph (trivial) has 83 edges and 77 vertex of which 40 / 77 are part of one of the 20 SCC in 0 ms
Free SCC test removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 57 transition count 99
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 46 place count 46 transition count 79
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 55 place count 37 transition count 61
Iterating global reduction 2 with 9 rules applied. Total rules applied 64 place count 37 transition count 61
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 28 transition count 43
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 28 transition count 43
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 20 transition count 27
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 20 transition count 27
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 106 place count 12 transition count 19
Iterating global reduction 2 with 8 rules applied. Total rules applied 114 place count 12 transition count 19
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 116 place count 11 transition count 18
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 118 place count 10 transition count 18
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 120 place count 10 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 10 transition count 16
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 9 transition count 15
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 9 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 7 transition count 13
Applied a total of 125 rules in 19 ms. Remains 7 /93 variables (removed 86) and now considering 13/125 (removed 112) transitions.
[2026-05-24 05:10:14] [INFO ] Flow matrix only has 11 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-6333056105006728409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18339109585442289271.kers'
[2026-05-24 05:10:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6333056105006728409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18339109585442289271.kers]
Normalized transition count is 10 out of 11 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 7 cols 17 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 05:10:14] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18339109585442289271.kers
Total runtime 0 ms.
[2026-05-24 05:10:14] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 05:10:14] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
[2026-05-24 05:10:14] [INFO ] Invariant cache hit.
[2026-05-24 05:10:14] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2026-05-24 05:10:14] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-24 05:10:14] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
[2026-05-24 05:10:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/17 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/17 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 7 constraints, problems are : Problem set: 0 solved, 7 unsolved in 58 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4/17 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 14 constraints, problems are : Problem set: 0 solved, 7 unsolved in 58 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/93 places, 13/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 7/93 places, 13/125 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 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-10 finished in 290 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 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 125/125 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 89 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 89 transition count 121
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 85 transition count 117
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 85 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 82 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 82 transition count 114
Applied a total of 22 rules in 12 ms. Remains 82 /93 variables (removed 11) and now considering 114/125 (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-9934764480694587609.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14572485561274689525.kers'
[2026-05-24 05:10:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9934764480694587609.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14572485561274689525.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 114 rows 81 cols 226 entries
Finished phase 1 with 81 SingleSign rule and 0 generalized
[2026-05-24 05:10:15] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14572485561274689525.kers
Total runtime 1 ms.
[2026-05-24 05:10:15] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 05:10:15] [INFO ] Invariant cache hit.
[2026-05-24 05:10:15] [INFO ] State equation strengthened by 56 read => feed constraints.
[2026-05-24 05:10:15] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2026-05-24 05:10:15] [INFO ] Invariant cache hit.
[2026-05-24 05:10:15] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 139 constraints, problems are : Problem set: 0 solved, 113 unsolved in 2408 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 114/196 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 56/139 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 113/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 252 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5459ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 5461ms
Starting structural reductions in LTL mode, iteration 1 : 82/93 places, 114/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5593 ms. Remains : 82/93 places, 114/125 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 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-13
Product exploration explored 100000 steps with 33333 reset in 307 ms.
Product exploration explored 100000 steps with 33333 reset in 182 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 226 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 22 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 28 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-13 finished in 6262 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 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 125/125 transitions.
Graph (complete) has 241 edges and 93 vertex of which 89 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 89 transition count 117
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 85 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 85 transition count 116
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 11 place count 84 transition count 116
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 15 place count 80 transition count 112
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 80 transition count 112
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 63 place count 58 transition count 90
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 73 place count 48 transition count 70
Iterating global reduction 2 with 10 rules applied. Total rules applied 83 place count 48 transition count 70
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 92 place count 39 transition count 52
Iterating global reduction 2 with 9 rules applied. Total rules applied 101 place count 39 transition count 52
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 110 place count 30 transition count 43
Iterating global reduction 2 with 9 rules applied. Total rules applied 119 place count 30 transition count 43
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 128 place count 21 transition count 25
Iterating global reduction 2 with 9 rules applied. Total rules applied 137 place count 21 transition count 25
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 145 place count 13 transition count 17
Iterating global reduction 2 with 8 rules applied. Total rules applied 153 place count 13 transition count 17
Applied a total of 153 rules in 13 ms. Remains 13 /93 variables (removed 80) and now considering 17/125 (removed 108) transitions.
[2026-05-24 05:10:21] [INFO ] Flow matrix only has 15 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-12694074393929667173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7256008848020064717.kers'
[2026-05-24 05:10:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12694074393929667173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7256008848020064717.kers]
Normalized transition count is 14 out of 15 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 14 rows 12 cols 27 entries
Finished phase 1 with 12 SingleSign rule and 0 generalized
[2026-05-24 05:10:21] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7256008848020064717.kers
Total runtime 2 ms.
[2026-05-24 05:10:21] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-24 05:10:21] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
[2026-05-24 05:10:21] [INFO ] Invariant cache hit.
[2026-05-24 05:10:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2026-05-24 05:10:21] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2026-05-24 05:10:21] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2026-05-24 05:10:21] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
[2026-05-24 05:10:21] [INFO ] Invariant cache hit.
[2026-05-24 05:10:21] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 14/27 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 1/28 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/28 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 26 constraints, problems are : Problem set: 0 solved, 16 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 14/27 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/28 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/28 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 42 constraints, problems are : Problem set: 0 solved, 16 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 372ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 372ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/93 places, 17/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 494 ms. Remains : 13/93 places, 17/125 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 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-14
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-14 finished in 613 ms.
All properties solved by simple procedures.
Total runtime 28882 ms.

BK_STOP 1779599422081

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-11a"
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-11a, 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-177955695500315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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