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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 113K 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.4K Mar 28 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 10:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 18:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 18:01 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 97K 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-13b-00
FORMULA_NAME DiscoveryGPU-PT-13b-01
FORMULA_NAME DiscoveryGPU-PT-13b-02
FORMULA_NAME DiscoveryGPU-PT-13b-03
FORMULA_NAME DiscoveryGPU-PT-13b-04
FORMULA_NAME DiscoveryGPU-PT-13b-05
FORMULA_NAME DiscoveryGPU-PT-13b-06
FORMULA_NAME DiscoveryGPU-PT-13b-07
FORMULA_NAME DiscoveryGPU-PT-13b-08
FORMULA_NAME DiscoveryGPU-PT-13b-09
FORMULA_NAME DiscoveryGPU-PT-13b-10
FORMULA_NAME DiscoveryGPU-PT-13b-11
FORMULA_NAME DiscoveryGPU-PT-13b-12
FORMULA_NAME DiscoveryGPU-PT-13b-13
FORMULA_NAME DiscoveryGPU-PT-13b-14
FORMULA_NAME DiscoveryGPU-PT-13b-15

=== Now, execution of the tool begins

BK_START 1620580107175

Running Version 0
[2021-05-09 17:08:28] [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 17:08:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 17:08:28] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-09 17:08:28] [INFO ] Transformed 380 places.
[2021-05-09 17:08:28] [INFO ] Transformed 404 transitions.
[2021-05-09 17:08:28] [INFO ] Found NUPN structural information;
[2021-05-09 17:08:28] [INFO ] Parsed PT model containing 380 places and 404 transitions in 109 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 17:08:28] [INFO ] Initial state test concluded for 5 properties.
FORMULA DiscoveryGPU-PT-13b-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 380 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 380/380 places, 404/404 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 354 transition count 404
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 85 place count 295 transition count 345
Iterating global reduction 1 with 59 rules applied. Total rules applied 144 place count 295 transition count 345
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 158 place count 281 transition count 331
Iterating global reduction 1 with 14 rules applied. Total rules applied 172 place count 281 transition count 331
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 183 place count 270 transition count 320
Iterating global reduction 1 with 11 rules applied. Total rules applied 194 place count 270 transition count 320
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 202 place count 262 transition count 312
Iterating global reduction 1 with 8 rules applied. Total rules applied 210 place count 262 transition count 312
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 217 place count 255 transition count 298
Iterating global reduction 1 with 7 rules applied. Total rules applied 224 place count 255 transition count 298
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 231 place count 248 transition count 291
Iterating global reduction 1 with 7 rules applied. Total rules applied 238 place count 248 transition count 291
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 244 place count 242 transition count 285
Iterating global reduction 1 with 6 rules applied. Total rules applied 250 place count 242 transition count 285
Applied a total of 250 rules in 102 ms. Remains 242 /380 variables (removed 138) and now considering 285/404 (removed 119) transitions.
// Phase 1: matrix 285 rows 242 cols
[2021-05-09 17:08:29] [INFO ] Computed 2 place invariants in 19 ms
[2021-05-09 17:08:29] [INFO ] Implicit Places using invariants in 183 ms returned []
// Phase 1: matrix 285 rows 242 cols
[2021-05-09 17:08:29] [INFO ] Computed 2 place invariants in 11 ms
[2021-05-09 17:08:29] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
// Phase 1: matrix 285 rows 242 cols
[2021-05-09 17:08:29] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:08:29] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Finished structural reductions, in 1 iterations. Remains : 242/380 places, 285/404 transitions.
[2021-05-09 17:08:29] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 17:08:29] [INFO ] Flatten gal took : 47 ms
FORMULA DiscoveryGPU-PT-13b-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 17:08:29] [INFO ] Flatten gal took : 19 ms
[2021-05-09 17:08:29] [INFO ] Input system was already deterministic with 285 transitions.
Incomplete random walk after 100000 steps, including 235 resets, run finished after 359 ms. (steps per millisecond=278 ) properties (out of 28) seen :27
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 242 cols
[2021-05-09 17:08:30] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 17:08:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-09 17:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 17:08:30] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-09 17:08:30] [INFO ] Computed and/alt/rep : 280/419/280 causal constraints (skipped 4 transitions) in 27 ms.
[2021-05-09 17:08:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 17:08:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2021-05-09 17:08:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 17:08:30] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-09 17:08:30] [INFO ] Computed and/alt/rep : 280/419/280 causal constraints (skipped 4 transitions) in 30 ms.
[2021-05-09 17:08:30] [INFO ] Added : 30 causal constraints over 6 iterations in 138 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((F(G(p0)) U p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 242/242 places, 285/285 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 231 transition count 274
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 231 transition count 274
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 227 transition count 269
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 227 transition count 269
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 223 transition count 263
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 223 transition count 263
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 219 transition count 258
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 219 transition count 258
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 216 transition count 255
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 216 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 215 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 215 transition count 254
Applied a total of 54 rules in 30 ms. Remains 215 /242 variables (removed 27) and now considering 254/285 (removed 31) transitions.
// Phase 1: matrix 254 rows 215 cols
[2021-05-09 17:08:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:31] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 254 rows 215 cols
[2021-05-09 17:08:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:31] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 254 rows 215 cols
[2021-05-09 17:08:31] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:08:31] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 1 iterations. Remains : 215/242 places, 254/285 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s156 0) (EQ s211 0) (AND (EQ s121 1) (EQ s211 1))), p0:(EQ s79 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1636 steps with 3 reset in 33 ms.
FORMULA DiscoveryGPU-PT-13b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-01 finished in 598 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&X(p1)))&&X(G(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 242/242 places, 285/285 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 233 transition count 276
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 233 transition count 276
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 229 transition count 271
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 229 transition count 271
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 225 transition count 265
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 225 transition count 265
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 221 transition count 260
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 221 transition count 260
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 218 transition count 257
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 218 transition count 257
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 217 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 217 transition count 256
Applied a total of 50 rules in 24 ms. Remains 217 /242 variables (removed 25) and now considering 256/285 (removed 29) transitions.
// Phase 1: matrix 256 rows 217 cols
[2021-05-09 17:08:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:31] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 256 rows 217 cols
[2021-05-09 17:08:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:31] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 256 rows 217 cols
[2021-05-09 17:08:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:31] [INFO ] Dead Transitions using invariants and state equation in 93 ms returned []
Finished structural reductions, in 1 iterations. Remains : 217/242 places, 256/285 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-13b-02 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 3}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(NEQ s37 1), p1:(AND (EQ s110 1) (EQ s44 1)), p0:(EQ s183 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 368 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-02 finished in 427 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 242/242 places, 285/285 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 241 transition count 245
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 202 transition count 245
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 78 place count 202 transition count 210
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 148 place count 167 transition count 210
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 152 place count 163 transition count 206
Iterating global reduction 2 with 4 rules applied. Total rules applied 156 place count 163 transition count 206
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 159 place count 160 transition count 203
Iterating global reduction 2 with 3 rules applied. Total rules applied 162 place count 160 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 164 place count 158 transition count 199
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 158 transition count 199
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 168 place count 156 transition count 197
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 156 transition count 197
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 300 place count 91 transition count 132
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 311 place count 80 transition count 111
Iterating global reduction 2 with 11 rules applied. Total rules applied 322 place count 80 transition count 111
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 333 place count 69 transition count 98
Iterating global reduction 2 with 11 rules applied. Total rules applied 344 place count 69 transition count 98
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 355 place count 58 transition count 77
Iterating global reduction 2 with 11 rules applied. Total rules applied 366 place count 58 transition count 77
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 376 place count 48 transition count 67
Iterating global reduction 2 with 10 rules applied. Total rules applied 386 place count 48 transition count 67
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 396 place count 38 transition count 47
Iterating global reduction 2 with 10 rules applied. Total rules applied 406 place count 38 transition count 47
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 416 place count 28 transition count 37
Iterating global reduction 2 with 10 rules applied. Total rules applied 426 place count 28 transition count 37
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 427 place count 27 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 428 place count 27 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 429 place count 26 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 430 place count 26 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 26 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 432 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 433 place count 24 transition count 32
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 433 place count 24 transition count 30
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 437 place count 22 transition count 30
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 441 place count 20 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 442 place count 20 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 443 place count 19 transition count 26
Applied a total of 443 rules in 65 ms. Remains 19 /242 variables (removed 223) and now considering 26/285 (removed 259) transitions.
[2021-05-09 17:08:32] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 19 cols
[2021-05-09 17:08:32] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:08:32] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-09 17:08:32] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 19 cols
[2021-05-09 17:08:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:08:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:08:32] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-09 17:08:32] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 17:08:32] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 19 cols
[2021-05-09 17:08:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:08:32] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/242 places, 26/285 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s18 1)), p1:(NEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 26513 steps with 1147 reset in 94 ms.
FORMULA DiscoveryGPU-PT-13b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-03 finished in 291 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 242/242 places, 285/285 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 230 transition count 273
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 230 transition count 273
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 225 transition count 267
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 225 transition count 267
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 220 transition count 259
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 220 transition count 259
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 215 transition count 253
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 215 transition count 253
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 211 transition count 249
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 210 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 210 transition count 248
Applied a total of 64 rules in 21 ms. Remains 210 /242 variables (removed 32) and now considering 248/285 (removed 37) transitions.
// Phase 1: matrix 248 rows 210 cols
[2021-05-09 17:08:32] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:32] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 248 rows 210 cols
[2021-05-09 17:08:32] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:08:32] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 248 rows 210 cols
[2021-05-09 17:08:32] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:32] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 210/242 places, 248/285 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s53 1) (EQ s206 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 451 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-04 finished in 321 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 242/242 places, 285/285 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 231 transition count 274
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 231 transition count 274
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 226 transition count 268
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 226 transition count 268
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 221 transition count 260
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 221 transition count 260
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 216 transition count 254
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 216 transition count 254
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 212 transition count 250
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 211 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 211 transition count 249
Applied a total of 62 rules in 34 ms. Remains 211 /242 variables (removed 31) and now considering 249/285 (removed 36) transitions.
// Phase 1: matrix 249 rows 211 cols
[2021-05-09 17:08:32] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:32] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 249 rows 211 cols
[2021-05-09 17:08:32] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:32] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 249 rows 211 cols
[2021-05-09 17:08:32] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:32] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 1 iterations. Remains : 211/242 places, 249/285 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-05 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:(EQ s134 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 1 ms.
FORMULA DiscoveryGPU-PT-13b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-05 finished in 386 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 242/242 places, 285/285 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 231 transition count 274
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 231 transition count 274
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 226 transition count 268
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 226 transition count 268
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 221 transition count 260
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 221 transition count 260
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 216 transition count 254
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 216 transition count 254
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 212 transition count 250
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 211 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 211 transition count 249
Applied a total of 62 rules in 16 ms. Remains 211 /242 variables (removed 31) and now considering 249/285 (removed 36) transitions.
// Phase 1: matrix 249 rows 211 cols
[2021-05-09 17:08:33] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:08:33] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 249 rows 211 cols
[2021-05-09 17:08:33] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 17:08:33] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
// Phase 1: matrix 249 rows 211 cols
[2021-05-09 17:08:33] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 17:08:33] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 1 iterations. Remains : 211/242 places, 249/285 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13b-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s14 1), p1:(AND (EQ s44 1) (EQ s210 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 599 reset in 253 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 0 ms.
FORMULA DiscoveryGPU-PT-13b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-06 finished in 602 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||G(F(((!p1 U p3)||p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 242/242 places, 285/285 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 241 transition count 246
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 203 transition count 246
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 76 place count 203 transition count 212
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 144 place count 169 transition count 212
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 147 place count 166 transition count 209
Iterating global reduction 2 with 3 rules applied. Total rules applied 150 place count 166 transition count 209
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 152 place count 164 transition count 207
Iterating global reduction 2 with 2 rules applied. Total rules applied 154 place count 164 transition count 207
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 156 place count 162 transition count 203
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 162 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 160 place count 160 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 160 transition count 201
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 292 place count 95 transition count 136
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 302 place count 85 transition count 117
Iterating global reduction 2 with 10 rules applied. Total rules applied 312 place count 85 transition count 117
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 322 place count 75 transition count 106
Iterating global reduction 2 with 10 rules applied. Total rules applied 332 place count 75 transition count 106
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 342 place count 65 transition count 86
Iterating global reduction 2 with 10 rules applied. Total rules applied 352 place count 65 transition count 86
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 362 place count 55 transition count 76
Iterating global reduction 2 with 10 rules applied. Total rules applied 372 place count 55 transition count 76
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 382 place count 45 transition count 56
Iterating global reduction 2 with 10 rules applied. Total rules applied 392 place count 45 transition count 56
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 401 place count 36 transition count 47
Iterating global reduction 2 with 9 rules applied. Total rules applied 410 place count 36 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 411 place count 35 transition count 45
Iterating global reduction 2 with 1 rules applied. Total rules applied 412 place count 35 transition count 45
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 413 place count 34 transition count 44
Iterating global reduction 2 with 1 rules applied. Total rules applied 414 place count 34 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 415 place count 34 transition count 43
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 416 place count 34 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 417 place count 33 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 418 place count 32 transition count 42
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 418 place count 32 transition count 39
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 424 place count 29 transition count 39
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 432 place count 25 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 433 place count 24 transition count 34
Applied a total of 433 rules in 33 ms. Remains 24 /242 variables (removed 218) and now considering 34/285 (removed 251) transitions.
[2021-05-09 17:08:33] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
// Phase 1: matrix 29 rows 24 cols
[2021-05-09 17:08:33] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:08:33] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-09 17:08:33] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
// Phase 1: matrix 29 rows 24 cols
[2021-05-09 17:08:33] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 17:08:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:08:33] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2021-05-09 17:08:33] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 17:08:33] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
// Phase 1: matrix 29 rows 24 cols
[2021-05-09 17:08:33] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:08:33] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/242 places, 34/285 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-13b-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s6 1) (EQ s23 1)), p0:(EQ s18 1), p2:(OR (EQ s10 1) (AND (EQ s6 1) (EQ s23 1))), p3:(AND (OR (NEQ s6 1) (NEQ s23 1)) (OR (EQ s10 1) (AND (EQ s6 1) (EQ s23 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 412 steps with 30 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-07 finished in 274 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 242/242 places, 285/285 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 241 transition count 247
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 204 transition count 247
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 74 place count 204 transition count 211
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 146 place count 168 transition count 211
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 164 transition count 207
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 164 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 161 transition count 204
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 161 transition count 204
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 163 place count 158 transition count 198
Iterating global reduction 2 with 3 rules applied. Total rules applied 166 place count 158 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 169 place count 155 transition count 195
Iterating global reduction 2 with 3 rules applied. Total rules applied 172 place count 155 transition count 195
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 298 place count 92 transition count 132
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 309 place count 81 transition count 111
Iterating global reduction 2 with 11 rules applied. Total rules applied 320 place count 81 transition count 111
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 331 place count 70 transition count 98
Iterating global reduction 2 with 11 rules applied. Total rules applied 342 place count 70 transition count 98
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 352 place count 60 transition count 79
Iterating global reduction 2 with 10 rules applied. Total rules applied 362 place count 60 transition count 79
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 372 place count 50 transition count 68
Iterating global reduction 2 with 10 rules applied. Total rules applied 382 place count 50 transition count 68
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 392 place count 40 transition count 49
Iterating global reduction 2 with 10 rules applied. Total rules applied 402 place count 40 transition count 49
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 412 place count 30 transition count 38
Iterating global reduction 2 with 10 rules applied. Total rules applied 422 place count 30 transition count 38
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 424 place count 28 transition count 35
Iterating global reduction 2 with 2 rules applied. Total rules applied 426 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 427 place count 27 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 428 place count 27 transition count 34
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 429 place count 27 transition count 33
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 431 place count 27 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 432 place count 26 transition count 32
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 440 place count 24 transition count 26
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 446 place count 18 transition count 26
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 462 place count 10 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 463 place count 10 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 464 place count 9 transition count 16
Applied a total of 464 rules in 31 ms. Remains 9 /242 variables (removed 233) and now considering 16/285 (removed 269) transitions.
[2021-05-09 17:08:33] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 17:08:33] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:08:33] [INFO ] Implicit Places using invariants in 4 ms returned []
[2021-05-09 17:08:33] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 17:08:33] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 17:08:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:08:33] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-09 17:08:33] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:08:33] [INFO ] Flow matrix only has 12 transitions (discarded 4 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 17:08:33] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:08:33] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/242 places, 16/285 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13b-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s3 1), p1:(NEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 109 steps with 7 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-08 finished in 122 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&F(G(p1))&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 242/242 places, 285/285 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 231 transition count 274
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 231 transition count 274
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 227 transition count 269
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 227 transition count 269
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 223 transition count 262
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 223 transition count 262
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 219 transition count 258
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 219 transition count 258
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 216 transition count 255
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 216 transition count 255
Applied a total of 52 rules in 13 ms. Remains 216 /242 variables (removed 26) and now considering 255/285 (removed 30) transitions.
// Phase 1: matrix 255 rows 216 cols
[2021-05-09 17:08:34] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:34] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 255 rows 216 cols
[2021-05-09 17:08:34] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:34] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
// Phase 1: matrix 255 rows 216 cols
[2021-05-09 17:08:34] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 17:08:34] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Finished structural reductions, in 1 iterations. Remains : 216/242 places, 255/285 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-13b-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s157 0) (EQ s212 0)), p2:(OR (AND (EQ s150 1) (EQ s212 1)) (AND (EQ s157 1) (EQ s212 1))), p1:(AND (EQ s150 1) (EQ s212 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 372 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-10 finished in 415 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 242/242 places, 285/285 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 241 transition count 246
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 203 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 202 transition count 245
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 78 place count 202 transition count 209
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 150 place count 166 transition count 209
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 154 place count 162 transition count 205
Iterating global reduction 3 with 4 rules applied. Total rules applied 158 place count 162 transition count 205
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 161 place count 159 transition count 202
Iterating global reduction 3 with 3 rules applied. Total rules applied 164 place count 159 transition count 202
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 167 place count 156 transition count 196
Iterating global reduction 3 with 3 rules applied. Total rules applied 170 place count 156 transition count 196
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 173 place count 153 transition count 193
Iterating global reduction 3 with 3 rules applied. Total rules applied 176 place count 153 transition count 193
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 300 place count 91 transition count 131
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 312 place count 79 transition count 108
Iterating global reduction 3 with 12 rules applied. Total rules applied 324 place count 79 transition count 108
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 336 place count 67 transition count 94
Iterating global reduction 3 with 12 rules applied. Total rules applied 348 place count 67 transition count 94
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 359 place count 56 transition count 73
Iterating global reduction 3 with 11 rules applied. Total rules applied 370 place count 56 transition count 73
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 381 place count 45 transition count 61
Iterating global reduction 3 with 11 rules applied. Total rules applied 392 place count 45 transition count 61
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 403 place count 34 transition count 40
Iterating global reduction 3 with 11 rules applied. Total rules applied 414 place count 34 transition count 40
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 425 place count 23 transition count 28
Iterating global reduction 3 with 11 rules applied. Total rules applied 436 place count 23 transition count 28
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 438 place count 21 transition count 25
Iterating global reduction 3 with 2 rules applied. Total rules applied 440 place count 21 transition count 25
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 441 place count 20 transition count 24
Iterating global reduction 3 with 1 rules applied. Total rules applied 442 place count 20 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 443 place count 20 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 444 place count 19 transition count 22
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 3 with 7 rules applied. Total rules applied 451 place count 17 transition count 17
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 456 place count 12 transition count 17
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 464 place count 8 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 465 place count 8 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 466 place count 7 transition count 11
Applied a total of 466 rules in 28 ms. Remains 7 /242 variables (removed 235) and now considering 11/285 (removed 274) transitions.
[2021-05-09 17:08:34] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 7 cols
[2021-05-09 17:08:34] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:08:34] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 17:08:34] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 7 cols
[2021-05-09 17:08:34] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:08:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:08:34] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-09 17:08:34] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:08:34] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 7 cols
[2021-05-09 17:08:34] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 17:08:34] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/242 places, 11/285 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-13b-13 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s1 1), p0:(EQ s3 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-13 finished in 122 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 242/242 places, 285/285 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 241 transition count 245
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 202 transition count 245
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 78 place count 202 transition count 211
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 146 place count 168 transition count 211
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 164 transition count 207
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 164 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 161 transition count 204
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 161 transition count 204
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 163 place count 158 transition count 198
Iterating global reduction 2 with 3 rules applied. Total rules applied 166 place count 158 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 169 place count 155 transition count 195
Iterating global reduction 2 with 3 rules applied. Total rules applied 172 place count 155 transition count 195
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 296 place count 93 transition count 133
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 308 place count 81 transition count 110
Iterating global reduction 2 with 12 rules applied. Total rules applied 320 place count 81 transition count 110
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 332 place count 69 transition count 96
Iterating global reduction 2 with 12 rules applied. Total rules applied 344 place count 69 transition count 96
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 356 place count 57 transition count 73
Iterating global reduction 2 with 12 rules applied. Total rules applied 368 place count 57 transition count 73
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 380 place count 45 transition count 60
Iterating global reduction 2 with 12 rules applied. Total rules applied 392 place count 45 transition count 60
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 404 place count 33 transition count 37
Iterating global reduction 2 with 12 rules applied. Total rules applied 416 place count 33 transition count 37
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 427 place count 22 transition count 25
Iterating global reduction 2 with 11 rules applied. Total rules applied 438 place count 22 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 440 place count 20 transition count 22
Iterating global reduction 2 with 2 rules applied. Total rules applied 442 place count 20 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 443 place count 19 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 444 place count 19 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 445 place count 19 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 446 place count 18 transition count 19
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 448 place count 17 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 449 place count 16 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 449 place count 16 transition count 16
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 453 place count 14 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 454 place count 13 transition count 15
Applied a total of 454 rules in 22 ms. Remains 13 /242 variables (removed 229) and now considering 15/285 (removed 270) transitions.
[2021-05-09 17:08:34] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 13 cols
[2021-05-09 17:08:34] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 17:08:34] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-09 17:08:34] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 13 cols
[2021-05-09 17:08:34] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:08:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 17:08:34] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2021-05-09 17:08:34] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 17:08:34] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 13 cols
[2021-05-09 17:08:34] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 17:08:34] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/242 places, 15/285 transitions.
Stuttering acceptance computed with spot in 44 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-14 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 1) (AND (EQ s10 1) (EQ s12 1))), p1:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 155 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-14 finished in 125 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)||((F(p2)&&p1) U ((F(p2)&&G(p4)&&p3)||G((F(p2)&&p5))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 242 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 242/242 places, 285/285 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 232 transition count 275
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 232 transition count 275
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 227 transition count 269
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 227 transition count 269
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 222 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 222 transition count 261
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 217 transition count 255
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 217 transition count 255
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 213 transition count 251
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 213 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 212 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 212 transition count 250
Applied a total of 60 rules in 14 ms. Remains 212 /242 variables (removed 30) and now considering 250/285 (removed 35) transitions.
// Phase 1: matrix 250 rows 212 cols
[2021-05-09 17:08:34] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:34] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 250 rows 212 cols
[2021-05-09 17:08:34] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:34] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 212 cols
[2021-05-09 17:08:34] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 17:08:34] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 212/242 places, 250/285 transitions.
Stuttering acceptance computed with spot in 606 ms :[(OR (AND (NOT p0) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p4) (NOT p5)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p4) (NOT p5)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p4) (NOT p5)) (AND (NOT p0) (NOT p3) (NOT p5)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p4) (NOT p5)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p5)) (AND (NOT p0) (NOT p2))), (AND (NOT p4) (NOT p0)), true, (NOT p2), (NOT p4), (OR (NOT p2) (NOT p5)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p4) (NOT p5))), (OR (NOT p2) (AND (NOT p4) (NOT p5)) (AND (NOT p3) (NOT p5))), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p4) (NOT p5)))]
Running random walk in product with property : DiscoveryGPU-PT-13b-15 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p3) (NOT p5) (NOT p1)) (AND (NOT p4) (NOT p5) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND p3 p4 p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p4) p1)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) p4), acceptance={} source=0 dest: 4}, { cond=(AND p3 p4 p5 (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(OR (AND (NOT p3) p5 (NOT p1)) (AND (NOT p4) p5 (NOT p1))), acceptance={} source=0 dest: 6}, { cond=(AND p3 p4 (NOT p5) (NOT p1)), acceptance={} source=0 dest: 7}], [{ cond=(NOT p0), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p4) (NOT p5) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p2) (NOT p4) p5 (NOT p0)), acceptance={} source=2 dest: 9}, { cond=(AND p4 (NOT p5) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 10}, { cond=(AND (NOT p4) p5 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 11}, { cond=(AND p4 p1 (NOT p0)), acceptance={} source=2 dest: 12}, { cond=(AND (NOT p4) p1 (NOT p0)), acceptance={} source=2 dest: 13}, { cond=(AND p4 p5 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 14}], [{ cond=(OR (AND (NOT p3) (NOT p5) (NOT p1) (NOT p0)) (AND (NOT p4) (NOT p5) (NOT p1) (NOT p0))), acceptance={} source=3 dest: 8}, { cond=(OR (AND p3 (NOT p2) p4 (NOT p0)) (AND (NOT p2) p5 (NOT p0))), acceptance={} source=3 dest: 9}, { cond=(AND p3 p4 (NOT p5) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 10}, { cond=(OR (AND (NOT p3) p5 (NOT p1) (NOT p0)) (AND (NOT p4) p5 (NOT p1) (NOT p0))), acceptance={} source=3 dest: 11}, { cond=(AND p3 p4 p1 (NOT p0)), acceptance={} source=3 dest: 12}, { cond=(OR (AND (NOT p3) p1 (NOT p0)) (AND (NOT p4) p1 (NOT p0))), acceptance={} source=3 dest: 13}, { cond=(AND p3 p4 p5 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 14}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p4) (NOT p5) (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p2) (NOT p4) p5 (NOT p0)), acceptance={} source=5 dest: 9}, { cond=(AND p4 (NOT p5) (NOT p0)), acceptance={} source=5 dest: 10}, { cond=(AND (NOT p4) p5 (NOT p0)), acceptance={} source=5 dest: 11}, { cond=(AND p4 p5 (NOT p0)), acceptance={} source=5 dest: 14}], [{ cond=(AND (NOT p5) (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p2) p5 (NOT p0)), acceptance={} source=6 dest: 9}, { cond=(AND p5 (NOT p0)), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p4) (NOT p0)), acceptance={} source=7 dest: 8}, { cond=(AND p4 (NOT p0)), acceptance={} source=7 dest: 10}], [{ cond=true, acceptance={0, 1} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={0, 1} source=9 dest: 9}], [{ cond=(NOT p4), acceptance={} source=10 dest: 8}, { cond=p4, acceptance={} source=10 dest: 10}], [{ cond=(NOT p5), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p2) p5), acceptance={} source=11 dest: 9}, { cond=p5, acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p4) (NOT p5) (NOT p1)), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p2) (NOT p4) p5), acceptance={} source=12 dest: 9}, { cond=(AND p4 (NOT p5) (NOT p1)), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p4) p5 (NOT p1)), acceptance={} source=12 dest: 11}, { cond=(AND p4 (NOT p5) p1), acceptance={1} source=12 dest: 12}, { cond=(AND p4 p5 p1), acceptance={} source=12 dest: 12}, { cond=(AND (NOT p4) (NOT p5) p1), acceptance={0, 1} source=12 dest: 13}, { cond=(AND (NOT p4) p5 p1), acceptance={0} source=12 dest: 13}, { cond=(AND p4 p5 (NOT p1)), acceptance={} source=12 dest: 14}], [{ cond=(OR (AND (NOT p3) (NOT p5) (NOT p1)) (AND (NOT p4) (NOT p5) (NOT p1))), acceptance={} source=13 dest: 8}, { cond=(OR (AND p3 (NOT p2) p4) (AND (NOT p2) p5)), acceptance={} source=13 dest: 9}, { cond=(AND p3 p4 (NOT p5) (NOT p1)), acceptance={} source=13 dest: 10}, { cond=(OR (AND (NOT p3) p5 (NOT p1)) (AND (NOT p4) p5 (NOT p1))), acceptance={} source=13 dest: 11}, { cond=(AND p3 p4 (NOT p5) p1), acceptance={1} source=13 dest: 12}, { cond=(AND p3 p4 p5 p1), acceptance={} source=13 dest: 12}, { cond=(OR (AND (NOT p3) (NOT p5) p1) (AND (NOT p4) (NOT p5) p1)), acceptance={0, 1} source=13 dest: 13}, { cond=(OR (AND (NOT p3) p5 p1) (AND (NOT p4) p5 p1)), acceptance={0} source=13 dest: 13}, { cond=(AND p3 p4 p5 (NOT p1)), acceptance={} source=13 dest: 14}], [{ cond=(AND (NOT p4) (NOT p5)), acceptance={} source=14 dest: 8}, { cond=(AND (NOT p2) (NOT p4) p5), acceptance={} source=14 dest: 9}, { cond=(AND p4 (NOT p5)), acceptance={} source=14 dest: 10}, { cond=(AND (NOT p4) p5), acceptance={} source=14 dest: 11}, { cond=(AND p4 p5), acceptance={} source=14 dest: 14}]], initial=0, aps=[p3:(AND (NEQ s106 1) (NEQ s150 1)), p5:(AND (NEQ s106 1) (NEQ s150 1)), p1:(AND (NEQ s106 1) (NEQ s150 1)), p4:(NEQ s166 1), p2:(NEQ s76 1), p0:(EQ s150 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, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7035 steps with 16 reset in 24 ms.
FORMULA DiscoveryGPU-PT-13b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-15 finished in 944 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620580116339

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

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