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-165260109800076.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-10b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109800076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 8.0K Apr 30 07:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 07:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 07:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 07:06 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.7K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 75K 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-10b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652631460858

Running Version 202205111006
[2022-05-15 16:17:41] [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 16:17:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:17:42] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2022-05-15 16:17:42] [INFO ] Transformed 296 places.
[2022-05-15 16:17:42] [INFO ] Transformed 314 transitions.
[2022-05-15 16:17:42] [INFO ] Found NUPN structural information;
[2022-05-15 16:17:42] [INFO ] Parsed PT model containing 296 places and 314 transitions in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 314/314 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 276 transition count 314
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 65 place count 231 transition count 269
Iterating global reduction 1 with 45 rules applied. Total rules applied 110 place count 231 transition count 269
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 122 place count 219 transition count 257
Iterating global reduction 1 with 12 rules applied. Total rules applied 134 place count 219 transition count 257
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 143 place count 210 transition count 248
Iterating global reduction 1 with 9 rules applied. Total rules applied 152 place count 210 transition count 248
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 157 place count 205 transition count 243
Iterating global reduction 1 with 5 rules applied. Total rules applied 162 place count 205 transition count 243
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 167 place count 200 transition count 233
Iterating global reduction 1 with 5 rules applied. Total rules applied 172 place count 200 transition count 233
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 176 place count 196 transition count 229
Iterating global reduction 1 with 4 rules applied. Total rules applied 180 place count 196 transition count 229
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 184 place count 192 transition count 225
Iterating global reduction 1 with 4 rules applied. Total rules applied 188 place count 192 transition count 225
Applied a total of 188 rules in 78 ms. Remains 192 /296 variables (removed 104) and now considering 225/314 (removed 89) transitions.
// Phase 1: matrix 225 rows 192 cols
[2022-05-15 16:17:42] [INFO ] Computed 2 place invariants in 17 ms
[2022-05-15 16:17:42] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 225 rows 192 cols
[2022-05-15 16:17:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:42] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
// Phase 1: matrix 225 rows 192 cols
[2022-05-15 16:17:42] [INFO ] Computed 2 place invariants in 13 ms
[2022-05-15 16:17:42] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/296 places, 225/314 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/296 places, 225/314 transitions.
Support contains 30 out of 192 places after structural reductions.
[2022-05-15 16:17:43] [INFO ] Flatten gal took : 43 ms
[2022-05-15 16:17:43] [INFO ] Flatten gal took : 18 ms
[2022-05-15 16:17:43] [INFO ] Input system was already deterministic with 225 transitions.
Support contains 29 out of 192 places (down from 30) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 29) seen :25
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :3
Finished Best-First random walk after 2890 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=578 )
FORMULA DiscoveryGPU-PT-10b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-10b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 33 stabilizing places and 33 stable transitions
Graph (complete) has 380 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.14 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 225/225 transitions.
Graph (complete) has 380 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 189 transition count 195
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 162 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 161 transition count 194
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 57 place count 161 transition count 163
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 119 place count 130 transition count 163
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 124 place count 125 transition count 158
Iterating global reduction 3 with 5 rules applied. Total rules applied 129 place count 125 transition count 158
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 121 transition count 154
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 121 transition count 154
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 141 place count 117 transition count 146
Iterating global reduction 3 with 4 rules applied. Total rules applied 145 place count 117 transition count 146
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 149 place count 113 transition count 142
Iterating global reduction 3 with 4 rules applied. Total rules applied 153 place count 113 transition count 142
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 245 place count 67 transition count 96
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 254 place count 58 transition count 78
Iterating global reduction 3 with 9 rules applied. Total rules applied 263 place count 58 transition count 78
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 272 place count 49 transition count 69
Iterating global reduction 3 with 9 rules applied. Total rules applied 281 place count 49 transition count 69
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 289 place count 41 transition count 53
Iterating global reduction 3 with 8 rules applied. Total rules applied 297 place count 41 transition count 53
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 305 place count 33 transition count 45
Iterating global reduction 3 with 8 rules applied. Total rules applied 313 place count 33 transition count 45
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 321 place count 25 transition count 29
Iterating global reduction 3 with 8 rules applied. Total rules applied 329 place count 25 transition count 29
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 337 place count 17 transition count 21
Iterating global reduction 3 with 8 rules applied. Total rules applied 345 place count 17 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 346 place count 17 transition count 20
Applied a total of 346 rules in 65 ms. Remains 17 /192 variables (removed 175) and now considering 20/225 (removed 205) transitions.
[2022-05-15 16:17:44] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 17 cols
[2022-05-15 16:17:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:17:44] [INFO ] Implicit Places using invariants in 49 ms returned []
[2022-05-15 16:17:44] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 17 cols
[2022-05-15 16:17:44] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:17:44] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-15 16:17:44] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 121 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/192 places, 20/225 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 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 15 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 15 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 12 transition count 16
Applied a total of 8 rules in 2 ms. Remains 12 /16 variables (removed 4) and now considering 16/20 (removed 4) transitions.
[2022-05-15 16:17:44] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 12 cols
[2022-05-15 16:17:44] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:17:44] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-15 16:17:44] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 12 cols
[2022-05-15 16:17:44] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-15 16:17:44] [INFO ] State equation strengthened by 11 read => feed constraints.
[2022-05-15 16:17:44] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/192 places, 16/225 transitions.
Finished structural reductions, in 2 iterations. Remains : 12/192 places, 16/225 transitions.
Stuttering acceptance computed with spot in 397 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-00 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s0 1), p1:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-00 finished in 738 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((X(G(p1))&&p0))||X(p1))))'
Support contains 1 out of 192 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 225/225 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 183 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 183 transition count 216
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 178 transition count 211
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 178 transition count 211
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 174 transition count 203
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 174 transition count 203
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 170 transition count 199
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 170 transition count 199
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 166 transition count 195
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 166 transition count 195
Applied a total of 52 rules in 43 ms. Remains 166 /192 variables (removed 26) and now considering 195/225 (removed 30) transitions.
// Phase 1: matrix 195 rows 166 cols
[2022-05-15 16:17:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:45] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 195 rows 166 cols
[2022-05-15 16:17:45] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:17:45] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
// Phase 1: matrix 195 rows 166 cols
[2022-05-15 16:17:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:45] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/192 places, 195/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 166/192 places, 195/225 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s59 1)], 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 3893 reset in 390 ms.
Stack based approach found an accepted trace after 490 steps with 17 reset with depth 20 and stack size 20 in 1 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-01 finished in 1006 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p1)||(G(p3)&&p2)))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 225/225 transitions.
Graph (complete) has 380 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 188 transition count 195
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 162 transition count 195
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 53 place count 162 transition count 165
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 113 place count 132 transition count 165
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 117 place count 128 transition count 161
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 128 transition count 161
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 124 transition count 157
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 124 transition count 157
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 133 place count 120 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 137 place count 120 transition count 149
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 117 transition count 146
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 117 transition count 146
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 231 place count 73 transition count 102
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 238 place count 66 transition count 88
Iterating global reduction 2 with 7 rules applied. Total rules applied 245 place count 66 transition count 88
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 252 place count 59 transition count 81
Iterating global reduction 2 with 7 rules applied. Total rules applied 259 place count 59 transition count 81
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 266 place count 52 transition count 67
Iterating global reduction 2 with 7 rules applied. Total rules applied 273 place count 52 transition count 67
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 280 place count 45 transition count 60
Iterating global reduction 2 with 7 rules applied. Total rules applied 287 place count 45 transition count 60
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 294 place count 38 transition count 46
Iterating global reduction 2 with 7 rules applied. Total rules applied 301 place count 38 transition count 46
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 308 place count 31 transition count 39
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 31 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 317 place count 30 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 319 place count 28 transition count 38
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 47 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 5 rules applied. Total rules applied 324 place count 26 transition count 34
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 327 place count 23 transition count 34
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 4 with 6 rules applied. Total rules applied 333 place count 20 transition count 31
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 336 place count 17 transition count 28
Applied a total of 336 rules in 46 ms. Remains 17 /192 variables (removed 175) and now considering 28/225 (removed 197) transitions.
[2022-05-15 16:17:45] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
// Phase 1: matrix 23 rows 17 cols
[2022-05-15 16:17:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:17:45] [INFO ] Implicit Places using invariants in 45 ms returned []
[2022-05-15 16:17:45] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
// Phase 1: matrix 23 rows 17 cols
[2022-05-15 16:17:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:17:45] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-15 16:17:45] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:17:45] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
// Phase 1: matrix 23 rows 17 cols
[2022-05-15 16:17:45] [INFO ] Computed 1 place invariants in 8 ms
[2022-05-15 16:17:46] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/192 places, 28/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 17/192 places, 28/225 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p2 p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2 p3), acceptance={1} source=0 dest: 1}], [{ cond=(AND p1 (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s16 1) (EQ s12 1) (EQ s16 1)), p2:(AND (EQ s7 1) (EQ s16 1) (EQ s12 1)), p3:(AND (EQ s7 1) (EQ s16 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-03 finished in 310 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p0)||p1))&&X(F(p2)))))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 225/225 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 182 transition count 215
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 182 transition count 215
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 177 transition count 210
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 177 transition count 210
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 173 transition count 202
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 173 transition count 202
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 169 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 169 transition count 198
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 166 transition count 195
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 166 transition count 195
Applied a total of 52 rules in 18 ms. Remains 166 /192 variables (removed 26) and now considering 195/225 (removed 30) transitions.
// Phase 1: matrix 195 rows 166 cols
[2022-05-15 16:17:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:46] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 195 rows 166 cols
[2022-05-15 16:17:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:46] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
// Phase 1: matrix 195 rows 166 cols
[2022-05-15 16:17:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:46] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/192 places, 195/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 166/192 places, 195/225 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s0 1), p0:(EQ s62 1), p2:(EQ s62 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-04 finished in 589 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((X(p0) U p0)))))'
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 225/225 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 183 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 183 transition count 216
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 179 transition count 212
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 179 transition count 212
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 176 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 176 transition count 206
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 173 transition count 203
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 173 transition count 203
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 170 transition count 200
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 170 transition count 200
Applied a total of 44 rules in 14 ms. Remains 170 /192 variables (removed 22) and now considering 200/225 (removed 25) transitions.
// Phase 1: matrix 200 rows 170 cols
[2022-05-15 16:17:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:17:46] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 200 rows 170 cols
[2022-05-15 16:17:46] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:17:46] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 170 cols
[2022-05-15 16:17:46] [INFO ] Computed 2 place invariants in 16 ms
[2022-05-15 16:17:47] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/192 places, 200/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/192 places, 200/225 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 359 steps with 0 reset in 5 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-05 finished in 433 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&X(p1)))&&F(G(X(F(p2))))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 225/225 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 183 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 183 transition count 216
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 178 transition count 211
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 178 transition count 211
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 174 transition count 203
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 174 transition count 203
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 170 transition count 199
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 170 transition count 199
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 166 transition count 195
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 166 transition count 195
Applied a total of 52 rules in 13 ms. Remains 166 /192 variables (removed 26) and now considering 195/225 (removed 30) transitions.
// Phase 1: matrix 195 rows 166 cols
[2022-05-15 16:17:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:47] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 195 rows 166 cols
[2022-05-15 16:17:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:47] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
// Phase 1: matrix 195 rows 166 cols
[2022-05-15 16:17:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:47] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 166/192 places, 195/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 166/192 places, 195/225 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s33 0), p0:(EQ s70 1), p1:(EQ s109 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 495 reset in 228 ms.
Stack based approach found an accepted trace after 182 steps with 0 reset with depth 183 and stack size 183 in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-07 finished in 834 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(G(F((F(G((G(p0)&&p0)))&&p0)))))))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 225/225 transitions.
Graph (complete) has 380 edges and 192 vertex of which 189 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 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 188 transition count 194
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 161 transition count 194
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 55 place count 161 transition count 164
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 115 place count 131 transition count 164
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 120 place count 126 transition count 159
Iterating global reduction 2 with 5 rules applied. Total rules applied 125 place count 126 transition count 159
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 122 transition count 155
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 122 transition count 155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 137 place count 118 transition count 147
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 118 transition count 147
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 145 place count 114 transition count 143
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 114 transition count 143
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 239 place count 69 transition count 98
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 248 place count 60 transition count 80
Iterating global reduction 2 with 9 rules applied. Total rules applied 257 place count 60 transition count 80
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 265 place count 52 transition count 72
Iterating global reduction 2 with 8 rules applied. Total rules applied 273 place count 52 transition count 72
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 281 place count 44 transition count 56
Iterating global reduction 2 with 8 rules applied. Total rules applied 289 place count 44 transition count 56
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 297 place count 36 transition count 48
Iterating global reduction 2 with 8 rules applied. Total rules applied 305 place count 36 transition count 48
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 313 place count 28 transition count 32
Iterating global reduction 2 with 8 rules applied. Total rules applied 321 place count 28 transition count 32
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 329 place count 20 transition count 24
Iterating global reduction 2 with 8 rules applied. Total rules applied 337 place count 20 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 20 transition count 23
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 18 transition count 21
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 342 place count 17 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 343 place count 16 transition count 20
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 343 place count 16 transition count 17
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 349 place count 13 transition count 17
Applied a total of 349 rules in 22 ms. Remains 13 /192 variables (removed 179) and now considering 17/225 (removed 208) transitions.
[2022-05-15 16:17:48] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 13 cols
[2022-05-15 16:17:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:17:48] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-15 16:17:48] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 13 cols
[2022-05-15 16:17:48] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:17:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 16:17:48] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-15 16:17:48] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:17:48] [INFO ] Flow matrix only has 15 transitions (discarded 2 similar events)
// Phase 1: matrix 15 rows 13 cols
[2022-05-15 16:17:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:17:48] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/192 places, 17/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/192 places, 17/225 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s8 0) (EQ s12 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 857 reset in 166 ms.
Stack based approach found an accepted trace after 1092 steps with 9 reset with depth 27 and stack size 17 in 2 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-08 finished in 529 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(X(G(F(p0))))||p1))))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 225/225 transitions.
Graph (complete) has 380 edges and 192 vertex of which 189 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
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 188 transition count 193
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 160 transition count 193
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 57 place count 160 transition count 163
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 117 place count 130 transition count 163
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 120 place count 127 transition count 160
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 127 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 125 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 125 transition count 158
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 123 transition count 154
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 123 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 121 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 121 transition count 152
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 231 place count 73 transition count 104
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 238 place count 66 transition count 90
Iterating global reduction 2 with 7 rules applied. Total rules applied 245 place count 66 transition count 90
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 252 place count 59 transition count 83
Iterating global reduction 2 with 7 rules applied. Total rules applied 259 place count 59 transition count 83
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 266 place count 52 transition count 69
Iterating global reduction 2 with 7 rules applied. Total rules applied 273 place count 52 transition count 69
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 280 place count 45 transition count 62
Iterating global reduction 2 with 7 rules applied. Total rules applied 287 place count 45 transition count 62
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 294 place count 38 transition count 48
Iterating global reduction 2 with 7 rules applied. Total rules applied 301 place count 38 transition count 48
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 308 place count 31 transition count 41
Iterating global reduction 2 with 7 rules applied. Total rules applied 315 place count 31 transition count 41
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 316 place count 31 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 318 place count 29 transition count 38
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 34 edges and 27 vertex of which 24 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 2 with 9 rules applied. Total rules applied 327 place count 24 transition count 29
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 333 place count 18 transition count 29
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 343 place count 13 transition count 24
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 346 place count 13 transition count 21
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 349 place count 10 transition count 18
Applied a total of 349 rules in 22 ms. Remains 10 /192 variables (removed 182) and now considering 18/225 (removed 207) transitions.
[2022-05-15 16:17:48] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-15 16:17:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:17:48] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-15 16:17:48] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-15 16:17:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:17:48] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-15 16:17:48] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:17:48] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-15 16:17:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:17:48] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/192 places, 18/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/192 places, 18/225 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s3 1), p0:(EQ s8 1)], 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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-09 finished in 210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X(F(G(F((F(p0)&&p1)))))))))'
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 225/225 transitions.
Graph (complete) has 380 edges and 192 vertex of which 189 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 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 188 transition count 193
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 160 transition count 193
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 57 place count 160 transition count 162
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 119 place count 129 transition count 162
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 124 place count 124 transition count 157
Iterating global reduction 2 with 5 rules applied. Total rules applied 129 place count 124 transition count 157
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 133 place count 120 transition count 153
Iterating global reduction 2 with 4 rules applied. Total rules applied 137 place count 120 transition count 153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 117 transition count 147
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 117 transition count 147
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 146 place count 114 transition count 144
Iterating global reduction 2 with 3 rules applied. Total rules applied 149 place count 114 transition count 144
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 239 place count 69 transition count 99
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 247 place count 61 transition count 83
Iterating global reduction 2 with 8 rules applied. Total rules applied 255 place count 61 transition count 83
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 263 place count 53 transition count 75
Iterating global reduction 2 with 8 rules applied. Total rules applied 271 place count 53 transition count 75
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 279 place count 45 transition count 59
Iterating global reduction 2 with 8 rules applied. Total rules applied 287 place count 45 transition count 59
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 295 place count 37 transition count 51
Iterating global reduction 2 with 8 rules applied. Total rules applied 303 place count 37 transition count 51
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 311 place count 29 transition count 35
Iterating global reduction 2 with 8 rules applied. Total rules applied 319 place count 29 transition count 35
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 327 place count 21 transition count 27
Iterating global reduction 2 with 8 rules applied. Total rules applied 335 place count 21 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 336 place count 21 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 19 transition count 24
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 17 vertex of which 14 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 345 place count 14 transition count 17
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 350 place count 10 transition count 16
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 354 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 355 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 357 place count 6 transition count 11
Applied a total of 357 rules in 40 ms. Remains 6 /192 variables (removed 186) and now considering 11/225 (removed 214) transitions.
[2022-05-15 16:17:48] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 16:17:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:17:48] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-15 16:17:48] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 16:17:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:17:48] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2022-05-15 16:17:48] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:17:48] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 16:17:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:17:48] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/192 places, 11/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/192 places, 11/225 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-10 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:(EQ s3 1), p1:(EQ s3 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-10 finished in 328 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(X(G(p1))&&p2))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 225/225 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 183 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 183 transition count 216
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 179 transition count 212
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 179 transition count 212
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 176 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 176 transition count 206
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 173 transition count 203
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 173 transition count 203
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 170 transition count 200
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 170 transition count 200
Applied a total of 44 rules in 10 ms. Remains 170 /192 variables (removed 22) and now considering 200/225 (removed 25) transitions.
// Phase 1: matrix 200 rows 170 cols
[2022-05-15 16:17:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:17:49] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 200 rows 170 cols
[2022-05-15 16:17:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:49] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 170 cols
[2022-05-15 16:17:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:49] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/192 places, 200/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/192 places, 200/225 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p0 p1) (AND p2 p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s52 0), p2:(OR (EQ s62 0) (EQ s145 0)), p1:(EQ s145 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 1752 steps with 4 reset in 8 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-11 finished in 466 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((F(p0)&&p1))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 225/225 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 183 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 183 transition count 216
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 179 transition count 212
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 179 transition count 212
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 176 transition count 206
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 176 transition count 206
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 173 transition count 203
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 173 transition count 203
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 170 transition count 200
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 170 transition count 200
Applied a total of 44 rules in 10 ms. Remains 170 /192 variables (removed 22) and now considering 200/225 (removed 25) transitions.
// Phase 1: matrix 200 rows 170 cols
[2022-05-15 16:17:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:49] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 200 rows 170 cols
[2022-05-15 16:17:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:49] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 170 cols
[2022-05-15 16:17:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:49] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/192 places, 200/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 170/192 places, 200/225 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s45 1) (EQ s169 1)), p1:(EQ s34 1)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-12 finished in 410 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 225/225 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 182 transition count 215
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 182 transition count 215
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 177 transition count 210
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 177 transition count 210
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 173 transition count 202
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 173 transition count 202
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 169 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 169 transition count 198
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 165 transition count 194
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 165 transition count 194
Applied a total of 54 rules in 15 ms. Remains 165 /192 variables (removed 27) and now considering 194/225 (removed 31) transitions.
// Phase 1: matrix 194 rows 165 cols
[2022-05-15 16:17:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:17:49] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 194 rows 165 cols
[2022-05-15 16:17:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:17:50] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 194 rows 165 cols
[2022-05-15 16:17:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:17:50] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 165/192 places, 194/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/192 places, 194/225 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s66 0) (OR (EQ s134 0) (EQ s161 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 33333 reset in 140 ms.
Product exploration explored 100000 steps with 33333 reset in 138 ms.
Computed a total of 32 stabilizing places and 32 stable transitions
Graph (complete) has 334 edges and 165 vertex of which 164 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 32 stabilizing places and 32 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 51 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-13 finished in 702 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(!p0))||G(p1)))'
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 225/225 transitions.
Graph (complete) has 380 edges and 192 vertex of which 189 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 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 188 transition count 195
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 162 transition count 195
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 53 place count 162 transition count 164
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 115 place count 131 transition count 164
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 120 place count 126 transition count 159
Iterating global reduction 2 with 5 rules applied. Total rules applied 125 place count 126 transition count 159
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 122 transition count 155
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 122 transition count 155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 137 place count 118 transition count 147
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 118 transition count 147
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 145 place count 114 transition count 143
Iterating global reduction 2 with 4 rules applied. Total rules applied 149 place count 114 transition count 143
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 235 place count 71 transition count 100
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 242 place count 64 transition count 86
Iterating global reduction 2 with 7 rules applied. Total rules applied 249 place count 64 transition count 86
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 256 place count 57 transition count 79
Iterating global reduction 2 with 7 rules applied. Total rules applied 263 place count 57 transition count 79
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 270 place count 50 transition count 65
Iterating global reduction 2 with 7 rules applied. Total rules applied 277 place count 50 transition count 65
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 284 place count 43 transition count 58
Iterating global reduction 2 with 7 rules applied. Total rules applied 291 place count 43 transition count 58
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 298 place count 36 transition count 44
Iterating global reduction 2 with 7 rules applied. Total rules applied 305 place count 36 transition count 44
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 312 place count 29 transition count 37
Iterating global reduction 2 with 7 rules applied. Total rules applied 319 place count 29 transition count 37
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 320 place count 29 transition count 36
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 322 place count 29 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 30 edges and 25 vertex of which 22 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 2 with 9 rules applied. Total rules applied 333 place count 22 transition count 25
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 339 place count 16 transition count 25
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 4 with 6 rules applied. Total rules applied 345 place count 13 transition count 22
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 4 with 2 rules applied. Total rules applied 347 place count 12 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 348 place count 12 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 349 place count 12 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 352 place count 9 transition count 17
Applied a total of 352 rules in 28 ms. Remains 9 /192 variables (removed 183) and now considering 17/225 (removed 208) transitions.
[2022-05-15 16:17:50] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 9 cols
[2022-05-15 16:17:50] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 16:17:50] [INFO ] Implicit Places using invariants in 15 ms returned []
[2022-05-15 16:17:50] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 9 cols
[2022-05-15 16:17:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:17:50] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-15 16:17:50] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:17:50] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 9 cols
[2022-05-15 16:17:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:17:50] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/192 places, 17/225 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/192 places, 17/225 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, p0, (AND p0 (NOT p1)), p0, (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-10b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(NEQ s7 1), p1:(EQ s4 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10b-LTLFireability-15 finished in 317 ms.
All properties solved by simple procedures.
Total runtime 8983 ms.

BK_STOP 1652631470999

--------------------
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-10b"
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-10b, 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-165260109800076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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