Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 82K May 5 16:51 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-11b-00
FORMULA_NAME DiscoveryGPU-PT-11b-01
FORMULA_NAME DiscoveryGPU-PT-11b-02
FORMULA_NAME DiscoveryGPU-PT-11b-03
FORMULA_NAME DiscoveryGPU-PT-11b-04
FORMULA_NAME DiscoveryGPU-PT-11b-05
FORMULA_NAME DiscoveryGPU-PT-11b-06
FORMULA_NAME DiscoveryGPU-PT-11b-07
FORMULA_NAME DiscoveryGPU-PT-11b-08
FORMULA_NAME DiscoveryGPU-PT-11b-09
FORMULA_NAME DiscoveryGPU-PT-11b-10
FORMULA_NAME DiscoveryGPU-PT-11b-11
FORMULA_NAME DiscoveryGPU-PT-11b-12
FORMULA_NAME DiscoveryGPU-PT-11b-13
FORMULA_NAME DiscoveryGPU-PT-11b-14
FORMULA_NAME DiscoveryGPU-PT-11b-15

=== Now, execution of the tool begins

BK_START 1620578239507

Running Version 0
[2021-05-09 16:37:21] [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]
[2021-05-09 16:37:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 16:37:21] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2021-05-09 16:37:21] [INFO ] Transformed 324 places.
[2021-05-09 16:37:21] [INFO ] Transformed 344 transitions.
[2021-05-09 16:37:21] [INFO ] Found NUPN structural information;
[2021-05-09 16:37:21] [INFO ] Parsed PT model containing 324 places and 344 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 16:37:21] [INFO ] Initial state test concluded for 1 properties.
Support contains 35 out of 324 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 324/324 places, 344/344 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 302 transition count 344
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 71 place count 253 transition count 295
Iterating global reduction 1 with 49 rules applied. Total rules applied 120 place count 253 transition count 295
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 131 place count 242 transition count 284
Iterating global reduction 1 with 11 rules applied. Total rules applied 142 place count 242 transition count 284
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 151 place count 233 transition count 275
Iterating global reduction 1 with 9 rules applied. Total rules applied 160 place count 233 transition count 275
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 168 place count 225 transition count 267
Iterating global reduction 1 with 8 rules applied. Total rules applied 176 place count 225 transition count 267
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 180 place count 221 transition count 259
Iterating global reduction 1 with 4 rules applied. Total rules applied 184 place count 221 transition count 259
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 188 place count 217 transition count 255
Iterating global reduction 1 with 4 rules applied. Total rules applied 192 place count 217 transition count 255
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 196 place count 213 transition count 251
Iterating global reduction 1 with 4 rules applied. Total rules applied 200 place count 213 transition count 251
Applied a total of 200 rules in 83 ms. Remains 213 /324 variables (removed 111) and now considering 251/344 (removed 93) transitions.
// Phase 1: matrix 251 rows 213 cols
[2021-05-09 16:37:21] [INFO ] Computed 2 place invariants in 20 ms
[2021-05-09 16:37:21] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 251 rows 213 cols
[2021-05-09 16:37:21] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:37:21] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
// Phase 1: matrix 251 rows 213 cols
[2021-05-09 16:37:21] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 16:37:21] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Finished structural reductions, in 1 iterations. Remains : 213/324 places, 251/344 transitions.
[2021-05-09 16:37:22] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 16:37:22] [INFO ] Flatten gal took : 53 ms
FORMULA DiscoveryGPU-PT-11b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 16:37:22] [INFO ] Flatten gal took : 18 ms
[2021-05-09 16:37:22] [INFO ] Input system was already deterministic with 251 transitions.
Finished random walk after 1741 steps, including 4 resets, run visited all 30 properties in 19 ms. (steps per millisecond=91 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(F(p0)) U G(p1)) U p2))], workingDir=/home/mcc/execution]
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 199 transition count 234
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 199 transition count 234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 193 transition count 227
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 193 transition count 227
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 187 transition count 220
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 187 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 184 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 184 transition count 217
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 182 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 182 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 181 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 181 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 180 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 180 transition count 212
Applied a total of 66 rules in 31 ms. Remains 180 /213 variables (removed 33) and now considering 212/251 (removed 39) transitions.
// Phase 1: matrix 212 rows 180 cols
[2021-05-09 16:37:22] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:37:22] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 212 rows 180 cols
[2021-05-09 16:37:22] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:37:22] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 212 rows 180 cols
[2021-05-09 16:37:22] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:22] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Finished structural reductions, in 1 iterations. Remains : 180/213 places, 212/251 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-00 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s22 1) (EQ s176 1)), p1:(OR (EQ s121 0) (EQ s176 0)), p0:(AND (EQ s121 1) (EQ s176 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1194 steps with 3 reset in 12 ms.
FORMULA DiscoveryGPU-PT-11b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-00 finished in 551 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0)) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 212 transition count 216
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 178 transition count 216
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 68 place count 178 transition count 184
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 132 place count 146 transition count 184
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 138 place count 140 transition count 175
Iterating global reduction 2 with 6 rules applied. Total rules applied 144 place count 140 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 149 place count 135 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 154 place count 135 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 134 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 134 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 133 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 133 transition count 167
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 264 place count 80 transition count 114
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 274 place count 70 transition count 95
Iterating global reduction 2 with 10 rules applied. Total rules applied 284 place count 70 transition count 95
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 294 place count 60 transition count 83
Iterating global reduction 2 with 10 rules applied. Total rules applied 304 place count 60 transition count 83
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 313 place count 51 transition count 66
Iterating global reduction 2 with 9 rules applied. Total rules applied 322 place count 51 transition count 66
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 331 place count 42 transition count 56
Iterating global reduction 2 with 9 rules applied. Total rules applied 340 place count 42 transition count 56
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 348 place count 34 transition count 41
Iterating global reduction 2 with 8 rules applied. Total rules applied 356 place count 34 transition count 41
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 364 place count 26 transition count 32
Iterating global reduction 2 with 8 rules applied. Total rules applied 372 place count 26 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 374 place count 24 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 376 place count 24 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 377 place count 23 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 378 place count 23 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 379 place count 23 transition count 27
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 381 place count 23 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 382 place count 22 transition count 26
Reduce places removed 2 places and 0 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 6 rules applied. Total rules applied 388 place count 20 transition count 22
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 392 place count 16 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 392 place count 16 transition count 21
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 394 place count 15 transition count 21
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 404 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
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 408 place count 8 transition count 17
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 410 place count 8 transition count 15
Applied a total of 410 rules in 63 ms. Remains 8 /213 variables (removed 205) and now considering 15/251 (removed 236) transitions.
[2021-05-09 16:37:22] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 8 cols
[2021-05-09 16:37:22] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:37:22] [INFO ] Implicit Places using invariants in 7 ms returned []
[2021-05-09 16:37:22] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 8 cols
[2021-05-09 16:37:22] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:37:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:37:22] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-09 16:37:22] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:37:22] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 8 cols
[2021-05-09 16:37:22] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:37:22] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/213 places, 15/251 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s4 1), p0:(EQ s6 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 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-01 finished in 195 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 212 transition count 215
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 177 transition count 215
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 70 place count 177 transition count 184
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 132 place count 146 transition count 184
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 137 place count 141 transition count 177
Iterating global reduction 2 with 5 rules applied. Total rules applied 142 place count 141 transition count 177
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 146 place count 137 transition count 173
Iterating global reduction 2 with 4 rules applied. Total rules applied 150 place count 137 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 136 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 136 transition count 171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 135 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 135 transition count 170
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 262 place count 81 transition count 116
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 271 place count 72 transition count 99
Iterating global reduction 2 with 9 rules applied. Total rules applied 280 place count 72 transition count 99
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 289 place count 63 transition count 88
Iterating global reduction 2 with 9 rules applied. Total rules applied 298 place count 63 transition count 88
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 307 place count 54 transition count 71
Iterating global reduction 2 with 9 rules applied. Total rules applied 316 place count 54 transition count 71
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 323 place count 47 transition count 63
Iterating global reduction 2 with 7 rules applied. Total rules applied 330 place count 47 transition count 63
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 337 place count 40 transition count 50
Iterating global reduction 2 with 7 rules applied. Total rules applied 344 place count 40 transition count 50
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 351 place count 33 transition count 42
Iterating global reduction 2 with 7 rules applied. Total rules applied 358 place count 33 transition count 42
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 359 place count 32 transition count 41
Iterating global reduction 2 with 1 rules applied. Total rules applied 360 place count 32 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 361 place count 31 transition count 40
Reduce places removed 1 places and 0 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 2 with 3 rules applied. Total rules applied 364 place count 30 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 366 place count 28 transition count 38
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 380 place count 21 transition count 31
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 382 place count 20 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 19 transition count 30
Applied a total of 383 rules in 44 ms. Remains 19 /213 variables (removed 194) and now considering 30/251 (removed 221) transitions.
[2021-05-09 16:37:23] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 19 cols
[2021-05-09 16:37:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:37:23] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-09 16:37:23] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 19 cols
[2021-05-09 16:37:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:37:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:37:23] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2021-05-09 16:37:23] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:37:23] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 19 cols
[2021-05-09 16:37:23] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:37:23] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/213 places, 30/251 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s11 1), p1:(OR (EQ s3 1) (EQ s15 0) (EQ s18 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 12 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-03 finished in 178 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 201 transition count 237
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 201 transition count 237
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 197 transition count 232
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 197 transition count 232
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 193 transition count 227
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 193 transition count 227
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 191 transition count 225
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 191 transition count 225
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 190 transition count 224
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 190 transition count 224
Applied a total of 46 rules in 20 ms. Remains 190 /213 variables (removed 23) and now considering 224/251 (removed 27) transitions.
// Phase 1: matrix 224 rows 190 cols
[2021-05-09 16:37:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:23] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 224 rows 190 cols
[2021-05-09 16:37:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:23] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 224 rows 190 cols
[2021-05-09 16:37:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:23] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 190/213 places, 224/251 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s67 1), p0:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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-11b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-04 finished in 388 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U (p1&&G((p2||G(p3)))&&X(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 200 transition count 235
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 200 transition count 235
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 194 transition count 228
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 194 transition count 228
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 188 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 188 transition count 221
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 185 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 185 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 183 transition count 215
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 183 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 182 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 182 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 181 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 181 transition count 213
Applied a total of 64 rules in 28 ms. Remains 181 /213 variables (removed 32) and now considering 213/251 (removed 38) transitions.
// Phase 1: matrix 213 rows 181 cols
[2021-05-09 16:37:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:23] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 213 rows 181 cols
[2021-05-09 16:37:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:23] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 213 rows 181 cols
[2021-05-09 16:37:23] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:23] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 181/213 places, 213/251 transitions.
Stuttering acceptance computed with spot in 521 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p3), (AND (NOT p3) (NOT p2)), (OR (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3)), (NOT p2), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-11b-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 p2) (AND p1 p3) p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p0))), acceptance={} source=1 dest: 2}, { cond=(OR (AND p1 p2 (NOT p0)) (AND p1 p3 (NOT p0))), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) p3 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) (NOT p3) p0)), acceptance={} source=1 dest: 6}, { cond=(OR (AND p1 p2 p0) (AND p1 p3 p0)), acceptance={} source=1 dest: 7}, { cond=(OR (AND p1 p2 p0) (AND p1 p3 p0)), acceptance={} source=1 dest: 8}, { cond=(AND p1 (NOT p2) p3 p0), acceptance={} source=1 dest: 9}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p0))), acceptance={} source=6 dest: 2}, { cond=(OR (AND p1 p2 (NOT p0)) (AND p1 p3 (NOT p0))), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p2) p3 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) (NOT p3) p0)), acceptance={0, 1} source=6 dest: 6}, { cond=(OR (AND p1 p2 p0) (AND p1 p3 p0)), acceptance={0} source=6 dest: 7}, { cond=(OR (AND p1 p2 p0) (AND p1 p3 p0)), acceptance={0, 1} source=6 dest: 8}, { cond=(AND p1 (NOT p2) p3 p0), acceptance={1} source=6 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0, 1} source=7 dest: 6}, { cond=(OR (AND p2 p0) (AND p3 p0)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p2) p3 p0), acceptance={1} source=7 dest: 9}], [{ cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p0))), acceptance={} source=8 dest: 2}, { cond=(AND p1 (NOT p2) p3 (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND p1 (NOT p2) p3 (NOT p0)), acceptance={} source=8 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p2) (NOT p3) p0)), acceptance={0, 1} source=8 dest: 6}, { cond=(AND p1 (NOT p2) p3 p0), acceptance={0} source=8 dest: 7}, { cond=(AND p1 (NOT p2) p3 p0), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p1 (NOT p2) p3 p0), acceptance={1} source=8 dest: 9}], [{ cond=(OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) (NOT p0))), acceptance={} source=9 dest: 2}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=9 dest: 3}, { cond=(OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p2) p3 (NOT p0))), acceptance={} source=9 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p2) (NOT p3) p0)), acceptance={0, 1} source=9 dest: 6}, { cond=(AND p1 p2 (NOT p3) p0), acceptance={0} source=9 dest: 7}, { cond=(AND p1 p2 (NOT p3) p0), acceptance={0, 1} source=9 dest: 8}, { cond=(OR (AND (NOT p1) p3 p0) (AND (NOT p2) p3 p0)), acceptance={1} source=9 dest: 9}, { cond=(AND p1 p2 p3 p0), acceptance={} source=9 dest: 10}, { cond=(AND p1 p2 p3 p0), acceptance={1} source=9 dest: 11}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=10 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0, 1} source=10 dest: 6}, { cond=(AND p2 (NOT p3) p0), acceptance={0} source=10 dest: 7}, { cond=(AND (NOT p2) p3 p0), acceptance={1} source=10 dest: 9}, { cond=(AND p2 p3 p0), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=11 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0, 1} source=11 dest: 6}, { cond=(AND (NOT p2) p3 p0), acceptance={1} source=11 dest: 9}]], initial=0, aps=[p1:(OR (EQ s100 0) (EQ s177 0)), p2:(NEQ s56 1), p3:(NEQ s170 1), p0:(EQ s131 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 260 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-05 finished in 863 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 199 transition count 234
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 199 transition count 234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 193 transition count 227
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 193 transition count 227
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 187 transition count 220
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 187 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 184 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 184 transition count 217
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 182 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 182 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 181 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 181 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 180 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 180 transition count 212
Applied a total of 66 rules in 16 ms. Remains 180 /213 variables (removed 33) and now considering 212/251 (removed 39) transitions.
// Phase 1: matrix 212 rows 180 cols
[2021-05-09 16:37:24] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:24] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 212 rows 180 cols
[2021-05-09 16:37:24] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 16:37:24] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 212 rows 180 cols
[2021-05-09 16:37:24] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:24] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 1 iterations. Remains : 180/213 places, 212/251 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s113 1) (AND (EQ s142 1) (EQ s176 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-06 finished in 349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 212 transition count 214
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 176 transition count 214
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 72 place count 176 transition count 182
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 136 place count 144 transition count 182
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 141 place count 139 transition count 175
Iterating global reduction 2 with 5 rules applied. Total rules applied 146 place count 139 transition count 175
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 135 transition count 171
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 135 transition count 171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 155 place count 134 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 134 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 133 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 133 transition count 168
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 266 place count 79 transition count 114
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 274 place count 71 transition count 99
Iterating global reduction 2 with 8 rules applied. Total rules applied 282 place count 71 transition count 99
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 290 place count 63 transition count 89
Iterating global reduction 2 with 8 rules applied. Total rules applied 298 place count 63 transition count 89
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 306 place count 55 transition count 74
Iterating global reduction 2 with 8 rules applied. Total rules applied 314 place count 55 transition count 74
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 322 place count 47 transition count 65
Iterating global reduction 2 with 8 rules applied. Total rules applied 330 place count 47 transition count 65
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 338 place count 39 transition count 50
Iterating global reduction 2 with 8 rules applied. Total rules applied 346 place count 39 transition count 50
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 354 place count 31 transition count 41
Iterating global reduction 2 with 8 rules applied. Total rules applied 362 place count 31 transition count 41
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 364 place count 29 transition count 38
Iterating global reduction 2 with 2 rules applied. Total rules applied 366 place count 29 transition count 38
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 367 place count 28 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 368 place count 28 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 369 place count 28 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 370 place count 27 transition count 35
Reduce places removed 2 places and 0 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 8 rules applied. Total rules applied 378 place count 25 transition count 29
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 384 place count 19 transition count 29
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 402 place count 10 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 403 place count 10 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 404 place count 10 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 405 place count 9 transition count 17
Applied a total of 405 rules in 33 ms. Remains 9 /213 variables (removed 204) and now considering 17/251 (removed 234) transitions.
[2021-05-09 16:37:24] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 9 cols
[2021-05-09 16:37:24] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:37:24] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 16:37:24] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 9 cols
[2021-05-09 16:37:24] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:37:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:37:24] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-09 16:37:24] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:37:24] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 9 cols
[2021-05-09 16:37:24] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:37:24] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/213 places, 17/251 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 1), p1:(EQ s7 1)], nbAcceptance=2, 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-11b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-07 finished in 100 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(G(p0))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 199 transition count 234
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 199 transition count 234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 193 transition count 227
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 193 transition count 227
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 187 transition count 220
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 187 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 184 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 184 transition count 217
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 182 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 182 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 181 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 181 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 180 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 180 transition count 212
Applied a total of 66 rules in 14 ms. Remains 180 /213 variables (removed 33) and now considering 212/251 (removed 39) transitions.
// Phase 1: matrix 212 rows 180 cols
[2021-05-09 16:37:24] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 16:37:24] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 212 rows 180 cols
[2021-05-09 16:37:24] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:25] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
// Phase 1: matrix 212 rows 180 cols
[2021-05-09 16:37:25] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:37:25] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 180/213 places, 212/251 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-08 finished in 376 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 200 transition count 235
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 200 transition count 235
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 194 transition count 228
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 194 transition count 228
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 188 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 188 transition count 221
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 185 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 185 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 183 transition count 215
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 183 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 182 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 182 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 181 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 181 transition count 213
Applied a total of 64 rules in 14 ms. Remains 181 /213 variables (removed 32) and now considering 213/251 (removed 38) transitions.
// Phase 1: matrix 213 rows 181 cols
[2021-05-09 16:37:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:25] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 213 rows 181 cols
[2021-05-09 16:37:25] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:37:25] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 213 rows 181 cols
[2021-05-09 16:37:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:25] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 181/213 places, 213/251 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s73 1) (EQ s177 1)), p0:(EQ s129 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2609 reset in 243 ms.
Stack based approach found an accepted trace after 476 steps with 12 reset with depth 24 and stack size 24 in 2 ms.
FORMULA DiscoveryGPU-PT-11b-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-09 finished in 688 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((F(G(p0)) U p1)||F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 202 transition count 237
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 202 transition count 237
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 197 transition count 231
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 197 transition count 231
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 192 transition count 226
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 192 transition count 226
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 190 transition count 224
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 190 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 189 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 189 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 188 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 188 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 187 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 187 transition count 220
Applied a total of 52 rules in 13 ms. Remains 187 /213 variables (removed 26) and now considering 220/251 (removed 31) transitions.
// Phase 1: matrix 220 rows 187 cols
[2021-05-09 16:37:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:26] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 220 rows 187 cols
[2021-05-09 16:37:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:26] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
// Phase 1: matrix 220 rows 187 cols
[2021-05-09 16:37:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:26] [INFO ] Dead Transitions using invariants and state equation in 85 ms returned []
Finished structural reductions, in 1 iterations. Remains : 187/213 places, 220/251 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11b-10 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (EQ s156 0) (EQ s169 1)), p2:(AND (EQ s98 1) (EQ s169 1)), p0:(EQ s105 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Product exploration explored 100000 steps with 50000 reset in 345 ms.
Graph (complete) has 376 edges and 187 vertex of which 185 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Knowledge obtained : [p1, (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 236 ms.
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 187 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 187/187 places, 220/220 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 187 transition count 220
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 35 Pre rules applied. Total rules applied 23 place count 187 transition count 322
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 58 place count 187 transition count 322
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 187 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 186 transition count 321
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 186 transition count 321
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -108
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 109 place count 186 transition count 429
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 118 place count 177 transition count 393
Deduced a syphon composed of 106 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 127 place count 177 transition count 393
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 152 place count 152 transition count 327
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 177 place count 152 transition count 327
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 199 place count 130 transition count 277
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 221 place count 130 transition count 277
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 228 place count 123 transition count 263
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 235 place count 123 transition count 263
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 247 place count 111 transition count 233
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 259 place count 111 transition count 233
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 283 place count 87 transition count 173
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 307 place count 87 transition count 173
Deduced a syphon composed of 50 places in 0 ms
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 1 with 22 rules applied. Total rules applied 329 place count 87 transition count 151
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 333 place count 83 transition count 143
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 337 place count 83 transition count 143
Deduced a syphon composed of 46 places in 0 ms
Applied a total of 337 rules in 45 ms. Remains 83 /187 variables (removed 104) and now considering 143/220 (removed 77) transitions.
[2021-05-09 16:37:27] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-09 16:37:27] [INFO ] Flow matrix only has 133 transitions (discarded 10 similar events)
// Phase 1: matrix 133 rows 83 cols
[2021-05-09 16:37:27] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:37:27] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 83/187 places, 143/220 transitions.
Product exploration explored 100000 steps with 50000 reset in 694 ms.
Product exploration explored 100000 steps with 50000 reset in 594 ms.
[2021-05-09 16:37:29] [INFO ] Flatten gal took : 12 ms
[2021-05-09 16:37:29] [INFO ] Flatten gal took : 11 ms
[2021-05-09 16:37:29] [INFO ] Time to serialize gal into /tmp/LTL17245952940583517169.gal : 6 ms
[2021-05-09 16:37:29] [INFO ] Time to serialize properties into /tmp/LTL12474252521856674772.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17245952940583517169.gal, -t, CGAL, -LTL, /tmp/LTL12474252521856674772.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17245952940583517169.gal -t CGAL -LTL /tmp/LTL12474252521856674772.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((F(G("(p180==1)")))U("((p272==0)||(p295==1))"))||(F(G("((p168==1)&&(p295==1))"))))))
Formula 0 simplified : !X((FG"(p180==1)" U "((p272==0)||(p295==1))") | FG"((p168==1)&&(p295==1))")
Detected timeout of ITS tools.
[2021-05-09 16:37:44] [INFO ] Flatten gal took : 18 ms
[2021-05-09 16:37:44] [INFO ] Applying decomposition
[2021-05-09 16:37:44] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6257249324203089521.txt, -o, /tmp/graph6257249324203089521.bin, -w, /tmp/graph6257249324203089521.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6257249324203089521.bin, -l, -1, -v, -w, /tmp/graph6257249324203089521.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 16:37:44] [INFO ] Decomposing Gal with order
[2021-05-09 16:37:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 16:37:44] [INFO ] Removed a total of 85 redundant transitions.
[2021-05-09 16:37:44] [INFO ] Flatten gal took : 42 ms
[2021-05-09 16:37:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 5 ms.
[2021-05-09 16:37:44] [INFO ] Time to serialize gal into /tmp/LTL13310717531681245321.gal : 4 ms
[2021-05-09 16:37:44] [INFO ] Time to serialize properties into /tmp/LTL2623085465282314770.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13310717531681245321.gal, -t, CGAL, -LTL, /tmp/LTL2623085465282314770.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13310717531681245321.gal -t CGAL -LTL /tmp/LTL2623085465282314770.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(((F(G("(i4.u6.p180==1)")))U("((i16.u58.p272==0)||(i5.u61.p295==1))"))||(F(G("((i11.u35.p168==1)&&(i5.u61.p295==1))"))))))
Formula 0 simplified : !X((FG"(i4.u6.p180==1)" U "((i16.u58.p272==0)||(i5.u61.p295==1))") | FG"((i11.u35.p168==1)&&(i5.u61.p295==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6454225270077383513
[2021-05-09 16:37:59] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6454225270077383513
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6454225270077383513]
Compilation finished in 995 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6454225270077383513]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((<>([]((LTLAPp0==true))) U (LTLAPp1==true))||<>([]((LTLAPp2==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin6454225270077383513]
LTSmin run took 329 ms.
FORMULA DiscoveryGPU-PT-11b-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-11b-10 finished in 34903 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 199 transition count 234
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 199 transition count 234
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 193 transition count 227
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 193 transition count 227
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 187 transition count 220
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 187 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 184 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 184 transition count 217
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 182 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 182 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 181 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 181 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 180 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 180 transition count 212
Applied a total of 66 rules in 24 ms. Remains 180 /213 variables (removed 33) and now considering 212/251 (removed 39) transitions.
// Phase 1: matrix 212 rows 180 cols
[2021-05-09 16:38:00] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:38:00] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 212 rows 180 cols
[2021-05-09 16:38:00] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:38:01] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 212 rows 180 cols
[2021-05-09 16:38:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:38:01] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 1 iterations. Remains : 180/213 places, 212/251 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s42 1), p0:(EQ s42 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Graph (complete) has 365 edges and 180 vertex of which 179 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Product exploration explored 100000 steps with 50000 reset in 230 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 1 out of 180 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 180/180 places, 212/212 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 180 transition count 212
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 37 Pre rules applied. Total rules applied 21 place count 180 transition count 314
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 58 place count 180 transition count 314
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 73 place count 180 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 179 transition count 313
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 179 transition count 313
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -110
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 108 place count 179 transition count 423
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 118 place count 169 transition count 383
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 128 place count 169 transition count 383
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 158 place count 139 transition count 303
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 188 place count 139 transition count 303
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 218 place count 109 transition count 233
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 248 place count 109 transition count 233
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 258 place count 99 transition count 213
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 268 place count 99 transition count 213
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 286 place count 81 transition count 168
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 304 place count 81 transition count 168
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 340 place count 45 transition count 78
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 376 place count 45 transition count 78
Deduced a syphon composed of 29 places in 0 ms
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 386 place count 45 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 387 place count 44 transition count 66
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 388 place count 44 transition count 66
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 388 rules in 27 ms. Remains 44 /180 variables (removed 136) and now considering 66/212 (removed 146) transitions.
[2021-05-09 16:38:02] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 16:38:02] [INFO ] Flow matrix only has 64 transitions (discarded 2 similar events)
// Phase 1: matrix 64 rows 44 cols
[2021-05-09 16:38:02] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:38:02] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 44/180 places, 66/212 transitions.
Product exploration explored 100000 steps with 50000 reset in 430 ms.
Product exploration explored 100000 steps with 50000 reset in 434 ms.
[2021-05-09 16:38:03] [INFO ] Flatten gal took : 10 ms
[2021-05-09 16:38:03] [INFO ] Flatten gal took : 8 ms
[2021-05-09 16:38:03] [INFO ] Time to serialize gal into /tmp/LTL3951602299651043437.gal : 1 ms
[2021-05-09 16:38:03] [INFO ] Time to serialize properties into /tmp/LTL11541158010590415679.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3951602299651043437.gal, -t, CGAL, -LTL, /tmp/LTL11541158010590415679.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3951602299651043437.gal -t CGAL -LTL /tmp/LTL11541158010590415679.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(p60==0)")&&(F("(p60!=1)"))))))
Formula 0 simplified : !XF("(p60==0)" & F"(p60!=1)")
Detected timeout of ITS tools.
[2021-05-09 16:38:18] [INFO ] Flatten gal took : 8 ms
[2021-05-09 16:38:18] [INFO ] Applying decomposition
[2021-05-09 16:38:18] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1182937316182441219.txt, -o, /tmp/graph1182937316182441219.bin, -w, /tmp/graph1182937316182441219.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1182937316182441219.bin, -l, -1, -v, -w, /tmp/graph1182937316182441219.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 16:38:18] [INFO ] Decomposing Gal with order
[2021-05-09 16:38:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 16:38:18] [INFO ] Removed a total of 85 redundant transitions.
[2021-05-09 16:38:18] [INFO ] Flatten gal took : 19 ms
[2021-05-09 16:38:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2021-05-09 16:38:18] [INFO ] Time to serialize gal into /tmp/LTL10107239820753662219.gal : 3 ms
[2021-05-09 16:38:18] [INFO ] Time to serialize properties into /tmp/LTL1548761348700147733.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10107239820753662219.gal, -t, CGAL, -LTL, /tmp/LTL1548761348700147733.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10107239820753662219.gal -t CGAL -LTL /tmp/LTL1548761348700147733.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i6.u15.p60==0)")&&(F("(i6.u15.p60!=1)"))))))
Formula 0 simplified : !XF("(i6.u15.p60==0)" & F"(i6.u15.p60!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10986080451422043090
[2021-05-09 16:38:33] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10986080451422043090
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10986080451422043090]
Compilation finished in 823 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10986080451422043090]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp0==true)&&<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin10986080451422043090]
LTSmin run took 172 ms.
FORMULA DiscoveryGPU-PT-11b-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-11b-11 finished in 33654 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 212 transition count 215
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 177 transition count 215
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 70 place count 177 transition count 183
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 134 place count 145 transition count 183
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 140 place count 139 transition count 174
Iterating global reduction 2 with 6 rules applied. Total rules applied 146 place count 139 transition count 174
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 151 place count 134 transition count 169
Iterating global reduction 2 with 5 rules applied. Total rules applied 156 place count 134 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 157 place count 133 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 158 place count 133 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 132 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 132 transition count 166
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 268 place count 78 transition count 112
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 277 place count 69 transition count 95
Iterating global reduction 2 with 9 rules applied. Total rules applied 286 place count 69 transition count 95
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 295 place count 60 transition count 85
Iterating global reduction 2 with 9 rules applied. Total rules applied 304 place count 60 transition count 85
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 313 place count 51 transition count 67
Iterating global reduction 2 with 9 rules applied. Total rules applied 322 place count 51 transition count 67
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 331 place count 42 transition count 58
Iterating global reduction 2 with 9 rules applied. Total rules applied 340 place count 42 transition count 58
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 349 place count 33 transition count 40
Iterating global reduction 2 with 9 rules applied. Total rules applied 358 place count 33 transition count 40
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 367 place count 24 transition count 31
Iterating global reduction 2 with 9 rules applied. Total rules applied 376 place count 24 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 377 place count 23 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 378 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 379 place count 22 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 380 place count 22 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 381 place count 22 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 382 place count 22 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 383 place count 21 transition count 26
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 390 place count 19 transition count 21
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 395 place count 14 transition count 21
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 409 place count 7 transition count 14
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 411 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 412 place count 6 transition count 11
Applied a total of 412 rules in 17 ms. Remains 6 /213 variables (removed 207) and now considering 11/251 (removed 240) transitions.
[2021-05-09 16:38:34] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 16:38:34] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:38:34] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 16:38:34] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 16:38:34] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:38:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:38:34] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-09 16:38:34] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:38:34] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 16:38:34] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:38:34] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/213 places, 11/251 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-12 automaton TGBA [mat=[[{ 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, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-12 finished in 126 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 200 transition count 235
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 200 transition count 235
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 194 transition count 228
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 194 transition count 228
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 188 transition count 221
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 188 transition count 221
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 185 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 185 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 183 transition count 215
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 183 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 182 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 182 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 181 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 181 transition count 213
Applied a total of 64 rules in 10 ms. Remains 181 /213 variables (removed 32) and now considering 213/251 (removed 38) transitions.
// Phase 1: matrix 213 rows 181 cols
[2021-05-09 16:38:34] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:38:34] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 213 rows 181 cols
[2021-05-09 16:38:34] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:38:34] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 213 rows 181 cols
[2021-05-09 16:38:34] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:38:34] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 1 iterations. Remains : 181/213 places, 213/251 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : DiscoveryGPU-PT-11b-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s30 1) (EQ s176 1)), p1:(AND (EQ s179 1) (EQ s165 0) (EQ s30 1) (EQ s176 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-13 finished in 366 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||(p1&&F(p2))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 212 transition count 215
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 177 transition count 215
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 70 place count 177 transition count 185
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 130 place count 147 transition count 185
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 135 place count 142 transition count 178
Iterating global reduction 2 with 5 rules applied. Total rules applied 140 place count 142 transition count 178
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 138 transition count 174
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 138 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 137 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 137 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 136 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 136 transition count 171
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 262 place count 81 transition count 116
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 271 place count 72 transition count 99
Iterating global reduction 2 with 9 rules applied. Total rules applied 280 place count 72 transition count 99
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 289 place count 63 transition count 88
Iterating global reduction 2 with 9 rules applied. Total rules applied 298 place count 63 transition count 88
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 306 place count 55 transition count 72
Iterating global reduction 2 with 8 rules applied. Total rules applied 314 place count 55 transition count 72
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 322 place count 47 transition count 64
Iterating global reduction 2 with 8 rules applied. Total rules applied 330 place count 47 transition count 64
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 338 place count 39 transition count 48
Iterating global reduction 2 with 8 rules applied. Total rules applied 346 place count 39 transition count 48
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 354 place count 31 transition count 40
Iterating global reduction 2 with 8 rules applied. Total rules applied 362 place count 31 transition count 40
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 363 place count 30 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 364 place count 30 transition count 38
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 365 place count 29 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 366 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 367 place count 29 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 368 place count 28 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 369 place count 27 transition count 35
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 369 place count 27 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 375 place count 24 transition count 32
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 3 with 4 rules applied. Total rules applied 379 place count 22 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 380 place count 22 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 381 place count 21 transition count 28
Applied a total of 381 rules in 16 ms. Remains 21 /213 variables (removed 192) and now considering 28/251 (removed 223) transitions.
[2021-05-09 16:38:35] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 21 cols
[2021-05-09 16:38:35] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:38:35] [INFO ] Implicit Places using invariants in 13 ms returned []
[2021-05-09 16:38:35] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 21 cols
[2021-05-09 16:38:35] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-09 16:38:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:38:35] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2021-05-09 16:38:35] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:38:35] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 21 cols
[2021-05-09 16:38:35] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:38:35] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/213 places, 28/251 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-11b-14 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s16 0) (NEQ s20 0)), p1:(OR (NEQ s13 1) (NEQ s20 1)), p2:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1696 reset in 199 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 9 in 1 ms.
FORMULA DiscoveryGPU-PT-11b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-14 finished in 336 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 213 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 213/213 places, 251/251 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 212 transition count 214
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 176 transition count 214
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 72 place count 176 transition count 182
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 136 place count 144 transition count 182
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 142 place count 138 transition count 173
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 138 transition count 173
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 153 place count 133 transition count 168
Iterating global reduction 2 with 5 rules applied. Total rules applied 158 place count 133 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 159 place count 132 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 132 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 161 place count 131 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 162 place count 131 transition count 165
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 268 place count 78 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 278 place count 68 transition count 93
Iterating global reduction 2 with 10 rules applied. Total rules applied 288 place count 68 transition count 93
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 298 place count 58 transition count 81
Iterating global reduction 2 with 10 rules applied. Total rules applied 308 place count 58 transition count 81
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 318 place count 48 transition count 62
Iterating global reduction 2 with 10 rules applied. Total rules applied 328 place count 48 transition count 62
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 338 place count 38 transition count 51
Iterating global reduction 2 with 10 rules applied. Total rules applied 348 place count 38 transition count 51
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 358 place count 28 transition count 32
Iterating global reduction 2 with 10 rules applied. Total rules applied 368 place count 28 transition count 32
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 378 place count 18 transition count 21
Iterating global reduction 2 with 10 rules applied. Total rules applied 388 place count 18 transition count 21
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 390 place count 16 transition count 18
Iterating global reduction 2 with 2 rules applied. Total rules applied 392 place count 16 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 393 place count 15 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 394 place count 15 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 15 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 396 place count 14 transition count 15
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 403 place count 12 transition count 10
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 408 place count 7 transition count 10
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 412 place count 5 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 413 place count 5 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 414 place count 4 transition count 6
Applied a total of 414 rules in 19 ms. Remains 4 /213 variables (removed 209) and now considering 6/251 (removed 245) transitions.
[2021-05-09 16:38:35] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2021-05-09 16:38:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:38:35] [INFO ] Implicit Places using invariants in 9 ms returned []
[2021-05-09 16:38:35] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2021-05-09 16:38:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:38:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:38:35] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-09 16:38:35] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:38:35] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2021-05-09 16:38:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:38:35] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/213 places, 6/251 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-15 automaton TGBA [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:(NEQ s1 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 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-15 finished in 108 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620578316563

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-11b"
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-11b, 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 r083-tall-162048875200325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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