About the Execution of ITS-Tools for DiscoveryGPU-PT-12b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 209.092 | 4798.00 | 12074.00 | 125.90 | FFFFTFTFFFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r078-tall-165260109800107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-12b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109800107
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 7.3K Apr 30 06:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 30 06:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 06:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 30 06:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 89K May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-12b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652633052788
Running Version 202205111006
[2022-05-15 16:44:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 16:44:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:44:14] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2022-05-15 16:44:14] [INFO ] Transformed 352 places.
[2022-05-15 16:44:14] [INFO ] Transformed 374 transitions.
[2022-05-15 16:44:14] [INFO ] Found NUPN structural information;
[2022-05-15 16:44:14] [INFO ] Parsed PT model containing 352 places and 374 transitions in 193 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 374/374 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 329 transition count 374
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 82 place count 270 transition count 315
Iterating global reduction 1 with 59 rules applied. Total rules applied 141 place count 270 transition count 315
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 154 place count 257 transition count 302
Iterating global reduction 1 with 13 rules applied. Total rules applied 167 place count 257 transition count 302
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 177 place count 247 transition count 292
Iterating global reduction 1 with 10 rules applied. Total rules applied 187 place count 247 transition count 292
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 197 place count 237 transition count 282
Iterating global reduction 1 with 10 rules applied. Total rules applied 207 place count 237 transition count 282
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 215 place count 229 transition count 266
Iterating global reduction 1 with 8 rules applied. Total rules applied 223 place count 229 transition count 266
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 231 place count 221 transition count 258
Iterating global reduction 1 with 8 rules applied. Total rules applied 239 place count 221 transition count 258
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 247 place count 213 transition count 250
Iterating global reduction 1 with 8 rules applied. Total rules applied 255 place count 213 transition count 250
Applied a total of 255 rules in 93 ms. Remains 213 /352 variables (removed 139) and now considering 250/374 (removed 124) transitions.
// Phase 1: matrix 250 rows 213 cols
[2022-05-15 16:44:14] [INFO ] Computed 2 place invariants in 16 ms
[2022-05-15 16:44:14] [INFO ] Implicit Places using invariants in 209 ms returned []
// Phase 1: matrix 250 rows 213 cols
[2022-05-15 16:44:14] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:44:14] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 213 cols
[2022-05-15 16:44:14] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:44:14] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 213/352 places, 250/374 transitions.
Finished structural reductions, in 1 iterations. Remains : 213/352 places, 250/374 transitions.
Support contains 16 out of 213 places after structural reductions.
[2022-05-15 16:44:15] [INFO ] Flatten gal took : 45 ms
[2022-05-15 16:44:15] [INFO ] Flatten gal took : 18 ms
[2022-05-15 16:44:15] [INFO ] Input system was already deterministic with 250 transitions.
Finished random walk after 389 steps, including 0 resets, run visited all 12 properties in 68 ms. (steps per millisecond=5 )
Computed a total of 40 stabilizing places and 40 stable transitions
Graph (complete) has 424 edges and 213 vertex of which 209 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(X(G(p0)))&&(F(p1)||p2)))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Graph (complete) has 424 edges and 213 vertex of which 211 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 210 transition count 217
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 180 transition count 217
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 61 place count 180 transition count 181
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 133 place count 144 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 134 place count 143 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 143 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 142 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 142 transition count 178
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 245 place count 88 transition count 124
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 255 place count 78 transition count 104
Iterating global reduction 2 with 10 rules applied. Total rules applied 265 place count 78 transition count 104
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 275 place count 68 transition count 93
Iterating global reduction 2 with 10 rules applied. Total rules applied 285 place count 68 transition count 93
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 294 place count 59 transition count 76
Iterating global reduction 2 with 9 rules applied. Total rules applied 303 place count 59 transition count 76
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 312 place count 50 transition count 66
Iterating global reduction 2 with 9 rules applied. Total rules applied 321 place count 50 transition count 66
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 330 place count 41 transition count 49
Iterating global reduction 2 with 9 rules applied. Total rules applied 339 place count 41 transition count 49
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 348 place count 32 transition count 39
Iterating global reduction 2 with 9 rules applied. Total rules applied 357 place count 32 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 358 place count 31 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 359 place count 31 transition count 38
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 360 place count 31 transition count 37
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 361 place count 31 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 363 place count 29 transition count 35
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 31 edges and 27 vertex of which 24 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 370 place count 24 transition count 28
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 374 place count 20 transition count 28
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 384 place count 15 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 385 place count 15 transition count 22
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 388 place count 12 transition count 19
Applied a total of 388 rules in 51 ms. Remains 12 /213 variables (removed 201) and now considering 19/250 (removed 231) transitions.
[2022-05-15 16:44:15] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2022-05-15 16:44:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:15] [INFO ] Implicit Places using invariants in 17 ms returned []
[2022-05-15 16:44:15] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2022-05-15 16:44:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:15] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-15 16:44:15] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:44:15] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2022-05-15 16:44:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:15] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/213 places, 19/250 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/213 places, 19/250 transitions.
Stuttering acceptance computed with spot in 404 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s3 0) (EQ s9 1)), p1:(AND (EQ s11 0) (EQ s8 1)), p0:(AND (NEQ s9 0) (NEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-00 finished in 580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Graph (complete) has 424 edges and 213 vertex of which 209 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 208 transition count 216
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 178 transition count 216
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 61 place count 178 transition count 178
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 137 place count 140 transition count 178
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 138 transition count 175
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 138 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 137 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 137 transition count 174
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 253 place count 82 transition count 119
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 264 place count 71 transition count 98
Iterating global reduction 2 with 11 rules applied. Total rules applied 275 place count 71 transition count 98
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 286 place count 60 transition count 85
Iterating global reduction 2 with 11 rules applied. Total rules applied 297 place count 60 transition count 85
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 307 place count 50 transition count 66
Iterating global reduction 2 with 10 rules applied. Total rules applied 317 place count 50 transition count 66
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 327 place count 40 transition count 55
Iterating global reduction 2 with 10 rules applied. Total rules applied 337 place count 40 transition count 55
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 347 place count 30 transition count 36
Iterating global reduction 2 with 10 rules applied. Total rules applied 357 place count 30 transition count 36
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 367 place count 20 transition count 25
Iterating global reduction 2 with 10 rules applied. Total rules applied 377 place count 20 transition count 25
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 379 place count 18 transition count 22
Iterating global reduction 2 with 2 rules applied. Total rules applied 381 place count 18 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 382 place count 17 transition count 21
Iterating global reduction 2 with 1 rules applied. Total rules applied 383 place count 17 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 384 place count 17 transition count 20
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 386 place count 15 transition count 18
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 15 edges and 13 vertex of which 10 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 390 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 391 place count 9 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 395 place count 7 transition count 12
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 397 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 399 place count 5 transition count 8
Applied a total of 399 rules in 36 ms. Remains 5 /213 variables (removed 208) and now considering 8/250 (removed 242) transitions.
[2022-05-15 16:44:16] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-15 16:44:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:16] [INFO ] Implicit Places using invariants in 14 ms returned []
[2022-05-15 16:44:16] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-15 16:44:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:16] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-15 16:44:16] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:44:16] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2022-05-15 16:44:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:16] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/213 places, 8/250 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/213 places, 8/250 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-01 finished in 145 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!X(X(F(!G(p0))))) U F(F(p0))))'
Support contains 1 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Graph (complete) has 424 edges and 213 vertex of which 209 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 208 transition count 216
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 178 transition count 216
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 61 place count 178 transition count 178
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 137 place count 140 transition count 178
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 138 transition count 175
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 138 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 142 place count 137 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 143 place count 137 transition count 174
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 251 place count 83 transition count 120
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 262 place count 72 transition count 99
Iterating global reduction 2 with 11 rules applied. Total rules applied 273 place count 72 transition count 99
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 284 place count 61 transition count 86
Iterating global reduction 2 with 11 rules applied. Total rules applied 295 place count 61 transition count 86
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 306 place count 50 transition count 65
Iterating global reduction 2 with 11 rules applied. Total rules applied 317 place count 50 transition count 65
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 328 place count 39 transition count 53
Iterating global reduction 2 with 11 rules applied. Total rules applied 339 place count 39 transition count 53
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 350 place count 28 transition count 32
Iterating global reduction 2 with 11 rules applied. Total rules applied 361 place count 28 transition count 32
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 371 place count 18 transition count 21
Iterating global reduction 2 with 10 rules applied. Total rules applied 381 place count 18 transition count 21
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 383 place count 16 transition count 18
Iterating global reduction 2 with 2 rules applied. Total rules applied 385 place count 16 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 386 place count 15 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 387 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 388 place count 15 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 390 place count 13 transition count 14
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 12 edges and 11 vertex of which 8 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 395 place count 8 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 397 place count 6 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 399 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 400 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 401 place count 4 transition count 6
Applied a total of 401 rules in 41 ms. Remains 4 /213 variables (removed 209) and now considering 6/250 (removed 244) transitions.
[2022-05-15 16:44:16] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 16:44:16] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 16:44:16] [INFO ] Implicit Places using invariants in 16 ms returned []
[2022-05-15 16:44:16] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 16:44:16] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 16:44:16] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-15 16:44:16] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:44:16] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 16:44:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:16] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/213 places, 6/250 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/213 places, 6/250 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-07 automaton TGBA Formula[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-12b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-07 finished in 142 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(p1))))))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 212 transition count 250
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 206 transition count 244
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 206 transition count 244
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 204 transition count 241
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 204 transition count 241
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 202 transition count 239
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 202 transition count 239
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 200 transition count 236
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 200 transition count 236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 199 transition count 235
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 199 transition count 235
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 198 transition count 234
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 198 transition count 234
Applied a total of 29 rules in 31 ms. Remains 198 /213 variables (removed 15) and now considering 234/250 (removed 16) transitions.
// Phase 1: matrix 234 rows 198 cols
[2022-05-15 16:44:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:16] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 234 rows 198 cols
[2022-05-15 16:44:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:16] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
// Phase 1: matrix 234 rows 198 cols
[2022-05-15 16:44:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:16] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/213 places, 234/250 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/213 places, 234/250 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s50 1), p1:(AND (NEQ s75 0) (NEQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 7914 steps with 56 reset in 47 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-09 finished in 640 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(G(p0)))&&p1)))'
Support contains 3 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Graph (complete) has 424 edges and 213 vertex of which 209 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 208 transition count 218
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 180 transition count 218
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 57 place count 180 transition count 180
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 133 place count 142 transition count 180
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 140 transition count 177
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 140 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 138 place count 139 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 139 place count 139 transition count 176
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 247 place count 85 transition count 122
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 257 place count 75 transition count 103
Iterating global reduction 2 with 10 rules applied. Total rules applied 267 place count 75 transition count 103
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 277 place count 65 transition count 92
Iterating global reduction 2 with 10 rules applied. Total rules applied 287 place count 65 transition count 92
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 296 place count 56 transition count 74
Iterating global reduction 2 with 9 rules applied. Total rules applied 305 place count 56 transition count 74
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 314 place count 47 transition count 65
Iterating global reduction 2 with 9 rules applied. Total rules applied 323 place count 47 transition count 65
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 332 place count 38 transition count 47
Iterating global reduction 2 with 9 rules applied. Total rules applied 341 place count 38 transition count 47
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 350 place count 29 transition count 38
Iterating global reduction 2 with 9 rules applied. Total rules applied 359 place count 29 transition count 38
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 360 place count 28 transition count 36
Iterating global reduction 2 with 1 rules applied. Total rules applied 361 place count 28 transition count 36
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 362 place count 27 transition count 35
Iterating global reduction 2 with 1 rules applied. Total rules applied 363 place count 27 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 364 place count 27 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 365 place count 27 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 367 place count 25 transition count 32
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 28 edges and 23 vertex of which 20 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 372 place count 20 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 374 place count 18 transition count 27
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 4 with 8 rules applied. Total rules applied 382 place count 14 transition count 23
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 385 place count 14 transition count 20
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 388 place count 11 transition count 17
Applied a total of 388 rules in 22 ms. Remains 11 /213 variables (removed 202) and now considering 17/250 (removed 233) transitions.
[2022-05-15 16:44:16] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 11 cols
[2022-05-15 16:44:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:16] [INFO ] Implicit Places using invariants in 15 ms returned []
[2022-05-15 16:44:16] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 11 cols
[2022-05-15 16:44:16] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:16] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-15 16:44:17] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:44:17] [INFO ] Flow matrix only has 13 transitions (discarded 4 similar events)
// Phase 1: matrix 13 rows 11 cols
[2022-05-15 16:44:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:17] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/213 places, 17/250 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/213 places, 17/250 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s9 1), p0:(AND (EQ s7 0) (OR (EQ s3 0) (EQ s3 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 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-10 finished in 199 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((p0 U !p0)))))'
Support contains 1 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Graph (complete) has 424 edges and 213 vertex of which 209 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.6 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 208 transition count 217
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 179 transition count 217
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 59 place count 179 transition count 179
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 135 place count 141 transition count 179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 139 transition count 176
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 139 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 140 place count 138 transition count 175
Iterating global reduction 2 with 1 rules applied. Total rules applied 141 place count 138 transition count 175
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 249 place count 84 transition count 121
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 260 place count 73 transition count 100
Iterating global reduction 2 with 11 rules applied. Total rules applied 271 place count 73 transition count 100
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 282 place count 62 transition count 87
Iterating global reduction 2 with 11 rules applied. Total rules applied 293 place count 62 transition count 87
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 304 place count 51 transition count 66
Iterating global reduction 2 with 11 rules applied. Total rules applied 315 place count 51 transition count 66
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 326 place count 40 transition count 54
Iterating global reduction 2 with 11 rules applied. Total rules applied 337 place count 40 transition count 54
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 347 place count 30 transition count 35
Iterating global reduction 2 with 10 rules applied. Total rules applied 357 place count 30 transition count 35
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 367 place count 20 transition count 24
Iterating global reduction 2 with 10 rules applied. Total rules applied 377 place count 20 transition count 24
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 379 place count 18 transition count 21
Iterating global reduction 2 with 2 rules applied. Total rules applied 381 place count 18 transition count 21
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 382 place count 17 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 383 place count 17 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 384 place count 17 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 385 place count 17 transition count 19
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 387 place count 15 transition count 17
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 15 edges and 13 vertex of which 10 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 391 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 392 place count 9 transition count 13
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 9 transition count 12
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 8 transition count 12
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 398 place count 6 transition count 13
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 401 place count 6 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 402 place count 5 transition count 9
Applied a total of 402 rules in 36 ms. Remains 5 /213 variables (removed 208) and now considering 9/250 (removed 241) transitions.
[2022-05-15 16:44:17] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 5 cols
[2022-05-15 16:44:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:17] [INFO ] Implicit Places using invariants in 16 ms returned []
[2022-05-15 16:44:17] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 5 cols
[2022-05-15 16:44:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:17] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-15 16:44:17] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:44:17] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 5 cols
[2022-05-15 16:44:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:17] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/213 places, 9/250 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/213 places, 9/250 transitions.
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 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 90 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-14 finished in 186 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&G(X(G(F(X(p1))))))))'
Support contains 4 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 250/250 transitions.
Graph (complete) has 424 edges and 213 vertex of which 210 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 209 transition count 220
Reduce places removed 27 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 182 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 181 transition count 219
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 57 place count 181 transition count 181
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 133 place count 143 transition count 181
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 135 place count 141 transition count 178
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 141 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 140 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 140 transition count 177
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 243 place count 88 transition count 125
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 254 place count 77 transition count 104
Iterating global reduction 3 with 11 rules applied. Total rules applied 265 place count 77 transition count 104
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 275 place count 67 transition count 92
Iterating global reduction 3 with 10 rules applied. Total rules applied 285 place count 67 transition count 92
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 293 place count 59 transition count 77
Iterating global reduction 3 with 8 rules applied. Total rules applied 301 place count 59 transition count 77
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 309 place count 51 transition count 68
Iterating global reduction 3 with 8 rules applied. Total rules applied 317 place count 51 transition count 68
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 325 place count 43 transition count 53
Iterating global reduction 3 with 8 rules applied. Total rules applied 333 place count 43 transition count 53
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 341 place count 35 transition count 44
Iterating global reduction 3 with 8 rules applied. Total rules applied 349 place count 35 transition count 44
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 351 place count 33 transition count 41
Iterating global reduction 3 with 2 rules applied. Total rules applied 353 place count 33 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 354 place count 32 transition count 40
Iterating global reduction 3 with 1 rules applied. Total rules applied 355 place count 32 transition count 40
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 356 place count 32 transition count 39
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 358 place count 32 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 360 place count 30 transition count 37
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 32 edges and 28 vertex of which 25 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 367 place count 25 transition count 30
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 371 place count 21 transition count 30
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 379 place count 17 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 381 place count 16 transition count 27
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 383 place count 16 transition count 25
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 386 place count 13 transition count 22
Applied a total of 386 rules in 27 ms. Remains 13 /213 variables (removed 200) and now considering 22/250 (removed 228) transitions.
[2022-05-15 16:44:17] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 13 cols
[2022-05-15 16:44:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:17] [INFO ] Implicit Places using invariants in 13 ms returned []
[2022-05-15 16:44:17] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 13 cols
[2022-05-15 16:44:17] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:17] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-15 16:44:17] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:44:17] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 13 cols
[2022-05-15 16:44:17] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 16:44:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/213 places, 22/250 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/213 places, 22/250 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s11 1)), p1:(OR (EQ s6 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLCardinality-15 finished in 215 ms.
All properties solved by simple procedures.
Total runtime 3606 ms.
BK_STOP 1652633057586
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-12b"
export BK_EXAMINATION="LTLCardinality"
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-12b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260109800107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-12b.tgz
mv DiscoveryGPU-PT-12b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;