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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 8.6K Mar 6 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 6 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 6 16:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 6 16:24 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.3K Mar 15 09:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 09:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 09:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 16:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 6 16:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 6 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 6 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:15 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 50K 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-14a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779603414871

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-14a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 06:16:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 06:16:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 06:16:56] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2026-05-24 06:16:56] [INFO ] Transformed 143 places.
[2026-05-24 06:16:56] [INFO ] Transformed 197 transitions.
[2026-05-24 06:16:56] [INFO ] Found NUPN structural information;
[2026-05-24 06:16:56] [INFO ] Parsed PT model containing 143 places and 197 transitions and 633 arcs in 171 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-14a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 197/197 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 131 transition count 185
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 131 transition count 185
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 36 place count 119 transition count 173
Iterating global reduction 0 with 12 rules applied. Total rules applied 48 place count 119 transition count 173
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 58 place count 109 transition count 153
Iterating global reduction 0 with 10 rules applied. Total rules applied 68 place count 109 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 109 transition count 149
Applied a total of 72 rules in 47 ms. Remains 109 /143 variables (removed 34) and now considering 149/197 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11612324160379231685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10259672016992520802.kers'
[2026-05-24 06:16:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11612324160379231685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10259672016992520802.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 149 rows 107 cols 295 entries
Finished phase 1 with 107 SingleSign rule and 0 generalized
[2026-05-24 06:16:56] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10259672016992520802.kers
Total runtime 1 ms.
[2026-05-24 06:16:56] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-24 06:16:56] [INFO ] Invariant cache hit.
[2026-05-24 06:16:56] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-05-24 06:16:56] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 148 sub problems to find dead transitions.
[2026-05-24 06:16:56] [INFO ] Invariant cache hit.
[2026-05-24 06:16:56] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/258 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 100/211 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 148 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 211 constraints, problems are : Problem set: 0 solved, 148 unsolved in 5519 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/258 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 100/211 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 148/359 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 359 constraints, problems are : Problem set: 0 solved, 148 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 109/109 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10649ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 10663ms
Starting structural reductions in LTL mode, iteration 1 : 109/143 places, 149/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11153 ms. Remains : 109/143 places, 149/197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 149/149 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2026-05-24 06:17:07] [INFO ] Invariant cache hit.
[2026-05-24 06:17:07] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-24 06:17:07] [INFO ] Invariant cache hit.
[2026-05-24 06:17:07] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-05-24 06:17:07] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 109/109 places, 149/149 transitions.
Support contains 28 out of 109 places after structural reductions.
[2026-05-24 06:17:07] [INFO ] Flatten gal took : 28 ms
[2026-05-24 06:17:07] [INFO ] Flatten gal took : 12 ms
[2026-05-24 06:17:07] [INFO ] Input system was already deterministic with 149 transitions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 5426 steps (35 resets) in 217 ms. (24 steps per ms) remains 0/32 properties
FORMULA DiscoveryGPU-PT-14a-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 17 stabilizing places and 15 stable transitions
Graph (complete) has 340 edges and 109 vertex of which 107 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 149/149 transitions.
Graph (complete) has 340 edges and 109 vertex of which 107 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 107 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 106 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 104 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 104 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 103 transition count 143
Applied a total of 9 rules in 28 ms. Remains 103 /109 variables (removed 6) and now considering 143/149 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17761616931962965798.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3826111225907677822.kers'
[2026-05-24 06:17:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17761616931962965798.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3826111225907677822.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 143 rows 101 cols 284 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-24 06:17:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3826111225907677822.kers
Total runtime 0 ms.
[2026-05-24 06:17:08] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-24 06:17:08] [INFO ] Invariant cache hit.
[2026-05-24 06:17:08] [INFO ] State equation strengthened by 99 read => feed constraints.
[2026-05-24 06:17:08] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2026-05-24 06:17:08] [INFO ] Redundant transitions in 3 ms returned []
Running 142 sub problems to find dead transitions.
[2026-05-24 06:17:08] [INFO ] Invariant cache hit.
[2026-05-24 06:17:08] [INFO ] State equation strengthened by 99 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 143/246 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 99/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 204 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4575 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 143/246 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 99/204 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 142/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/246 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 346 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4944 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9534ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 9536ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/109 places, 143/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9799 ms. Remains : 103/109 places, 143/149 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-01
Stuttering criterion allowed to conclude after 134 steps with 0 reset in 6 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-01 finished in 10161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 149/149 transitions.
Graph (complete) has 340 edges and 109 vertex of which 107 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 107 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 106 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 104 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 104 transition count 144
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 103 transition count 143
Applied a total of 9 rules in 18 ms. Remains 103 /109 variables (removed 6) and now considering 143/149 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6617900356831585948.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13575384592827039739.kers'
[2026-05-24 06:17:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6617900356831585948.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13575384592827039739.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 143 rows 101 cols 284 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-24 06:17:18] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13575384592827039739.kers
Total runtime 0 ms.
[2026-05-24 06:17:18] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-24 06:17:18] [INFO ] Invariant cache hit.
[2026-05-24 06:17:18] [INFO ] State equation strengthened by 99 read => feed constraints.
[2026-05-24 06:17:18] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2026-05-24 06:17:18] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/109 places, 143/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 103/109 places, 143/149 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-14a-LTLFireability-02
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-02 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(G(p1))||p0)))))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 149/149 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 106 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 106 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 105 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 105 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 104 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 104 transition count 144
Applied a total of 10 rules in 12 ms. Remains 104 /109 variables (removed 5) and now considering 144/149 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13780282681300771155.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3850216502892770744.kers'
[2026-05-24 06:17:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13780282681300771155.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3850216502892770744.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 144 rows 102 cols 286 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-24 06:17:18] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3850216502892770744.kers
Total runtime 0 ms.
[2026-05-24 06:17:18] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 06:17:18] [INFO ] Invariant cache hit.
[2026-05-24 06:17:18] [INFO ] State equation strengthened by 99 read => feed constraints.
[2026-05-24 06:17:19] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2026-05-24 06:17:19] [INFO ] Invariant cache hit.
[2026-05-24 06:17:19] [INFO ] State equation strengthened by 99 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/248 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 99/205 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 143 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/248 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 205 constraints, problems are : Problem set: 0 solved, 143 unsolved in 4695 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/248 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 99/205 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 143/348 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/248 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 348 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5051 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9758ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 9760ms
Starting structural reductions in LTL mode, iteration 1 : 104/109 places, 144/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9920 ms. Remains : 104/109 places, 144/149 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(G(p1))||p0)))))'
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 3402 steps with 23 reset in 31 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-04 finished in 10188 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) U (p1&&X(X(p2)))) U X(p1)))'
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 149/149 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 106 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 106 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 105 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 105 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 104 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 104 transition count 144
Applied a total of 10 rules in 10 ms. Remains 104 /109 variables (removed 5) and now considering 144/149 (removed 5) transitions.
[2026-05-24 06:17:29] [INFO ] Invariant cache hit.
[2026-05-24 06:17:29] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 06:17:29] [INFO ] Invariant cache hit.
[2026-05-24 06:17:29] [INFO ] State equation strengthened by 99 read => feed constraints.
[2026-05-24 06:17:29] [INFO ] Implicit Places using invariants and state equation in 177 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 226 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/109 places, 144/149 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 241 ms. Remains : 103/109 places, 144/149 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) U (p1&&X(X(p2)))) U X(p1)))'
Stuttering acceptance computed with spot in 474 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-07
Product exploration explored 100000 steps with 1360 reset in 367 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 33 in 1 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-07 finished in 1140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F(p1)&&p0))||((G(p2)||(p2&&F(p3))) U p4))))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 149/149 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 147
Applied a total of 4 rules in 7 ms. Remains 107 /109 variables (removed 2) and now considering 147/149 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9335126899714281605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6009548534832377498.kers'
[2026-05-24 06:17:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9335126899714281605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6009548534832377498.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 147 rows 105 cols 291 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-24 06:17:30] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6009548534832377498.kers
Total runtime 1 ms.
[2026-05-24 06:17:30] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 06:17:30] [INFO ] Invariant cache hit.
[2026-05-24 06:17:30] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-05-24 06:17:30] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2026-05-24 06:17:30] [INFO ] Invariant cache hit.
[2026-05-24 06:17:30] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/254 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 146 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/254 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 209 constraints, problems are : Problem set: 0 solved, 146 unsolved in 4552 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (OVERLAPS) 147/254 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 100/209 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 146/355 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/254 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 355 constraints, problems are : Problem set: 0 solved, 146 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 107/107 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9577ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 9578ms
Starting structural reductions in LTL mode, iteration 1 : 107/109 places, 147/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9746 ms. Remains : 107/109 places, 147/149 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F(p1)&&p0))||((G(p2)||(p2&&F(p3))) U p4))))'
Stuttering acceptance computed with spot in 427 ms :[(OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p4)), (AND (NOT p3) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-08
Product exploration explored 100000 steps with 2974 reset in 245 ms.
Stack based approach found an accepted trace after 52 steps with 1 reset with depth 35 and stack size 35 in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-08 finished in 10485 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 U X(((F(p1) U X(p2)) U p3))))))'
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 149/149 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 106 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 106 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 105 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 105 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 104 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 104 transition count 144
Applied a total of 10 rules in 8 ms. Remains 104 /109 variables (removed 5) and now considering 144/149 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8098550413839647431.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5979174071441983886.kers'
[2026-05-24 06:17:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8098550413839647431.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5979174071441983886.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 144 rows 102 cols 286 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-24 06:17:40] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5979174071441983886.kers
Total runtime 1 ms.
[2026-05-24 06:17:40] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 06:17:40] [INFO ] Invariant cache hit.
[2026-05-24 06:17:40] [INFO ] State equation strengthened by 99 read => feed constraints.
[2026-05-24 06:17:40] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2026-05-24 06:17:40] [INFO ] Invariant cache hit.
[2026-05-24 06:17:40] [INFO ] State equation strengthened by 99 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/248 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 99/205 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 143 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/248 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 205 constraints, problems are : Problem set: 0 solved, 143 unsolved in 4449 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/248 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 99/205 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 143/348 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/248 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 348 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5439 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9904ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 9905ms
Starting structural reductions in LTL mode, iteration 1 : 104/109 places, 144/149 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10101 ms. Remains : 104/109 places, 144/149 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 U X(((F(p1) U X(p2)) U p3))))))'
Stuttering acceptance computed with spot in 338 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-09
Product exploration explored 100000 steps with 16181 reset in 179 ms.
Stack based approach found an accepted trace after 845 steps with 136 reset with depth 13 and stack size 13 in 3 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-09 finished in 10696 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) U (p1 U X(X(p2))))||G(p3)))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 149/149 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 106 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 106 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 105 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 105 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 104 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 104 transition count 144
Applied a total of 10 rules in 6 ms. Remains 104 /109 variables (removed 5) and now considering 144/149 (removed 5) transitions.
[2026-05-24 06:17:51] [INFO ] Invariant cache hit.
[2026-05-24 06:17:51] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-24 06:17:51] [INFO ] Invariant cache hit.
[2026-05-24 06:17:51] [INFO ] State equation strengthened by 99 read => feed constraints.
[2026-05-24 06:17:51] [INFO ] Implicit Places using invariants and state equation in 138 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 182 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/109 places, 144/149 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 190 ms. Remains : 103/109 places, 144/149 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) U (p1 U X(X(p2))))||G(p3)))'
Stuttering acceptance computed with spot in 609 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-10
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-10 finished in 859 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) U (((X(p2) U p3)||X(G(X(!p3))))&&p1)))'
Support contains 5 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 149/149 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 147
Applied a total of 4 rules in 4 ms. Remains 107 /109 variables (removed 2) and now considering 147/149 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13810196045550011350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15787740723145745009.kers'
[2026-05-24 06:17:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13810196045550011350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15787740723145745009.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 147 rows 105 cols 291 entries
Finished phase 1 with 105 SingleSign rule and 0 generalized
[2026-05-24 06:17:52] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15787740723145745009.kers
Total runtime 1 ms.
[2026-05-24 06:17:52] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-24 06:17:52] [INFO ] Invariant cache hit.
[2026-05-24 06:17:52] [INFO ] State equation strengthened by 100 read => feed constraints.
[2026-05-24 06:17:52] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 185 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/109 places, 147/149 transitions.
Applied a total of 0 rules in 1 ms. Remains 106 /106 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 106/109 places, 147/149 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) U (((X(p2) U p3)||X(G(X(!p3))))&&p1)))'
Stuttering acceptance computed with spot in 386 ms :[(NOT p1), (NOT p0), (AND (NOT p0) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p0) p3), (AND (NOT p0) p3 (NOT p2)), (AND (NOT p1) p3), (AND (NOT p1) (NOT p2) p3), (AND (NOT p1) (NOT p2) p3)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-11
Stuttering criterion allowed to conclude after 90436 steps with 1488 reset in 188 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-11 finished in 823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 149/149 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 147
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 106 transition count 146
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 106 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 105 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 105 transition count 145
Applied a total of 8 rules in 4 ms. Remains 105 /109 variables (removed 4) and now considering 145/149 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10718847729381901176.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10887892353951846433.kers'
[2026-05-24 06:17:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10718847729381901176.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10887892353951846433.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 145 rows 103 cols 288 entries
Finished phase 1 with 103 SingleSign rule and 0 generalized
[2026-05-24 06:17:53] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10887892353951846433.kers
Total runtime 0 ms.
[2026-05-24 06:17:53] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-24 06:17:53] [INFO ] Invariant cache hit.
[2026-05-24 06:17:53] [INFO ] State equation strengthened by 99 read => feed constraints.
[2026-05-24 06:17:53] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 214 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/109 places, 145/149 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 220 ms. Remains : 104/109 places, 145/149 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-12
Product exploration explored 100000 steps with 2999 reset in 189 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-12 finished in 572 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(((G(!p0) U p1)||X(X(X(p2))))))'
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 149/149 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 106 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 106 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 105 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 105 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 104 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 104 transition count 144
Applied a total of 10 rules in 6 ms. Remains 104 /109 variables (removed 5) and now considering 144/149 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3383870162549259715.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2449040879533050213.kers'
[2026-05-24 06:17:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3383870162549259715.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2449040879533050213.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 144 rows 102 cols 286 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-24 06:17:53] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2449040879533050213.kers
Total runtime 1 ms.
[2026-05-24 06:17:53] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 06:17:53] [INFO ] Invariant cache hit.
[2026-05-24 06:17:53] [INFO ] State equation strengthened by 99 read => feed constraints.
[2026-05-24 06:17:53] [INFO ] Implicit Places using invariants and state equation in 160 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 209 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/109 places, 144/149 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 218 ms. Remains : 103/109 places, 144/149 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(((G(!p0) U p1)||X(X(X(p2))))))'
Stuttering acceptance computed with spot in 451 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), true, (AND (NOT p2) p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), p0, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-13
Product exploration explored 100000 steps with 19941 reset in 166 ms.
Product exploration explored 100000 steps with 20033 reset in 203 ms.
Computed a total of 16 stabilizing places and 15 stable transitions
Graph (complete) has 286 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 15 stable transitions
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 12 states, 21 edges and 3 AP (stutter sensitive) to 12 states, 21 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (255 resets) in 285 ms. (139 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (19 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10732816986586788993.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7548113829081910485.kers'
[2026-05-24 06:17:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10732816986586788993.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7548113829081910485.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 144 rows 102 cols 286 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-24 06:17:54] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7548113829081910485.kers
Total runtime 0 ms.
[2026-05-24 06:17:54] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/74 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 19/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 130/247 variables, and 70 constraints, problems are : Problem set: 2 solved, 0 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 51/103 constraints, ReadFeed: 19/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 9 factoid took 148 ms. Reduced automaton from 12 states, 21 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true]
Knowledge-based reduction took 681 ms.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true]
Support contains 1 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2026-05-24 06:17:55] [INFO ] Invariant cache hit.
[2026-05-24 06:17:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 06:17:55] [INFO ] Invariant cache hit.
[2026-05-24 06:17:55] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 06:17:55] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2026-05-24 06:17:55] [INFO ] Invariant cache hit.
[2026-05-24 06:17:55] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/247 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 71/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/247 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 175 constraints, problems are : Problem set: 0 solved, 143 unsolved in 3613 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 144/247 variables, 103/104 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 71/175 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 143/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/247 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 318 constraints, problems are : Problem set: 0 solved, 143 unsolved in 4373 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7995ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 7996ms
Finished structural reductions in LTL mode , in 1 iterations and 8146 ms. Remains : 103/103 places, 144/144 transitions.
Computed a total of 16 stabilizing places and 15 stable transitions
Graph (complete) has 286 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 16 stabilizing places and 15 stable transitions
Knowledge based reduction with 1 factoid took 48 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 1828 steps (9 resets) in 52 ms. (34 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 63 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true]
Knowledge-based reduction took 320 ms.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true]
Product exploration explored 100000 steps with 19897 reset in 192 ms.
Product exploration explored 100000 steps with 19997 reset in 201 ms.
Spot run failed in 79 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin15737179900235166716
[2026-05-24 06:18:04] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15737179900235166716
Running compilation step : cd /tmp/ltsmin15737179900235166716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 356 ms.
Running link step : cd /tmp/ltsmin15737179900235166716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin15737179900235166716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased6872273074456055220.hoa' '--buchi-type=spotba'
LTSmin run took 1252 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-13 finished in 12957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 149/149 transitions.
Graph (complete) has 340 edges and 109 vertex of which 107 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 130 edges and 104 vertex of which 98 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Graph (trivial) has 110 edges and 98 vertex of which 54 / 98 are part of one of the 27 SCC in 3 ms
Free SCC test removed 27 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 71 transition count 126
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 60 place count 57 transition count 99
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 72 place count 45 transition count 75
Iterating global reduction 2 with 12 rules applied. Total rules applied 84 place count 45 transition count 75
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 96 place count 33 transition count 51
Iterating global reduction 2 with 12 rules applied. Total rules applied 108 place count 33 transition count 51
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 120 place count 21 transition count 27
Iterating global reduction 2 with 12 rules applied. Total rules applied 132 place count 21 transition count 27
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 144 place count 9 transition count 15
Iterating global reduction 2 with 12 rules applied. Total rules applied 156 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 160 place count 7 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 5 transition count 10
Applied a total of 163 rules in 28 ms. Remains 5 /109 variables (removed 104) and now considering 10/149 (removed 139) transitions.
[2026-05-24 06:18:06] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1694317883618772734.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16345917321584365080.kers'
[2026-05-24 06:18:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1694317883618772734.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16345917321584365080.kers]
Normalized transition count is 7 out of 8 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 7 rows 5 cols 11 entries
Finished phase 1 with 5 SingleSign rule and 0 generalized
[2026-05-24 06:18:06] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16345917321584365080.kers
Total runtime 0 ms.
[2026-05-24 06:18:06] [INFO ] Implicit Places using invariants in 14 ms returned []
[2026-05-24 06:18:06] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 06:18:06] [INFO ] Invariant cache hit.
[2026-05-24 06:18:06] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2026-05-24 06:18:06] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2026-05-24 06:18:06] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
[2026-05-24 06:18:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 44 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 3/12 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 42 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/109 places, 10/149 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 5/109 places, 10/149 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-14
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-14 finished in 276 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)||(p1&&F(p2)))))'
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 149/149 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 106 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 106 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 105 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 105 transition count 145
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 104 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 104 transition count 144
Applied a total of 10 rules in 13 ms. Remains 104 /109 variables (removed 5) and now considering 144/149 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18206545690588507876.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13454553902403010103.kers'
[2026-05-24 06:18:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18206545690588507876.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13454553902403010103.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 144 rows 102 cols 286 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-24 06:18:06] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13454553902403010103.kers
Total runtime 2 ms.
[2026-05-24 06:18:06] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-24 06:18:06] [INFO ] Invariant cache hit.
[2026-05-24 06:18:06] [INFO ] State equation strengthened by 99 read => feed constraints.
[2026-05-24 06:18:07] [INFO ] Implicit Places using invariants and state equation in 142 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 191 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/109 places, 144/149 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 209 ms. Remains : 103/109 places, 144/149 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)||(p1&&F(p2)))))'
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-15
Product exploration explored 100000 steps with 5661 reset in 243 ms.
Stack based approach found an accepted trace after 806 steps with 40 reset with depth 50 and stack size 49 in 5 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-15 finished in 711 ms.
All properties solved by simple procedures.
Total runtime 71500 ms.

BK_STOP 1779603487610

--------------------
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-14a"
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-14a, 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-177955695500364"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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