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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 312K
-rw-r--r-- 1 mcc users 7.1K Apr 30 07:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 30 07:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 07:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 07:02 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.3K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 68K 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-09b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-09b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652630381771

Running Version 202205111006
[2022-05-15 15:59:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 15:59:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:59:43] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2022-05-15 15:59:43] [INFO ] Transformed 268 places.
[2022-05-15 15:59:43] [INFO ] Transformed 284 transitions.
[2022-05-15 15:59:43] [INFO ] Found NUPN structural information;
[2022-05-15 15:59:43] [INFO ] Parsed PT model containing 268 places and 284 transitions in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09b-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 284/284 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 250 transition count 284
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 63 place count 205 transition count 239
Iterating global reduction 1 with 45 rules applied. Total rules applied 108 place count 205 transition count 239
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 118 place count 195 transition count 229
Iterating global reduction 1 with 10 rules applied. Total rules applied 128 place count 195 transition count 229
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 136 place count 187 transition count 221
Iterating global reduction 1 with 8 rules applied. Total rules applied 144 place count 187 transition count 221
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 151 place count 180 transition count 214
Iterating global reduction 1 with 7 rules applied. Total rules applied 158 place count 180 transition count 214
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 161 place count 177 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 164 place count 177 transition count 208
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 166 place count 175 transition count 206
Iterating global reduction 1 with 2 rules applied. Total rules applied 168 place count 175 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 174 transition count 205
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 174 transition count 205
Applied a total of 170 rules in 77 ms. Remains 174 /268 variables (removed 94) and now considering 205/284 (removed 79) transitions.
// Phase 1: matrix 205 rows 174 cols
[2022-05-15 15:59:43] [INFO ] Computed 2 place invariants in 14 ms
[2022-05-15 15:59:43] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 205 rows 174 cols
[2022-05-15 15:59:43] [INFO ] Computed 2 place invariants in 7 ms
[2022-05-15 15:59:43] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
// Phase 1: matrix 205 rows 174 cols
[2022-05-15 15:59:43] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 15:59:43] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 174/268 places, 205/284 transitions.
Finished structural reductions, in 1 iterations. Remains : 174/268 places, 205/284 transitions.
Support contains 25 out of 174 places after structural reductions.
[2022-05-15 15:59:44] [INFO ] Flatten gal took : 41 ms
[2022-05-15 15:59:44] [INFO ] Flatten gal took : 17 ms
[2022-05-15 15:59:44] [INFO ] Input system was already deterministic with 205 transitions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 205 rows 174 cols
[2022-05-15 15:59:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:59:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 15:59:44] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 15:59:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 15:59:44] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 15:59:44] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2022-05-15 15:59:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 74 ms
[2022-05-15 15:59:44] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-05-15 15:59:44] [INFO ] After 177ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 30 stabilizing places and 30 stable transitions
Graph (complete) has 344 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
FORMULA DiscoveryGPU-PT-09b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G(X(G(X(G(p0)))))))))'
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 205/205 transitions.
Graph (complete) has 344 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 172 transition count 174
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 143 transition count 174
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 59 place count 143 transition count 148
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 111 place count 117 transition count 148
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 116 place count 112 transition count 141
Iterating global reduction 2 with 5 rules applied. Total rules applied 121 place count 112 transition count 141
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 124 place count 109 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 127 place count 109 transition count 137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 108 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 108 transition count 136
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 217 place count 64 transition count 92
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 224 place count 57 transition count 78
Iterating global reduction 2 with 7 rules applied. Total rules applied 231 place count 57 transition count 78
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 238 place count 50 transition count 70
Iterating global reduction 2 with 7 rules applied. Total rules applied 245 place count 50 transition count 70
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 252 place count 43 transition count 57
Iterating global reduction 2 with 7 rules applied. Total rules applied 259 place count 43 transition count 57
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 266 place count 36 transition count 49
Iterating global reduction 2 with 7 rules applied. Total rules applied 273 place count 36 transition count 49
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 280 place count 29 transition count 36
Iterating global reduction 2 with 7 rules applied. Total rules applied 287 place count 29 transition count 36
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 294 place count 22 transition count 28
Iterating global reduction 2 with 7 rules applied. Total rules applied 301 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 302 place count 21 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 21 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 304 place count 21 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 306 place count 19 transition count 24
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 17 vertex of which 14 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 313 place count 14 transition count 17
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 318 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 322 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 323 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 325 place count 6 transition count 11
Applied a total of 325 rules in 74 ms. Remains 6 /174 variables (removed 168) and now considering 11/205 (removed 194) transitions.
[2022-05-15 15:59:44] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 15:59:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:59:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2022-05-15 15:59:44] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 15:59:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:59:44] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-15 15:59:44] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:59:44] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 15:59:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:59:45] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/174 places, 11/205 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/174 places, 11/205 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-00 finished in 356 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!F((F(p0)||p1))) U X(p2)))'
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 205/205 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 164 transition count 192
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 164 transition count 192
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 159 transition count 186
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 159 transition count 186
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 155 transition count 182
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 155 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 154 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 154 transition count 181
Applied a total of 40 rules in 17 ms. Remains 154 /174 variables (removed 20) and now considering 181/205 (removed 24) transitions.
// Phase 1: matrix 181 rows 154 cols
[2022-05-15 15:59:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:59:45] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 181 rows 154 cols
[2022-05-15 15:59:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:59:45] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 181 rows 154 cols
[2022-05-15 15:59:45] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:59:45] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/174 places, 181/205 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/174 places, 181/205 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), true, (OR p1 p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s108 1), p1:(EQ s89 1), p2:(NEQ s5 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 387 ms.
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Graph (complete) has 310 edges and 154 vertex of which 153 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 29 stabilizing places and 29 stable transitions
Detected a total of 29/154 stabilizing places and 29/181 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (OR p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))
Knowledge based reduction with 9 factoid took 178 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-01 finished in 1351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G((F(p0)&&p1)))||p1)))'
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 205/205 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 165 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 165 transition count 194
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 160 transition count 187
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 160 transition count 187
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 156 transition count 183
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 156 transition count 183
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 154 transition count 181
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 154 transition count 181
Applied a total of 40 rules in 18 ms. Remains 154 /174 variables (removed 20) and now considering 181/205 (removed 24) transitions.
// Phase 1: matrix 181 rows 154 cols
[2022-05-15 15:59:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:59:46] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 181 rows 154 cols
[2022-05-15 15:59:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:59:46] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
// Phase 1: matrix 181 rows 154 cols
[2022-05-15 15:59:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:59:46] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/174 places, 181/205 transitions.
Finished structural reductions, in 1 iterations. Remains : 154/174 places, 181/205 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s30 1), p0:(OR (EQ s75 1) (EQ s91 1) (EQ s30 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-04 finished in 397 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(X((F(p0)&&p1))) U (F(G(p2))||X(p0)))))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 205/205 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 164 transition count 193
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 164 transition count 193
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 159 transition count 186
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 159 transition count 186
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 155 transition count 182
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 155 transition count 182
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 153 transition count 180
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 153 transition count 180
Applied a total of 42 rules in 16 ms. Remains 153 /174 variables (removed 21) and now considering 180/205 (removed 25) transitions.
// Phase 1: matrix 180 rows 153 cols
[2022-05-15 15:59:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:59:46] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 180 rows 153 cols
[2022-05-15 15:59:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:59:47] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 153 cols
[2022-05-15 15:59:47] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 15:59:47] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 180/205 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/174 places, 180/205 transitions.
Stuttering acceptance computed with spot in 281 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), true, p2, p2, (AND p0 p1)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s25 1) (EQ s152 1)), p2:(EQ s61 1), p1:(EQ s55 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 367 reset in 253 ms.
Stack based approach found an accepted trace after 25509 steps with 92 reset with depth 248 and stack size 246 in 72 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-08 finished in 859 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0) U F(!(G(F(G(p0)))||F(p0)||p1)))))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 205/205 transitions.
Graph (complete) has 344 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
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 172 transition count 175
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 57 place count 144 transition count 175
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 57 place count 144 transition count 149
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 109 place count 118 transition count 149
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 114 place count 113 transition count 142
Iterating global reduction 2 with 5 rules applied. Total rules applied 119 place count 113 transition count 142
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 110 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 110 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 126 place count 109 transition count 137
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 109 transition count 137
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 213 place count 66 transition count 94
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 219 place count 60 transition count 82
Iterating global reduction 2 with 6 rules applied. Total rules applied 225 place count 60 transition count 82
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 231 place count 54 transition count 76
Iterating global reduction 2 with 6 rules applied. Total rules applied 237 place count 54 transition count 76
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 243 place count 48 transition count 64
Iterating global reduction 2 with 6 rules applied. Total rules applied 249 place count 48 transition count 64
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 255 place count 42 transition count 58
Iterating global reduction 2 with 6 rules applied. Total rules applied 261 place count 42 transition count 58
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 267 place count 36 transition count 46
Iterating global reduction 2 with 6 rules applied. Total rules applied 273 place count 36 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 279 place count 30 transition count 40
Iterating global reduction 2 with 6 rules applied. Total rules applied 285 place count 30 transition count 40
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 286 place count 30 transition count 39
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 287 place count 30 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 289 place count 28 transition count 37
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 33 edges and 26 vertex of which 23 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 298 place count 23 transition count 28
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 305 place count 17 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 313 place count 13 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 315 place count 13 transition count 21
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 318 place count 10 transition count 18
Applied a total of 318 rules in 29 ms. Remains 10 /174 variables (removed 164) and now considering 18/205 (removed 187) transitions.
[2022-05-15 15:59:47] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-15 15:59:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:59:47] [INFO ] Implicit Places using invariants in 17 ms returned []
[2022-05-15 15:59:47] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-15 15:59:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:59:47] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-15 15:59:47] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:59:47] [INFO ] Flow matrix only has 13 transitions (discarded 5 similar events)
// Phase 1: matrix 13 rows 10 cols
[2022-05-15 15:59:47] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:59:47] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/174 places, 18/205 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/174 places, 18/205 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR p0 p1), p0]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s4 1), p0:(EQ s7 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 43 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-09 finished in 195 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(p0)))))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 205/205 transitions.
Graph (complete) has 344 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 172 transition count 174
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 143 transition count 174
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 59 place count 143 transition count 149
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 109 place count 118 transition count 149
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 114 place count 113 transition count 141
Iterating global reduction 2 with 5 rules applied. Total rules applied 119 place count 113 transition count 141
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 109 transition count 136
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 109 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 108 transition count 135
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 108 transition count 135
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 215 place count 65 transition count 92
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 223 place count 57 transition count 76
Iterating global reduction 2 with 8 rules applied. Total rules applied 231 place count 57 transition count 76
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 239 place count 49 transition count 67
Iterating global reduction 2 with 8 rules applied. Total rules applied 247 place count 49 transition count 67
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 254 place count 42 transition count 54
Iterating global reduction 2 with 7 rules applied. Total rules applied 261 place count 42 transition count 54
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 268 place count 35 transition count 46
Iterating global reduction 2 with 7 rules applied. Total rules applied 275 place count 35 transition count 46
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 282 place count 28 transition count 33
Iterating global reduction 2 with 7 rules applied. Total rules applied 289 place count 28 transition count 33
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 296 place count 21 transition count 25
Iterating global reduction 2 with 7 rules applied. Total rules applied 303 place count 21 transition count 25
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 304 place count 20 transition count 24
Iterating global reduction 2 with 1 rules applied. Total rules applied 305 place count 20 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 306 place count 19 transition count 23
Applied a total of 306 rules in 24 ms. Remains 19 /174 variables (removed 155) and now considering 23/205 (removed 182) transitions.
[2022-05-15 15:59:47] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 19 cols
[2022-05-15 15:59:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:59:48] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-15 15:59:48] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 19 cols
[2022-05-15 15:59:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:59:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-15 15:59:48] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-15 15:59:48] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:59:48] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 19 cols
[2022-05-15 15:59:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:59:48] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/174 places, 23/205 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/174 places, 23/205 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s18 0) (EQ s16 1) (OR (EQ s11 0) (EQ s15 0)))], 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 139 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-12 finished in 156 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 205/205 transitions.
Graph (complete) has 344 edges and 174 vertex of which 173 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 172 transition count 175
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 144 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 143 transition count 174
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 59 place count 143 transition count 148
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 111 place count 117 transition count 148
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 117 place count 111 transition count 139
Iterating global reduction 3 with 6 rules applied. Total rules applied 123 place count 111 transition count 139
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 107 transition count 134
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 107 transition count 134
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 106 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 106 transition count 133
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 219 place count 63 transition count 90
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 227 place count 55 transition count 74
Iterating global reduction 3 with 8 rules applied. Total rules applied 235 place count 55 transition count 74
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 243 place count 47 transition count 65
Iterating global reduction 3 with 8 rules applied. Total rules applied 251 place count 47 transition count 65
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 259 place count 39 transition count 50
Iterating global reduction 3 with 8 rules applied. Total rules applied 267 place count 39 transition count 50
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 275 place count 31 transition count 41
Iterating global reduction 3 with 8 rules applied. Total rules applied 283 place count 31 transition count 41
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 291 place count 23 transition count 26
Iterating global reduction 3 with 8 rules applied. Total rules applied 299 place count 23 transition count 26
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 306 place count 16 transition count 19
Iterating global reduction 3 with 7 rules applied. Total rules applied 313 place count 16 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 314 place count 16 transition count 18
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 316 place count 14 transition count 16
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 14 edges and 12 vertex of which 9 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 320 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 321 place count 8 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 321 place count 8 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 323 place count 7 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 325 place count 6 transition count 11
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 327 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 329 place count 4 transition count 7
Applied a total of 329 rules in 28 ms. Remains 4 /174 variables (removed 170) and now considering 7/205 (removed 198) transitions.
[2022-05-15 15:59:48] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 15:59:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:59:48] [INFO ] Implicit Places using invariants in 14 ms returned []
[2022-05-15 15:59:48] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 15:59:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:59:48] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-15 15:59:48] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:59:48] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2022-05-15 15:59:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:59:48] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/174 places, 7/205 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/174 places, 7/205 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-13 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 1 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-13 finished in 130 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||p1)) U G(((p3 U p0)&&p2))))'
Support contains 6 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 205/205 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 165 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 165 transition count 193
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 160 transition count 186
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 160 transition count 186
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 155 transition count 181
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 155 transition count 181
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 153 transition count 179
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 153 transition count 179
Applied a total of 42 rules in 10 ms. Remains 153 /174 variables (removed 21) and now considering 179/205 (removed 26) transitions.
// Phase 1: matrix 179 rows 153 cols
[2022-05-15 15:59:48] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 15:59:48] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 179 rows 153 cols
[2022-05-15 15:59:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:59:48] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 179 rows 153 cols
[2022-05-15 15:59:48] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:59:48] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/174 places, 179/205 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/174 places, 179/205 transitions.
Stuttering acceptance computed with spot in 410 ms :[(OR (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0), (NOT p0), (OR (AND (NOT p0) p1) (AND p0 (NOT p2))), (AND (NOT p0) p1)]
Running random walk in product with property : DiscoveryGPU-PT-09b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p2 p3)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (AND (NOT p0) (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p2) (AND (NOT p0) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0) p3), acceptance={0} source=0 dest: 3}, { cond=(OR (AND p2 p0) (AND p2 p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1))), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p2 (NOT p0) p3 (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(AND p2 (NOT p0) p3 (NOT p1)), acceptance={} source=4 dest: 8}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p3), acceptance={0} source=7 dest: 7}], [{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1) (AND (NOT p0) (NOT p3) p1)), acceptance={} source=8 dest: 5}, { cond=(AND p2 (NOT p0) p3 p1), acceptance={} source=8 dest: 7}, { cond=(OR (AND p2 p0) (AND p2 p3 p1)), acceptance={} source=8 dest: 8}], [{ cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p0) (NOT p3) p1)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=9 dest: 6}, { cond=(AND p2 (NOT p0) p3 p1), acceptance={} source=9 dest: 7}, { cond=(AND p2 (NOT p0) p3 p1), acceptance={} source=9 dest: 8}, { cond=(AND p2 p0 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (EQ s77 1) (EQ s149 1)), p0:(EQ s18 1), p3:(AND (EQ s132 1) (EQ s152 1)), p1:(EQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09b-LTLFireability-15 finished in 674 ms.
All properties solved by simple procedures.
Total runtime 6019 ms.

BK_STOP 1652630389026

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-09b"
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-09b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260109800060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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