Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260109800044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109800044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 8.3K Apr 30 07:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 30 07:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 30 07:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 30 07:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 61K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652628991771

Running Version 202205111006
[2022-05-15 15:36:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 15:36:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:36:33] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2022-05-15 15:36:33] [INFO ] Transformed 240 places.
[2022-05-15 15:36:33] [INFO ] Transformed 254 transitions.
[2022-05-15 15:36:33] [INFO ] Found NUPN structural information;
[2022-05-15 15:36:33] [INFO ] Parsed PT model containing 240 places and 254 transitions in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 254/254 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 224 transition count 254
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 54 place count 186 transition count 216
Iterating global reduction 1 with 38 rules applied. Total rules applied 92 place count 186 transition count 216
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 100 place count 178 transition count 208
Iterating global reduction 1 with 8 rules applied. Total rules applied 108 place count 178 transition count 208
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 172 transition count 202
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 172 transition count 202
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 126 place count 166 transition count 196
Iterating global reduction 1 with 6 rules applied. Total rules applied 132 place count 166 transition count 196
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 138 place count 160 transition count 184
Iterating global reduction 1 with 6 rules applied. Total rules applied 144 place count 160 transition count 184
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 149 place count 155 transition count 179
Iterating global reduction 1 with 5 rules applied. Total rules applied 154 place count 155 transition count 179
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 159 place count 150 transition count 174
Iterating global reduction 1 with 5 rules applied. Total rules applied 164 place count 150 transition count 174
Applied a total of 164 rules in 73 ms. Remains 150 /240 variables (removed 90) and now considering 174/254 (removed 80) transitions.
// Phase 1: matrix 174 rows 150 cols
[2022-05-15 15:36:33] [INFO ] Computed 2 place invariants in 14 ms
[2022-05-15 15:36:33] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 174 rows 150 cols
[2022-05-15 15:36:33] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:36:33] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
// Phase 1: matrix 174 rows 150 cols
[2022-05-15 15:36:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:33] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 150/240 places, 174/254 transitions.
Finished structural reductions, in 1 iterations. Remains : 150/240 places, 174/254 transitions.
Support contains 28 out of 150 places after structural reductions.
[2022-05-15 15:36:33] [INFO ] Flatten gal took : 35 ms
[2022-05-15 15:36:33] [INFO ] Flatten gal took : 15 ms
[2022-05-15 15:36:33] [INFO ] Input system was already deterministic with 174 transitions.
Support contains 26 out of 150 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 23) seen :22
Finished Best-First random walk after 5924 steps, including 4 resets, run visited all 1 properties in 17 ms. (steps per millisecond=348 )
FORMULA DiscoveryGPU-PT-08b-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 292 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1)||G(p2))))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 174/174 transitions.
Graph (complete) has 292 edges and 150 vertex of which 147 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 146 transition count 150
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 126 transition count 150
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 41 place count 126 transition count 125
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 91 place count 101 transition count 125
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 98 transition count 122
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 98 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 97 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 97 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 96 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 96 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 95 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 95 transition count 118
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 173 place count 60 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 180 place count 53 transition count 69
Iterating global reduction 2 with 7 rules applied. Total rules applied 187 place count 53 transition count 69
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 194 place count 46 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 201 place count 46 transition count 62
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 206 place count 41 transition count 52
Iterating global reduction 2 with 5 rules applied. Total rules applied 211 place count 41 transition count 52
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 216 place count 36 transition count 47
Iterating global reduction 2 with 5 rules applied. Total rules applied 221 place count 36 transition count 47
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 225 place count 32 transition count 39
Iterating global reduction 2 with 4 rules applied. Total rules applied 229 place count 32 transition count 39
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 233 place count 28 transition count 35
Iterating global reduction 2 with 4 rules applied. Total rules applied 237 place count 28 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 238 place count 28 transition count 34
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 240 place count 28 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 242 place count 26 transition count 32
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 244 place count 25 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 245 place count 24 transition count 31
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 245 place count 24 transition count 28
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 251 place count 21 transition count 28
Applied a total of 251 rules in 39 ms. Remains 21 /150 variables (removed 129) and now considering 28/174 (removed 146) transitions.
[2022-05-15 15:36:34] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 21 cols
[2022-05-15 15:36:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:34] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-15 15:36:34] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 21 cols
[2022-05-15 15:36:34] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:36:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 15:36:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-15 15:36:34] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:36:34] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 21 cols
[2022-05-15 15:36:34] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:36:34] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/150 places, 28/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/150 places, 28/174 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (EQ s17 1) (EQ s20 1)) (EQ s13 1)), p1:(OR (EQ s17 0) (EQ s20 0)), p2:(EQ s8 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 5602 reset in 357 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-01 finished in 821 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 174/174 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 142 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 142 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 140 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 140 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 139 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 139 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 138 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 138 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 137 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 137 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 136 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 136 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 135 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 135 transition count 158
Applied a total of 30 rules in 18 ms. Remains 135 /150 variables (removed 15) and now considering 158/174 (removed 16) transitions.
// Phase 1: matrix 158 rows 135 cols
[2022-05-15 15:36:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:36:35] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 158 rows 135 cols
[2022-05-15 15:36:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:35] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 135 cols
[2022-05-15 15:36:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:35] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/150 places, 158/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/150 places, 158/174 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s4 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 272 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Detected a total of 26/135 stabilizing places and 26/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-02 finished in 799 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 174/174 transitions.
Graph (complete) has 292 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 145 transition count 148
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 124 transition count 148
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 43 place count 124 transition count 122
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 95 place count 98 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 96 transition count 120
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 96 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 95 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 95 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 94 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 94 transition count 117
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 93 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 93 transition count 116
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 179 place count 56 transition count 79
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 186 place count 49 transition count 65
Iterating global reduction 2 with 7 rules applied. Total rules applied 193 place count 49 transition count 65
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 200 place count 42 transition count 58
Iterating global reduction 2 with 7 rules applied. Total rules applied 207 place count 42 transition count 58
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 214 place count 35 transition count 44
Iterating global reduction 2 with 7 rules applied. Total rules applied 221 place count 35 transition count 44
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 228 place count 28 transition count 37
Iterating global reduction 2 with 7 rules applied. Total rules applied 235 place count 28 transition count 37
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 242 place count 21 transition count 23
Iterating global reduction 2 with 7 rules applied. Total rules applied 249 place count 21 transition count 23
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 256 place count 14 transition count 16
Iterating global reduction 2 with 7 rules applied. Total rules applied 263 place count 14 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 14 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 13 transition count 14
Applied a total of 265 rules in 30 ms. Remains 13 /150 variables (removed 137) and now considering 14/174 (removed 160) transitions.
[2022-05-15 15:36:35] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2022-05-15 15:36:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:36:36] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-15 15:36:36] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2022-05-15 15:36:36] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:36:36] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-15 15:36:36] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-15 15:36:36] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:36:36] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 13 cols
[2022-05-15 15:36:36] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:36:36] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/150 places, 14/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/150 places, 14/174 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Computed a total of 13 stabilizing places and 12 stable transitions
Computed a total of 13 stabilizing places and 12 stable transitions
Detected a total of 13/13 stabilizing places and 12/14 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-03 finished in 370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(G(p1)))||F(p1)||p0)))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 174/174 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 142 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 142 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 140 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 140 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 139 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 139 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 138 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 138 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 137 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 137 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 136 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 136 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 135 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 135 transition count 158
Applied a total of 30 rules in 14 ms. Remains 135 /150 variables (removed 15) and now considering 158/174 (removed 16) transitions.
// Phase 1: matrix 158 rows 135 cols
[2022-05-15 15:36:36] [INFO ] Computed 2 place invariants in 13 ms
[2022-05-15 15:36:36] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 158 rows 135 cols
[2022-05-15 15:36:36] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:36:36] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 135 cols
[2022-05-15 15:36:36] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:36:36] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/150 places, 158/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/150 places, 158/174 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(EQ s6 1), p0:(OR (EQ s126 0) (EQ s131 0) (EQ s103 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 272 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Detected a total of 26/135 stabilizing places and 26/158 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-04 finished in 671 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 174/174 transitions.
Graph (complete) has 292 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 145 transition count 148
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 124 transition count 148
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 43 place count 124 transition count 124
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 91 place count 100 transition count 124
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 97 transition count 121
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 97 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 96 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 96 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 95 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 95 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 94 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 94 transition count 117
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 177 place count 57 transition count 80
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 184 place count 50 transition count 66
Iterating global reduction 2 with 7 rules applied. Total rules applied 191 place count 50 transition count 66
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 198 place count 43 transition count 59
Iterating global reduction 2 with 7 rules applied. Total rules applied 205 place count 43 transition count 59
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 212 place count 36 transition count 45
Iterating global reduction 2 with 7 rules applied. Total rules applied 219 place count 36 transition count 45
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 226 place count 29 transition count 38
Iterating global reduction 2 with 7 rules applied. Total rules applied 233 place count 29 transition count 38
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 240 place count 22 transition count 24
Iterating global reduction 2 with 7 rules applied. Total rules applied 247 place count 22 transition count 24
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 253 place count 16 transition count 18
Iterating global reduction 2 with 6 rules applied. Total rules applied 259 place count 16 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 260 place count 16 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 262 place count 14 transition count 15
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 264 place count 13 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 265 place count 12 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 265 place count 12 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 269 place count 10 transition count 12
Applied a total of 269 rules in 20 ms. Remains 10 /150 variables (removed 140) and now considering 12/174 (removed 162) transitions.
[2022-05-15 15:36:37] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 10 cols
[2022-05-15 15:36:37] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:36:37] [INFO ] Implicit Places using invariants in 16 ms returned []
[2022-05-15 15:36:37] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 10 cols
[2022-05-15 15:36:37] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 15:36:37] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-15 15:36:37] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:36:37] [INFO ] Flow matrix only has 11 transitions (discarded 1 similar events)
// Phase 1: matrix 11 rows 10 cols
[2022-05-15 15:36:37] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:37] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/150 places, 12/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/150 places, 12/174 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-05 finished in 174 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(X((G(p2)||p3)))))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 174/174 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 143 transition count 167
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 143 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 142 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 142 transition count 166
Applied a total of 16 rules in 3 ms. Remains 142 /150 variables (removed 8) and now considering 166/174 (removed 8) transitions.
// Phase 1: matrix 166 rows 142 cols
[2022-05-15 15:36:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:37] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 166 rows 142 cols
[2022-05-15 15:36:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:37] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 166 rows 142 cols
[2022-05-15 15:36:37] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 15:36:37] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 166/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/150 places, 166/174 transitions.
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 5}]], initial=7, aps=[p1:(AND (EQ s111 1) (EQ s138 1)), p0:(EQ s117 1), p2:(OR (EQ s125 0) (EQ s138 0)), p3:(EQ s64 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 108 ms.
Product exploration explored 100000 steps with 33333 reset in 109 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 285 edges and 142 vertex of which 140 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 p3), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p3) p2))))
Knowledge based reduction with 9 factoid took 209 ms. Reduced automaton from 9 states, 20 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-06 finished in 971 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)&&F(p1)))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 174/174 transitions.
Graph (complete) has 292 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 145 transition count 149
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 125 transition count 149
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 41 place count 125 transition count 125
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 89 place count 101 transition count 125
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 98 transition count 122
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 98 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 97 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 97 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 96 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 96 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 95 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 95 transition count 118
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 175 place count 58 transition count 81
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 181 place count 52 transition count 69
Iterating global reduction 2 with 6 rules applied. Total rules applied 187 place count 52 transition count 69
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 192 place count 47 transition count 64
Iterating global reduction 2 with 5 rules applied. Total rules applied 197 place count 47 transition count 64
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 202 place count 42 transition count 54
Iterating global reduction 2 with 5 rules applied. Total rules applied 207 place count 42 transition count 54
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 212 place count 37 transition count 49
Iterating global reduction 2 with 5 rules applied. Total rules applied 217 place count 37 transition count 49
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 222 place count 32 transition count 39
Iterating global reduction 2 with 5 rules applied. Total rules applied 227 place count 32 transition count 39
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 232 place count 27 transition count 34
Iterating global reduction 2 with 5 rules applied. Total rules applied 237 place count 27 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 238 place count 27 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 240 place count 25 transition count 31
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 242 place count 24 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 243 place count 23 transition count 30
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 243 place count 23 transition count 26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 251 place count 19 transition count 26
Applied a total of 251 rules in 24 ms. Remains 19 /150 variables (removed 131) and now considering 26/174 (removed 148) transitions.
[2022-05-15 15:36:38] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 19 cols
[2022-05-15 15:36:38] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:38] [INFO ] Implicit Places using invariants in 17 ms returned []
[2022-05-15 15:36:38] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 19 cols
[2022-05-15 15:36:38] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 15:36:38] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-15 15:36:38] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:36:38] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 19 cols
[2022-05-15 15:36:38] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:38] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/150 places, 26/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/150 places, 26/174 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s18 0)), p1:(OR (EQ s14 0) (EQ s18 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1940 reset in 136 ms.
Product exploration explored 100000 steps with 1923 reset in 148 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 354 steps, including 4 resets, run visited all 2 properties in 7 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 244 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 26/26 transitions.
Applied a total of 0 rules in 3 ms. Remains 19 /19 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2022-05-15 15:36:39] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 19 cols
[2022-05-15 15:36:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:39] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-15 15:36:39] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 19 cols
[2022-05-15 15:36:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 15:36:39] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-15 15:36:39] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:36:39] [INFO ] Flow matrix only has 23 transitions (discarded 3 similar events)
// Phase 1: matrix 23 rows 19 cols
[2022-05-15 15:36:39] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:39] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/19 places, 26/26 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 113 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1903 reset in 115 ms.
Product exploration explored 100000 steps with 1947 reset in 119 ms.
Built C files in :
/tmp/ltsmin1033207375418580912
[2022-05-15 15:36:40] [INFO ] Computing symmetric may disable matrix : 26 transitions.
[2022-05-15 15:36:40] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:36:40] [INFO ] Computing symmetric may enable matrix : 26 transitions.
[2022-05-15 15:36:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:36:40] [INFO ] Computing Do-Not-Accords matrix : 26 transitions.
[2022-05-15 15:36:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:36:40] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1033207375418580912
Running compilation step : cd /tmp/ltsmin1033207375418580912;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 180 ms.
Running link step : cd /tmp/ltsmin1033207375418580912;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1033207375418580912;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18134103920720332277.hoa' '--buchi-type=spotba'
LTSmin run took 839 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-07 finished in 3631 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(!G(X(p0))) U p1))))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 174/174 transitions.
Graph (complete) has 292 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 145 transition count 150
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 126 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 125 transition count 149
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 41 place count 125 transition count 124
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 91 place count 100 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 98 transition count 122
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 98 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 97 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 97 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 98 place count 96 transition count 119
Iterating global reduction 3 with 1 rules applied. Total rules applied 99 place count 96 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 95 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 95 transition count 118
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 169 place count 61 transition count 84
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 175 place count 55 transition count 72
Iterating global reduction 3 with 6 rules applied. Total rules applied 181 place count 55 transition count 72
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 186 place count 50 transition count 67
Iterating global reduction 3 with 5 rules applied. Total rules applied 191 place count 50 transition count 67
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 196 place count 45 transition count 57
Iterating global reduction 3 with 5 rules applied. Total rules applied 201 place count 45 transition count 57
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 206 place count 40 transition count 52
Iterating global reduction 3 with 5 rules applied. Total rules applied 211 place count 40 transition count 52
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 215 place count 36 transition count 44
Iterating global reduction 3 with 4 rules applied. Total rules applied 219 place count 36 transition count 44
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 223 place count 32 transition count 40
Iterating global reduction 3 with 4 rules applied. Total rules applied 227 place count 32 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 31 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 231 place count 29 transition count 38
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 46 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 235 place count 27 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 237 place count 25 transition count 35
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 243 place count 22 transition count 32
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 247 place count 18 transition count 28
Applied a total of 247 rules in 32 ms. Remains 18 /150 variables (removed 132) and now considering 28/174 (removed 146) transitions.
[2022-05-15 15:36:41] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 18 cols
[2022-05-15 15:36:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:41] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-15 15:36:41] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 18 cols
[2022-05-15 15:36:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:41] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-15 15:36:41] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:36:41] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 18 cols
[2022-05-15 15:36:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:36:41] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/150 places, 28/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 18/150 places, 28/174 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (NEQ s15 1) (EQ s7 1) (EQ s17 1)), p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-08 finished in 257 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 174/174 transitions.
Graph (complete) has 292 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 145 transition count 149
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 125 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 124 transition count 148
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 43 place count 124 transition count 122
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 95 place count 98 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 95 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 95 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 94 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 94 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 93 transition count 116
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 93 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 92 transition count 115
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 92 transition count 115
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 179 place count 56 transition count 79
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 186 place count 49 transition count 65
Iterating global reduction 3 with 7 rules applied. Total rules applied 193 place count 49 transition count 65
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 200 place count 42 transition count 58
Iterating global reduction 3 with 7 rules applied. Total rules applied 207 place count 42 transition count 58
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 214 place count 35 transition count 44
Iterating global reduction 3 with 7 rules applied. Total rules applied 221 place count 35 transition count 44
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 228 place count 28 transition count 37
Iterating global reduction 3 with 7 rules applied. Total rules applied 235 place count 28 transition count 37
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 241 place count 22 transition count 25
Iterating global reduction 3 with 6 rules applied. Total rules applied 247 place count 22 transition count 25
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 253 place count 16 transition count 19
Iterating global reduction 3 with 6 rules applied. Total rules applied 259 place count 16 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 16 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 262 place count 14 transition count 16
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 14 edges and 12 vertex of which 9 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 266 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 267 place count 8 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 267 place count 8 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 269 place count 7 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 271 place count 6 transition count 11
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 273 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 275 place count 4 transition count 7
Applied a total of 275 rules in 16 ms. Remains 4 /150 variables (removed 146) and now considering 7/174 (removed 167) transitions.
[2022-05-15 15:36:42] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 15:36:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:36:42] [INFO ] Implicit Places using invariants in 17 ms returned []
[2022-05-15 15:36:42] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 15:36:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:36:42] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-15 15:36:42] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:36:42] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 15:36:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:36:42] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/150 places, 7/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/150 places, 7/174 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-09 finished in 137 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&p1))))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 174/174 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 142 transition count 166
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 142 transition count 166
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 140 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 140 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 139 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 139 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 138 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 138 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 137 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 137 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 136 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 136 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 135 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 135 transition count 158
Applied a total of 30 rules in 16 ms. Remains 135 /150 variables (removed 15) and now considering 158/174 (removed 16) transitions.
// Phase 1: matrix 158 rows 135 cols
[2022-05-15 15:36:42] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:36:42] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 158 rows 135 cols
[2022-05-15 15:36:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:42] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 135 cols
[2022-05-15 15:36:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:42] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/150 places, 158/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/150 places, 158/174 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s62 0) (EQ s131 0)), p0:(AND (EQ s64 0) (OR (NEQ s62 1) (NEQ s131 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 382 reset in 130 ms.
Stack based approach found an accepted trace after 6050 steps with 24 reset with depth 86 and stack size 86 in 11 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-10 finished in 503 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)&&F(p1)))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 174/174 transitions.
Graph (complete) has 292 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 145 transition count 149
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 125 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 124 transition count 148
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 43 place count 124 transition count 122
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 95 place count 98 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 95 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 95 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 94 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 94 transition count 118
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 93 transition count 116
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 93 transition count 116
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 92 transition count 115
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 92 transition count 115
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 177 place count 57 transition count 80
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 182 place count 52 transition count 70
Iterating global reduction 3 with 5 rules applied. Total rules applied 187 place count 52 transition count 70
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 192 place count 47 transition count 65
Iterating global reduction 3 with 5 rules applied. Total rules applied 197 place count 47 transition count 65
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 202 place count 42 transition count 55
Iterating global reduction 3 with 5 rules applied. Total rules applied 207 place count 42 transition count 55
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 212 place count 37 transition count 50
Iterating global reduction 3 with 5 rules applied. Total rules applied 217 place count 37 transition count 50
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 222 place count 32 transition count 40
Iterating global reduction 3 with 5 rules applied. Total rules applied 227 place count 32 transition count 40
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 232 place count 27 transition count 35
Iterating global reduction 3 with 5 rules applied. Total rules applied 237 place count 27 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 238 place count 27 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 240 place count 25 transition count 32
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 28 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 9 rules applied. Total rules applied 249 place count 20 transition count 23
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 255 place count 14 transition count 23
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 261 place count 11 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 262 place count 11 transition count 19
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 265 place count 8 transition count 16
Applied a total of 265 rules in 18 ms. Remains 8 /150 variables (removed 142) and now considering 16/174 (removed 158) transitions.
[2022-05-15 15:36:42] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 8 cols
[2022-05-15 15:36:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:36:42] [INFO ] Implicit Places using invariants in 12 ms returned []
[2022-05-15 15:36:42] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 8 cols
[2022-05-15 15:36:42] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:36:42] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-15 15:36:42] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:36:42] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 8 cols
[2022-05-15 15:36:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:36:42] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/150 places, 16/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/150 places, 16/174 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 0), p1:(EQ s7 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-11 finished in 179 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(G(p0))))))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 174/174 transitions.
Graph (complete) has 292 edges and 150 vertex of which 146 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 145 transition count 148
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 124 transition count 148
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 43 place count 124 transition count 122
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 95 place count 98 transition count 122
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 95 transition count 119
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 95 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 94 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 94 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 93 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 93 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 92 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 92 transition count 115
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 179 place count 56 transition count 79
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 186 place count 49 transition count 65
Iterating global reduction 2 with 7 rules applied. Total rules applied 193 place count 49 transition count 65
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 199 place count 43 transition count 59
Iterating global reduction 2 with 6 rules applied. Total rules applied 205 place count 43 transition count 59
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 211 place count 37 transition count 47
Iterating global reduction 2 with 6 rules applied. Total rules applied 217 place count 37 transition count 47
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 223 place count 31 transition count 41
Iterating global reduction 2 with 6 rules applied. Total rules applied 229 place count 31 transition count 41
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 235 place count 25 transition count 29
Iterating global reduction 2 with 6 rules applied. Total rules applied 241 place count 25 transition count 29
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 247 place count 19 transition count 23
Iterating global reduction 2 with 6 rules applied. Total rules applied 253 place count 19 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 254 place count 19 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 256 place count 17 transition count 20
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 17 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 262 place count 12 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 265 place count 9 transition count 14
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 4 with 4 rules applied. Total rules applied 269 place count 7 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 270 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 272 place count 5 transition count 9
Applied a total of 272 rules in 15 ms. Remains 5 /150 variables (removed 145) and now considering 9/174 (removed 165) transitions.
[2022-05-15 15:36:42] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 15:36:42] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:36:42] [INFO ] Implicit Places using invariants in 11 ms returned []
[2022-05-15 15:36:42] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 15:36:42] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:36:42] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2022-05-15 15:36:42] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:36:42] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 15:36:42] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:36:42] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/150 places, 9/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/150 places, 9/174 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-14 finished in 107 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 174/174 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 143 transition count 167
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 143 transition count 167
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 141 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 141 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 140 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 140 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 139 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 139 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 138 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 138 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 137 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 137 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 136 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 136 transition count 159
Applied a total of 28 rules in 7 ms. Remains 136 /150 variables (removed 14) and now considering 159/174 (removed 15) transitions.
// Phase 1: matrix 159 rows 136 cols
[2022-05-15 15:36:42] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:36:43] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 159 rows 136 cols
[2022-05-15 15:36:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:43] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 136 cols
[2022-05-15 15:36:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:36:43] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/150 places, 159/174 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/150 places, 159/174 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s30 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 352 steps with 1 reset in 3 ms.
FORMULA DiscoveryGPU-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08b-LTLFireability-15 finished in 276 ms.
All properties solved by simple procedures.
Total runtime 10333 ms.

BK_STOP 1652629003299

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-08b"
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-4028"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-08b, 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 r078-tall-165260109800044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-08b.tgz
mv DiscoveryGPU-PT-08b 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;