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

--------------------
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-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-11a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779599432930

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-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 05:10:34] [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 05:10:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 05:10:34] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2026-05-24 05:10:34] [INFO ] Transformed 113 places.
[2026-05-24 05:10:34] [INFO ] Transformed 155 transitions.
[2026-05-24 05:10:34] [INFO ] Found NUPN structural information;
[2026-05-24 05:10:34] [INFO ] Parsed PT model containing 113 places and 155 transitions and 498 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 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 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 101 transition count 143
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 101 transition count 143
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 99 transition count 139
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 99 transition count 139
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 37 place count 99 transition count 130
Applied a total of 37 rules in 41 ms. Remains 99 /113 variables (removed 14) and now considering 130/155 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15385950743110036699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9682750666657743685.kers'
[2026-05-24 05:10:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15385950743110036699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9682750666657743685.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 130 rows 97 cols 255 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-24 05:10:34] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9682750666657743685.kers
Total runtime 1 ms.
[2026-05-24 05:10:34] [INFO ] Implicit Places using invariants in 184 ms returned []
[2026-05-24 05:10:34] [INFO ] Invariant cache hit.
[2026-05-24 05:10:34] [INFO ] State equation strengthened by 83 read => feed constraints.
[2026-05-24 05:10:34] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2026-05-24 05:10:34] [INFO ] Invariant cache hit.
[2026-05-24 05:10:34] [INFO ] State equation strengthened by 83 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 130/229 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 83/184 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (OVERLAPS) 0/229 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 184 constraints, problems are : Problem set: 0 solved, 129 unsolved in 4030 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 130/229 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 83/184 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 129/313 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/229 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 313 constraints, problems are : Problem set: 0 solved, 129 unsolved in 4465 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8545ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 8559ms
Starting structural reductions in LTL mode, iteration 1 : 99/113 places, 130/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8978 ms. Remains : 99/113 places, 130/155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 130/130 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2026-05-24 05:10:43] [INFO ] Invariant cache hit.
[2026-05-24 05:10:43] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 05:10:43] [INFO ] Invariant cache hit.
[2026-05-24 05:10:43] [INFO ] State equation strengthened by 83 read => feed constraints.
[2026-05-24 05:10:43] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 99/99 places, 130/130 transitions.
Support contains 34 out of 99 places after structural reductions.
[2026-05-24 05:10:43] [INFO ] Flatten gal took : 28 ms
[2026-05-24 05:10:43] [INFO ] Flatten gal took : 11 ms
[2026-05-24 05:10:43] [INFO ] Input system was already deterministic with 130 transitions.
RANDOM walk for 1620 steps (10 resets) in 140 ms. (11 steps per ms) remains 0/35 properties
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 291 edges and 99 vertex of which 95 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&((!p2 U (p3||G(!p2))) U ((X((!p4&&F(!p2)))&&(!p2 U (p3||G(!p2))))||G((!p2 U (p3||G(!p2)))))))))'
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 130/130 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 92 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 92 transition count 123
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 87 transition count 118
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 87 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 84 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 84 transition count 115
Applied a total of 30 rules in 9 ms. Remains 84 /99 variables (removed 15) and now considering 115/130 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4093522720739128865.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14085610882864691097.kers'
[2026-05-24 05:10:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4093522720739128865.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14085610882864691097.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 115 rows 82 cols 228 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-24 05:10:44] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14085610882864691097.kers
Total runtime 0 ms.
[2026-05-24 05:10:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-24 05:10:44] [INFO ] Invariant cache hit.
[2026-05-24 05:10:44] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:10:44] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2026-05-24 05:10:44] [INFO ] Invariant cache hit.
[2026-05-24 05:10:44] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 115/199 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 78/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 164 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 115/199 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 78/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 114/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 278 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3319 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6377ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 6381ms
Starting structural reductions in LTL mode, iteration 1 : 84/99 places, 115/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6566 ms. Remains : 84/99 places, 115/130 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&((!p2 U (p3||G(!p2))) U ((X((!p4&&F(!p2)))&&(!p2 U (p3||G(!p2))))||G((!p2 U (p3||G(!p2)))))))))'
Stuttering acceptance computed with spot in 464 ms :[(OR (NOT p1) (AND p2 (NOT p3))), (OR (NOT p1) (AND p2 (NOT p3))), true, (NOT p1), (AND p2 (NOT p3)), (AND (NOT p3) p2), p2, (AND p2 (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-00 finished in 7150 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(((p1 U (p2||G(p1)))&&p0)))'
Support contains 5 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 130/130 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 93 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 93 transition count 124
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 89 transition count 120
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 89 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 87 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 87 transition count 118
Applied a total of 24 rules in 16 ms. Remains 87 /99 variables (removed 12) and now considering 118/130 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18244202513768081971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7061951874118346333.kers'
[2026-05-24 05:10:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18244202513768081971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7061951874118346333.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 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:51] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7061951874118346333.kers
Total runtime 0 ms.
[2026-05-24 05:10:51] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 05:10:51] [INFO ] Invariant cache hit.
[2026-05-24 05:10:51] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-24 05:10:51] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2026-05-24 05:10:51] [INFO ] Invariant cache hit.
[2026-05-24 05:10:51] [INFO ] State equation strengthened by 79 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/205 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 0/205 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 168 constraints, problems are : Problem set: 0 solved, 117 unsolved in 2878 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 79/79 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/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/205 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 79/168 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 117/285 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 285 constraints, problems are : Problem set: 0 solved, 117 unsolved in 3558 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6454ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6457ms
Starting structural reductions in LTL mode, iteration 1 : 87/99 places, 118/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6622 ms. Remains : 87/99 places, 118/130 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(((p1 U (p2||G(p1)))&&p0)))'
Stuttering acceptance computed with spot in 129 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 372 ms.
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 269 edges and 87 vertex of which 85 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge based reduction with 10 factoid took 70 ms. Proved property starting from automaton with 4 states, 6 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 82 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-01 finished in 7464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (p1||X(p1))) U X((G(p2)||G(p3)))))'
Support contains 6 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 130/130 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 92 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 92 transition count 123
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 89 transition count 120
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 89 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 87 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 87 transition count 118
Applied a total of 24 rules in 16 ms. Remains 87 /99 variables (removed 12) and now considering 118/130 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7711096061688303065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15122808893869343472.kers'
[2026-05-24 05:10:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7711096061688303065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15122808893869343472.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 118 rows 85 cols 234 entries
Finished phase 1 with 85 SingleSign rule and 0 generalized
[2026-05-24 05:10:58] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15122808893869343472.kers
Total runtime 1 ms.
[2026-05-24 05:10:59] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-24 05:10:59] [INFO ] Invariant cache hit.
[2026-05-24 05:10:59] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-24 05:10:59] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2026-05-24 05:10:59] [INFO ] Invariant cache hit.
[2026-05-24 05:10:59] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/205 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 80/169 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 0/205 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 169 constraints, problems are : Problem set: 0 solved, 117 unsolved in 3288 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 80/80 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/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (OVERLAPS) 118/205 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 80/169 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 117/286 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 286 constraints, problems are : Problem set: 0 solved, 117 unsolved in 3352 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6651ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 6652ms
Starting structural reductions in LTL mode, iteration 1 : 87/99 places, 118/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6797 ms. Remains : 87/99 places, 118/130 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U (X(p1)||p1)) U X((G(p2)||G(p3)))))'
Stuttering acceptance computed with spot in 588 ms :[(AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p0)), (NOT p1), (AND p0 (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) (NOT p2) p3)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-03 finished in 7454 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 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 130/130 transitions.
Graph (complete) has 291 edges and 99 vertex of which 95 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
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 95 transition count 120
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 89 transition count 120
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 21 place count 81 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 29 place count 81 transition count 112
Applied a total of 29 rules in 29 ms. Remains 81 /99 variables (removed 18) and now considering 112/130 (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-9246344612672107282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-600253584158721237.kers'
[2026-05-24 05:11:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9246344612672107282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-600253584158721237.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 112 rows 79 cols 222 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-24 05:11:06] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-600253584158721237.kers
Total runtime 2 ms.
[2026-05-24 05:11:06] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 05:11:06] [INFO ] Invariant cache hit.
[2026-05-24 05:11:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:11:06] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 144 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/99 places, 112/130 transitions.
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 0 with 44 rules applied. Total rules applied 44 place count 58 transition count 90
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 54 place count 48 transition count 70
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 48 transition count 70
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 72 place count 40 transition count 54
Iterating global reduction 0 with 8 rules applied. Total rules applied 80 place count 40 transition count 54
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 88 place count 32 transition count 46
Iterating global reduction 0 with 8 rules applied. Total rules applied 96 place count 32 transition count 46
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 24 transition count 30
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 24 transition count 30
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 120 place count 16 transition count 22
Iterating global reduction 0 with 8 rules applied. Total rules applied 128 place count 16 transition count 22
Applied a total of 128 rules in 13 ms. Remains 16 /80 variables (removed 64) and now considering 22/112 (removed 90) transitions.
[2026-05-24 05:11:06] [INFO ] Flow matrix only has 19 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-11416052802241213450.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11610057596656518391.kers'
[2026-05-24 05:11:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11416052802241213450.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11610057596656518391.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 18 rows 15 cols 34 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-24 05:11:06] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11610057596656518391.kers
Total runtime 1 ms.
[2026-05-24 05:11:06] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-24 05:11:06] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2026-05-24 05:11:06] [INFO ] Invariant cache hit.
[2026-05-24 05:11:06] [INFO ] State equation strengthened by 15 read => feed constraints.
[2026-05-24 05:11:06] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/99 places, 22/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 242 ms. Remains : 16/99 places, 22/130 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 70 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-04 finished in 344 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(G(!p0)) U G(p1)))))'
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 130/130 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 91 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 91 transition count 122
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 86 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 86 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 83 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 83 transition count 114
Applied a total of 32 rules in 11 ms. Remains 83 /99 variables (removed 16) and now considering 114/130 (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-13183598574710432397.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7910165504507684089.kers'
[2026-05-24 05:11:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13183598574710432397.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7910165504507684089.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 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:11:06] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7910165504507684089.kers
Total runtime 1 ms.
[2026-05-24 05:11:06] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-24 05:11:06] [INFO ] Invariant cache hit.
[2026-05-24 05:11:06] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:11:06] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 167 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/99 places, 114/130 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 187 ms. Remains : 82/99 places, 114/130 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(G(!p0)) U G(p1)))))'
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p1), p0]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-05
Product exploration explored 100000 steps with 852 reset in 187 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 25 in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-05 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&G((G(p1)||(p2 U (p3||G(p2)))))))))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 130/130 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 92 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 92 transition count 123
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 88 transition count 119
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 88 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 86 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 86 transition count 117
Applied a total of 26 rules in 5 ms. Remains 86 /99 variables (removed 13) and now considering 117/130 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14818116642454396090.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3284709158725099492.kers'
[2026-05-24 05:11:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14818116642454396090.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3284709158725099492.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 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:11:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3284709158725099492.kers
Total runtime 0 ms.
[2026-05-24 05:11:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-24 05:11:07] [INFO ] Invariant cache hit.
[2026-05-24 05:11:07] [INFO ] State equation strengthened by 79 read => feed constraints.
[2026-05-24 05:11:07] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 139 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/99 places, 117/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 146 ms. Remains : 85/99 places, 117/130 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&G((G(p1)||(p2 U (p3||G(p2)))))))))'
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (AND p1 (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-07
Entered a terminal (fully accepting) state of product in 231 steps with 9 reset in 3 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-07 finished in 443 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((X(X(((p0 U p1)||X(p2))))&&F(p0))))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 130/130 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 92 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 92 transition count 123
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 87 transition count 118
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 87 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 84 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 84 transition count 115
Applied a total of 30 rules in 8 ms. Remains 84 /99 variables (removed 15) and now considering 115/130 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11418134676288625844.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3680130444290472280.kers'
[2026-05-24 05:11:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11418134676288625844.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3680130444290472280.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 115 rows 82 cols 228 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-24 05:11:07] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3680130444290472280.kers
Total runtime 0 ms.
[2026-05-24 05:11:07] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-24 05:11:07] [INFO ] Invariant cache hit.
[2026-05-24 05:11:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:11:07] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2026-05-24 05:11:07] [INFO ] Invariant cache hit.
[2026-05-24 05:11:07] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 115/199 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 78/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 164 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 115/199 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 78/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 114/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 278 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3332 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6524ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 6524ms
Starting structural reductions in LTL mode, iteration 1 : 84/99 places, 115/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6661 ms. Remains : 84/99 places, 115/130 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((X(X(((p0 U p1)||X(p2))))&&F(p0))))'
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-08
Stuttering criterion allowed to conclude after 151 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-08 finished in 7049 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(X(F(p0))))||p1))||X(G(p1))) U X(p1)))'
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 130/130 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 91 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 91 transition count 122
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 86 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 86 transition count 117
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 83 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 83 transition count 114
Applied a total of 32 rules in 8 ms. Remains 83 /99 variables (removed 16) and now considering 114/130 (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-7677814986672255750.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1001045344585047276.kers'
[2026-05-24 05:11:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7677814986672255750.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1001045344585047276.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 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:11:14] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1001045344585047276.kers
Total runtime 1 ms.
[2026-05-24 05:11:14] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 05:11:14] [INFO ] Invariant cache hit.
[2026-05-24 05:11:14] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:11:14] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 150 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/99 places, 114/130 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 163 ms. Remains : 82/99 places, 114/130 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(X(F(p0))))||p1))||X(G(p1))) U X(p1)))'
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-09
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-09 finished in 332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 130/130 transitions.
Graph (complete) has 291 edges and 99 vertex of which 95 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 2 places and 0 transitions.
Graph (complete) has 108 edges and 92 vertex of which 77 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Graph (trivial) has 86 edges and 77 vertex of which 44 / 77 are part of one of the 22 SCC in 5 ms
Free SCC test removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 55 transition count 100
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 47 place count 45 transition count 78
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 57 place count 35 transition count 58
Iterating global reduction 2 with 10 rules applied. Total rules applied 67 place count 35 transition count 58
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 26 transition count 40
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 26 transition count 40
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 94 place count 17 transition count 22
Iterating global reduction 2 with 9 rules applied. Total rules applied 103 place count 17 transition count 22
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 112 place count 8 transition count 13
Iterating global reduction 2 with 9 rules applied. Total rules applied 121 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 123 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 125 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 127 place count 5 transition count 8
Applied a total of 127 rules in 25 ms. Remains 5 /99 variables (removed 94) and now considering 8/130 (removed 122) transitions.
[2026-05-24 05:11:15] [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-6549725335288121382.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18168184011923362300.kers'
[2026-05-24 05:11:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6549725335288121382.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18168184011923362300.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 05:11:15] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18168184011923362300.kers
Total runtime 0 ms.
[2026-05-24 05:11:15] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-24 05:11:15] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 05:11:15] [INFO ] Invariant cache hit.
[2026-05-24 05:11:15] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2026-05-24 05:11:15] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2026-05-24 05:11:15] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2026-05-24 05:11:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 36 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 43 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 81ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/99 places, 8/130 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 5/99 places, 8/130 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-10
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-10 finished in 205 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||(p0 U !p1)))))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 130/130 transitions.
Graph (complete) has 291 edges and 99 vertex of which 95 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
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 95 transition count 120
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 89 transition count 120
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 21 place count 81 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 29 place count 81 transition count 112
Applied a total of 29 rules in 22 ms. Remains 81 /99 variables (removed 18) and now considering 112/130 (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-17433514223251084807.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6725608310867498541.kers'
[2026-05-24 05:11:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17433514223251084807.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6725608310867498541.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 112 rows 79 cols 222 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-24 05:11:15] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6725608310867498541.kers
Total runtime 0 ms.
[2026-05-24 05:11:15] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-24 05:11:15] [INFO ] Invariant cache hit.
[2026-05-24 05:11:15] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:11:15] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2026-05-24 05:11:15] [INFO ] Redundant transitions in 6 ms returned []
Running 111 sub problems to find dead transitions.
[2026-05-24 05:11:15] [INFO ] Invariant cache hit.
[2026-05-24 05:11:15] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 112/193 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 78/161 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 0/193 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 161 constraints, problems are : Problem set: 0 solved, 111 unsolved in 3282 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 112/193 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 78/161 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 111/272 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 272 constraints, problems are : Problem set: 0 solved, 111 unsolved in 3033 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6323ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 6324ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/99 places, 112/130 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6498 ms. Remains : 81/99 places, 112/130 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 U !p1)||p0))))'
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-12
Product exploration explored 100000 steps with 1947 reset in 173 ms.
Stack based approach found an accepted trace after 376 steps with 11 reset with depth 10 and stack size 10 in 2 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-12 finished in 6799 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(F((p0&&X(X(X(F(p1)))))))))))'
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 130/130 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 92 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 92 transition count 123
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 87 transition count 118
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 87 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 84 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 84 transition count 115
Applied a total of 30 rules in 4 ms. Remains 84 /99 variables (removed 15) and now considering 115/130 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4802992588870463907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13996446973766400953.kers'
[2026-05-24 05:11:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4802992588870463907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13996446973766400953.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 115 rows 82 cols 228 entries
Finished phase 1 with 82 SingleSign rule and 0 generalized
[2026-05-24 05:11:22] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13996446973766400953.kers
Total runtime 1 ms.
[2026-05-24 05:11:22] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 05:11:22] [INFO ] Invariant cache hit.
[2026-05-24 05:11:22] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:11:22] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2026-05-24 05:11:22] [INFO ] Invariant cache hit.
[2026-05-24 05:11:22] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 115/199 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 78/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 164 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 115/199 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 78/164 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 114/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 278 constraints, problems are : Problem set: 0 solved, 114 unsolved in 3289 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6437ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 6437ms
Starting structural reductions in LTL mode, iteration 1 : 84/99 places, 115/130 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6581 ms. Remains : 84/99 places, 115/130 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(F((p0&&X(X(X(F(p1)))))))))))'
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-13
Stuttering criterion allowed to conclude after 222 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-13 finished in 6881 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(((G(F(p1))||(p2 U p3)) U (p0&&(G(F(p1))||(p2 U p3))))))))'
Support contains 1 out of 99 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 130/130 transitions.
Graph (complete) has 291 edges and 99 vertex of which 95 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
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 95 transition count 120
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 89 transition count 120
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 21 place count 81 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 29 place count 81 transition count 112
Applied a total of 29 rules in 7 ms. Remains 81 /99 variables (removed 18) and now considering 112/130 (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-5600267963594604827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13945497083622498915.kers'
[2026-05-24 05:11:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5600267963594604827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13945497083622498915.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 112 rows 79 cols 222 entries
Finished phase 1 with 79 SingleSign rule and 0 generalized
[2026-05-24 05:11:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13945497083622498915.kers
Total runtime 1 ms.
[2026-05-24 05:11:29] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 05:11:29] [INFO ] Invariant cache hit.
[2026-05-24 05:11:29] [INFO ] State equation strengthened by 78 read => feed constraints.
[2026-05-24 05:11:29] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [80]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 145 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/99 places, 112/130 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 60 transition count 92
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 52 transition count 76
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 52 transition count 76
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 45 transition count 62
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 45 transition count 62
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 38 transition count 55
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 38 transition count 55
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 31 transition count 41
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 31 transition count 41
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 24 transition count 34
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 24 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 113 place count 24 transition count 34
Applied a total of 113 rules in 8 ms. Remains 24 /80 variables (removed 56) and now considering 34/112 (removed 78) transitions.
[2026-05-24 05:11:29] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7395755222875626997.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4425729827983547097.kers'
[2026-05-24 05:11:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7395755222875626997.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4425729827983547097.kers]
Normalized transition count is 29 out of 30 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 23 cols 56 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-24 05:11:29] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4425729827983547097.kers
Total runtime 0 ms.
[2026-05-24 05:11:29] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-24 05:11:29] [INFO ] Flow matrix only has 30 transitions (discarded 4 similar events)
[2026-05-24 05:11:29] [INFO ] Invariant cache hit.
[2026-05-24 05:11:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2026-05-24 05:11:29] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/99 places, 34/130 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 24/99 places, 34/130 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(((G(F(p1))||(p2 U p3)) U (p0&&(G(F(p1))||(p2 U p3))))))))'
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-14 finished in 280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(F(G((!p1||X((X(G(p2)) U (!p1&&X(G(p2)))))))) U p2)))'
Support contains 4 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 130/130 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 93 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 93 transition count 124
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 90 transition count 121
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 90 transition count 121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 88 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 88 transition count 119
Applied a total of 22 rules in 7 ms. Remains 88 /99 variables (removed 11) and now considering 119/130 (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-18007589884047594599.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17545682316873286974.kers'
[2026-05-24 05:11:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18007589884047594599.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17545682316873286974.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 119 rows 86 cols 235 entries
Finished phase 1 with 86 SingleSign rule and 0 generalized
[2026-05-24 05:11:29] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17545682316873286974.kers
Total runtime 1 ms.
[2026-05-24 05:11:29] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 05:11:29] [INFO ] Invariant cache hit.
[2026-05-24 05:11:29] [INFO ] State equation strengthened by 80 read => feed constraints.
[2026-05-24 05:11:29] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 157 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 87/99 places, 119/130 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 87/99 places, 119/130 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(F(G((!p1||X((X(G(p2)) U (!p1&&X(G(p2)))))))) U p2)))'
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), p1, (NOT p2), p1, true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLFireability-15
Product exploration explored 100000 steps with 1253 reset in 127 ms.
Stack based approach found an accepted trace after 6333 steps with 67 reset with depth 87 and stack size 81 in 8 ms.
FORMULA DiscoveryGPU-PT-11a-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLFireability-15 finished in 661 ms.
All properties solved by simple procedures.
Total runtime 55859 ms.

BK_STOP 1779599490020

--------------------
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-11a"
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-11a, 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-177955695500316"
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 [ "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 ;