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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K Mar 6 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 6 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 6 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 6 16:45 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.7K Mar 15 09:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 6 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 6 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 6 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:16 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 53K 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-15a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-15a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779605857997

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-15a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 06:57:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 06:57:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 06:57:39] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2026-05-24 06:57:39] [INFO ] Transformed 153 places.
[2026-05-24 06:57:39] [INFO ] Transformed 211 transitions.
[2026-05-24 06:57:39] [INFO ] Found NUPN structural information;
[2026-05-24 06:57:39] [INFO ] Parsed PT model containing 153 places and 211 transitions and 678 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-15a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 211/211 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 143 transition count 201
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 143 transition count 201
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 136 transition count 194
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 136 transition count 194
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 130 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 130 transition count 182
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 55 place count 130 transition count 173
Applied a total of 55 rules in 48 ms. Remains 130 /153 variables (removed 23) and now considering 173/211 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12296298397168166837.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13150183889306179038.kers'
[2026-05-24 06:57:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12296298397168166837.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13150183889306179038.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 173 rows 128 cols 340 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-24 06:57:39] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13150183889306179038.kers
Total runtime 1 ms.
[2026-05-24 06:57:39] [INFO ] Implicit Places using invariants in 203 ms returned []
[2026-05-24 06:57:39] [INFO ] Invariant cache hit.
[2026-05-24 06:57:39] [INFO ] State equation strengthened by 113 read => feed constraints.
[2026-05-24 06:57:39] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2026-05-24 06:57:39] [INFO ] Invariant cache hit.
[2026-05-24 06:57:39] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 173/303 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 113/245 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 0/303 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 245 constraints, problems are : Problem set: 0 solved, 172 unsolved in 6521 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 130/130 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 173/303 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 113/245 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 172/417 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 417 constraints, problems are : Problem set: 0 solved, 172 unsolved in 7118 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 130/130 constraints, ReadFeed: 113/113 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13687ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 13703ms
Starting structural reductions in LTL mode, iteration 1 : 130/153 places, 173/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14189 ms. Remains : 130/153 places, 173/211 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2026-05-24 06:57:53] [INFO ] Invariant cache hit.
[2026-05-24 06:57:53] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-24 06:57:53] [INFO ] Invariant cache hit.
[2026-05-24 06:57:53] [INFO ] State equation strengthened by 113 read => feed constraints.
[2026-05-24 06:57:53] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 130/130 places, 173/173 transitions.
Support contains 28 out of 130 places after structural reductions.
[2026-05-24 06:57:54] [INFO ] Flatten gal took : 29 ms
[2026-05-24 06:57:54] [INFO ] Flatten gal took : 12 ms
[2026-05-24 06:57:54] [INFO ] Input system was already deterministic with 173 transitions.
RANDOM walk for 3223 steps (18 resets) in 141 ms. (22 steps per ms) remains 0/27 properties
Computed a total of 18 stabilizing places and 16 stable transitions
Graph (complete) has 388 edges and 130 vertex of which 125 are kept as prefixes of interest. Removing 5 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((!F(p0)||(!G(X(!p1))&&X(p2)))) U p2))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 123 transition count 166
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 123 transition count 166
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 117 transition count 160
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 117 transition count 160
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 114 transition count 157
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 114 transition count 157
Applied a total of 32 rules in 16 ms. Remains 114 /130 variables (removed 16) and now considering 157/173 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1263735876664800817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7697314844270716418.kers'
[2026-05-24 06:57:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1263735876664800817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7697314844270716418.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 157 rows 112 cols 311 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-24 06:57:54] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7697314844270716418.kers
Total runtime 0 ms.
[2026-05-24 06:57:54] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 06:57:54] [INFO ] Invariant cache hit.
[2026-05-24 06:57:54] [INFO ] State equation strengthened by 107 read => feed constraints.
[2026-05-24 06:57:54] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2026-05-24 06:57:54] [INFO ] Invariant cache hit.
[2026-05-24 06:57:54] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 157/271 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 107/223 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 156 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 223 constraints, problems are : Problem set: 0 solved, 156 unsolved in 5133 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 157/271 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 107/223 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 156/379 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/271 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 379 constraints, problems are : Problem set: 0 solved, 156 unsolved in 5915 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11065ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 11067ms
Starting structural reductions in LTL mode, iteration 1 : 114/130 places, 157/173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11263 ms. Remains : 114/130 places, 157/173 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!F(p0)||(!G(X(!p1))&&X(p2)))) U p2))'
Stuttering acceptance computed with spot in 447 ms :[(NOT p2), (OR (NOT p2) (AND p0 (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), true, (NOT p1), p0, (AND (NOT p1) p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 261 steps with 1 reset in 7 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-00 finished in 11818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Graph (complete) has 388 edges and 130 vertex of which 125 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 144 edges and 122 vertex of which 106 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Graph (trivial) has 117 edges and 106 vertex of which 58 / 106 are part of one of the 29 SCC in 1 ms
Free SCC test removed 29 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 77 transition count 137
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 63 place count 63 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 62 transition count 107
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 77 place count 49 transition count 81
Iterating global reduction 3 with 13 rules applied. Total rules applied 90 place count 49 transition count 81
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 103 place count 36 transition count 55
Iterating global reduction 3 with 13 rules applied. Total rules applied 116 place count 36 transition count 55
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 128 place count 24 transition count 31
Iterating global reduction 3 with 12 rules applied. Total rules applied 140 place count 24 transition count 31
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 152 place count 12 transition count 19
Iterating global reduction 3 with 12 rules applied. Total rules applied 164 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 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 3 with 2 rules applied. Total rules applied 168 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 3 with 2 rules applied. Total rules applied 170 place count 10 transition count 16
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 173 place count 7 transition count 13
Applied a total of 173 rules in 36 ms. Remains 7 /130 variables (removed 123) and now considering 13/173 (removed 160) transitions.
[2026-05-24 06:58:06] [INFO ] Flow matrix only has 10 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-13486312929260367009.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17781644060460243454.kers'
[2026-05-24 06:58:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13486312929260367009.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17781644060460243454.kers]
Normalized transition count is 9 out of 10 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 9 rows 7 cols 15 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-24 06:58:06] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17781644060460243454.kers
Total runtime 0 ms.
[2026-05-24 06:58:06] [INFO ] Implicit Places using invariants in 15 ms returned []
[2026-05-24 06:58:06] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2026-05-24 06:58:06] [INFO ] Invariant cache hit.
[2026-05-24 06:58:06] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2026-05-24 06:58:06] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-24 06:58:06] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2026-05-24 06:58:06] [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) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4/16 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/17 variables, and 7 constraints, problems are : Problem set: 0 solved, 7 unsolved in 61 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) 8/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 4/16 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/17 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 121ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/130 places, 13/173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 7/130 places, 13/173 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-01 finished in 279 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((p1||G(p2)))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 123 transition count 166
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 123 transition count 166
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 117 transition count 160
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 117 transition count 160
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 113 transition count 156
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 113 transition count 156
Applied a total of 34 rules in 20 ms. Remains 113 /130 variables (removed 17) and now considering 156/173 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7591876591270466000.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17164175397351700171.kers'
[2026-05-24 06:58:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7591876591270466000.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17164175397351700171.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 156 rows 111 cols 310 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-24 06:58:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17164175397351700171.kers
Total runtime 0 ms.
[2026-05-24 06:58:06] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 06:58:06] [INFO ] Invariant cache hit.
[2026-05-24 06:58:06] [INFO ] State equation strengthened by 107 read => feed constraints.
[2026-05-24 06:58:06] [INFO ] Implicit Places using invariants and state equation in 143 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 186 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/130 places, 156/173 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 156/156 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 210 ms. Remains : 112/130 places, 156/173 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((p1||G(p2)))))'
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 377 ms.
Product exploration explored 100000 steps with 50000 reset in 243 ms.
Computed a total of 17 stabilizing places and 16 stable transitions
Graph (complete) has 309 edges and 112 vertex of which 111 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 16 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 24 ms. Proved property starting from automaton with 3 states, 4 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 30 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-02 finished in 1011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U X((X((!p0 U X(!p0)))||G(p2)))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 122 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 122 transition count 165
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 115 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 115 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 111 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 111 transition count 154
Applied a total of 38 rules in 13 ms. Remains 111 /130 variables (removed 19) and now considering 154/173 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12796166848369500081.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7040774840817621452.kers'
[2026-05-24 06:58:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12796166848369500081.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7040774840817621452.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 154 rows 109 cols 306 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 06:58:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7040774840817621452.kers
Total runtime 1 ms.
[2026-05-24 06:58:07] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-24 06:58:07] [INFO ] Invariant cache hit.
[2026-05-24 06:58:07] [INFO ] State equation strengthened by 106 read => feed constraints.
[2026-05-24 06:58:08] [INFO ] Implicit Places using invariants and state equation in 153 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 211 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/130 places, 154/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 110 /110 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 231 ms. Remains : 110/130 places, 154/173 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1)) U X((X((!p0 U X(!p0)))||G(p2)))))'
Stuttering acceptance computed with spot in 1117 ms :[(AND p0 (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), p0, (AND p0 (NOT p2)), p0, p0, true, (AND (NOT p1) (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-07 finished in 1412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 122 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 122 transition count 165
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 115 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 115 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 111 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 111 transition count 154
Applied a total of 38 rules in 12 ms. Remains 111 /130 variables (removed 19) and now considering 154/173 (removed 19) transitions.
[2026-05-24 06:58:09] [INFO ] Invariant cache hit.
[2026-05-24 06:58:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-24 06:58:09] [INFO ] Invariant cache hit.
[2026-05-24 06:58:09] [INFO ] State equation strengthened by 106 read => feed constraints.
[2026-05-24 06:58:09] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 199 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/130 places, 154/173 transitions.
Applied a total of 0 rules in 4 ms. Remains 110 /110 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 215 ms. Remains : 110/130 places, 154/173 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-08 finished in 368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(X((p1&&G(F(p2)))))))))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 125 transition count 168
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 125 transition count 168
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 121 transition count 164
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 121 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 120 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 120 transition count 163
Applied a total of 20 rules in 12 ms. Remains 120 /130 variables (removed 10) and now considering 163/173 (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-4525293854567903951.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7387280948104933128.kers'
[2026-05-24 06:58:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4525293854567903951.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7387280948104933128.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 163 rows 118 cols 321 entries
Finished phase 1 with 118 SingleSign rule and 0 generalized
[2026-05-24 06:58:09] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7387280948104933128.kers
Total runtime 1 ms.
[2026-05-24 06:58:09] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 06:58:09] [INFO ] Invariant cache hit.
[2026-05-24 06:58:09] [INFO ] State equation strengthened by 109 read => feed constraints.
[2026-05-24 06:58:09] [INFO ] Implicit Places using invariants and state equation in 171 ms returned [119]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 224 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/130 places, 163/173 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 240 ms. Remains : 119/130 places, 163/173 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(X((p1&&G(F(p2)))))))))'
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-09
Stuttering criterion allowed to conclude after 159 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-09 finished in 554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(((!p1||X(!p2)) U (G((!p1||X(!p2)))||(!p3&&(!p1||X(!p2)))))))))'
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 122 transition count 165
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 122 transition count 165
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 115 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 115 transition count 158
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 111 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 111 transition count 154
Applied a total of 38 rules in 9 ms. Remains 111 /130 variables (removed 19) and now considering 154/173 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1831526585376304986.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5992061175835413668.kers'
[2026-05-24 06:58:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1831526585376304986.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5992061175835413668.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 154 rows 109 cols 306 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 06:58:10] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5992061175835413668.kers
Total runtime 0 ms.
[2026-05-24 06:58:10] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-24 06:58:10] [INFO ] Invariant cache hit.
[2026-05-24 06:58:10] [INFO ] State equation strengthened by 106 read => feed constraints.
[2026-05-24 06:58:10] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 153 sub problems to find dead transitions.
[2026-05-24 06:58:10] [INFO ] Invariant cache hit.
[2026-05-24 06:58:10] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 154/265 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 106/219 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 153 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 219 constraints, problems are : Problem set: 0 solved, 153 unsolved in 5113 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 154/265 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 106/219 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 153/372 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 372 constraints, problems are : Problem set: 0 solved, 153 unsolved in 5536 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 153/153 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10662ms problems are : Problem set: 0 solved, 153 unsolved
Search for dead transitions found 0 dead transitions in 10663ms
Starting structural reductions in LTL mode, iteration 1 : 111/130 places, 154/173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10826 ms. Remains : 111/130 places, 154/173 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(((!p1||X(!p2)) U (G((!p1||X(!p2)))||(!p3&&(!p1||X(!p2)))))))))'
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND p1 p2), (AND (NOT p0) p1 p2), p2, true, (AND (NOT p0) p2), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 556 steps with 140 reset in 6 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-10 finished in 11160 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 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Graph (complete) has 388 edges and 130 vertex of which 125 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 144 edges and 122 vertex of which 105 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Graph (trivial) has 118 edges and 105 vertex of which 60 / 105 are part of one of the 30 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 75 transition count 136
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 63 place count 61 transition count 106
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 77 place count 47 transition count 78
Iterating global reduction 2 with 14 rules applied. Total rules applied 91 place count 47 transition count 78
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 104 place count 34 transition count 52
Iterating global reduction 2 with 13 rules applied. Total rules applied 117 place count 34 transition count 52
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 130 place count 21 transition count 26
Iterating global reduction 2 with 13 rules applied. Total rules applied 143 place count 21 transition count 26
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 156 place count 8 transition count 13
Iterating global reduction 2 with 13 rules applied. Total rules applied 169 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 171 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 173 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 175 place count 5 transition count 8
Applied a total of 175 rules in 12 ms. Remains 5 /130 variables (removed 125) and now considering 8/173 (removed 165) transitions.
[2026-05-24 06:58:21] [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-12406417216327184264.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4649872928361523629.kers'
[2026-05-24 06:58:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12406417216327184264.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4649872928361523629.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 06:58:21] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4649872928361523629.kers
Total runtime 0 ms.
[2026-05-24 06:58:21] [INFO ] Implicit Places using invariants in 13 ms returned []
[2026-05-24 06:58:21] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 06:58:21] [INFO ] Invariant cache hit.
[2026-05-24 06:58:21] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2026-05-24 06:58:21] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 06:58:21] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 06:58:21] [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 33 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 54 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 87ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/130 places, 8/173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 5/130 places, 8/173 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 33 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-11 finished in 194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)&&(X(F(p1))||F(p2))) U !p3)&&F(p4)))'
Support contains 7 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Graph (complete) has 388 edges and 130 vertex of which 125 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 125 transition count 162
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 119 transition count 162
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 113 transition count 156
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 113 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 27 place count 112 transition count 155
Applied a total of 27 rules in 26 ms. Remains 112 /130 variables (removed 18) and now considering 155/173 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12592392563010173360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10129854535451700107.kers'
[2026-05-24 06:58:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12592392563010173360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10129854535451700107.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 155 rows 110 cols 307 entries
Finished phase 1 with 110 SingleSign rule and 0 generalized
[2026-05-24 06:58:21] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10129854535451700107.kers
Total runtime 1 ms.
[2026-05-24 06:58:21] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 06:58:21] [INFO ] Invariant cache hit.
[2026-05-24 06:58:21] [INFO ] State equation strengthened by 107 read => feed constraints.
[2026-05-24 06:58:21] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2026-05-24 06:58:21] [INFO ] Redundant transitions in 5 ms returned []
Running 154 sub problems to find dead transitions.
[2026-05-24 06:58:21] [INFO ] Invariant cache hit.
[2026-05-24 06:58:21] [INFO ] State equation strengthened by 107 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/267 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 107/221 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (OVERLAPS) 0/267 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 221 constraints, problems are : Problem set: 0 solved, 154 unsolved in 4853 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 155/267 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 107/221 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 154/375 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 375 constraints, problems are : Problem set: 0 solved, 154 unsolved in 5504 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 107/107 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10367ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 10367ms
Starting structural reductions in SI_LTL mode, iteration 1 : 112/130 places, 155/173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10542 ms. Remains : 112/130 places, 155/173 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)&&(X(F(p1))||F(p2))) U !p3)&&F(p4)))'
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p4) p3), (NOT p0), p3, (NOT p4), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-13
Product exploration explored 100000 steps with 1544 reset in 220 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-13 finished in 11019 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 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Graph (complete) has 388 edges and 130 vertex of which 125 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 125 transition count 161
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 118 transition count 161
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 111 transition count 154
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 111 transition count 154
Applied a total of 29 rules in 13 ms. Remains 111 /130 variables (removed 19) and now considering 154/173 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3864137878794599877.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1775904732707812872.kers'
[2026-05-24 06:58:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3864137878794599877.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1775904732707812872.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 154 rows 109 cols 305 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-24 06:58:32] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1775904732707812872.kers
Total runtime 0 ms.
[2026-05-24 06:58:32] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 06:58:32] [INFO ] Invariant cache hit.
[2026-05-24 06:58:32] [INFO ] State equation strengthened by 107 read => feed constraints.
[2026-05-24 06:58:32] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 201 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/130 places, 154/173 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 80 transition count 124
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 73 place count 67 transition count 98
Iterating global reduction 0 with 13 rules applied. Total rules applied 86 place count 67 transition count 98
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 99 place count 54 transition count 72
Iterating global reduction 0 with 13 rules applied. Total rules applied 112 place count 54 transition count 72
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 125 place count 41 transition count 59
Iterating global reduction 0 with 13 rules applied. Total rules applied 138 place count 41 transition count 59
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 151 place count 28 transition count 33
Iterating global reduction 0 with 13 rules applied. Total rules applied 164 place count 28 transition count 33
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 177 place count 15 transition count 20
Iterating global reduction 0 with 13 rules applied. Total rules applied 190 place count 15 transition count 20
Applied a total of 190 rules in 16 ms. Remains 15 /110 variables (removed 95) and now considering 20/154 (removed 134) transitions.
[2026-05-24 06:58:32] [INFO ] Flow matrix only has 17 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-7291089619202894719.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15354342700207437557.kers'
[2026-05-24 06:58:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7291089619202894719.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15354342700207437557.kers]
Normalized transition count is 16 out of 17 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 16 rows 14 cols 29 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-24 06:58:32] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15354342700207437557.kers
Total runtime 0 ms.
[2026-05-24 06:58:32] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-24 06:58:32] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
[2026-05-24 06:58:32] [INFO ] Invariant cache hit.
[2026-05-24 06:58:32] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-24 06:58:32] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/130 places, 20/173 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 276 ms. Remains : 15/130 places, 20/173 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 35 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-14 finished in 339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 173/173 transitions.
Graph (complete) has 388 edges and 130 vertex of which 125 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 1 place count 125 transition count 160
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 117 transition count 160
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 25 place count 109 transition count 152
Iterating global reduction 0 with 8 rules applied. Total rules applied 33 place count 109 transition count 152
Applied a total of 33 rules in 21 ms. Remains 109 /130 variables (removed 21) and now considering 152/173 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6731579502567318712.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11203928729705990835.kers'
[2026-05-24 06:58:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6731579502567318712.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11203928729705990835.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 152 rows 107 cols 302 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-24 06:58:32] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11203928729705990835.kers
Total runtime 0 ms.
[2026-05-24 06:58:32] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 06:58:32] [INFO ] Invariant cache hit.
[2026-05-24 06:58:32] [INFO ] State equation strengthened by 106 read => feed constraints.
[2026-05-24 06:58:33] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 209 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/130 places, 152/173 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 58 place count 79 transition count 123
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 72 place count 65 transition count 95
Iterating global reduction 0 with 14 rules applied. Total rules applied 86 place count 65 transition count 95
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 99 place count 52 transition count 69
Iterating global reduction 0 with 13 rules applied. Total rules applied 112 place count 52 transition count 69
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 125 place count 39 transition count 56
Iterating global reduction 0 with 13 rules applied. Total rules applied 138 place count 39 transition count 56
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 150 place count 27 transition count 32
Iterating global reduction 0 with 12 rules applied. Total rules applied 162 place count 27 transition count 32
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 174 place count 15 transition count 20
Iterating global reduction 0 with 12 rules applied. Total rules applied 186 place count 15 transition count 20
Applied a total of 186 rules in 14 ms. Remains 15 /108 variables (removed 93) and now considering 20/152 (removed 132) transitions.
[2026-05-24 06:58:33] [INFO ] Flow matrix only has 18 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-5042781939241948943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1299203673729326138.kers'
[2026-05-24 06:58:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5042781939241948943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1299203673729326138.kers]
Normalized transition count is 17 out of 18 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 17 rows 14 cols 33 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-24 06:58:33] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1299203673729326138.kers
Total runtime 0 ms.
[2026-05-24 06:58:33] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-24 06:58:33] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2026-05-24 06:58:33] [INFO ] Invariant cache hit.
[2026-05-24 06:58:33] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-24 06:58:33] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/130 places, 20/173 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 293 ms. Remains : 15/130 places, 20/173 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-15a-LTLFireability-15
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-15a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-15a-LTLFireability-15 finished in 416 ms.
All properties solved by simple procedures.
Total runtime 54125 ms.

BK_STOP 1779605913290

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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