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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 6.3K Apr 30 06:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 06:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 06:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 30 06:55 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.2K May 9 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 9 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:39 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 46K 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-06b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-06b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652628826582

Running Version 202205111006
[2022-05-15 15:33:47] [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 15:33:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:33:47] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-05-15 15:33:47] [INFO ] Transformed 184 places.
[2022-05-15 15:33:47] [INFO ] Transformed 194 transitions.
[2022-05-15 15:33:47] [INFO ] Found NUPN structural information;
[2022-05-15 15:33:47] [INFO ] Parsed PT model containing 184 places and 194 transitions in 181 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-06b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 172 transition count 194
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 33 place count 151 transition count 173
Iterating global reduction 1 with 21 rules applied. Total rules applied 54 place count 151 transition count 173
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 147 transition count 169
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 147 transition count 169
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 144 transition count 166
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 144 transition count 166
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 142 transition count 164
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 142 transition count 164
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 140 transition count 160
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 140 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 138 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 138 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 82 place count 136 transition count 156
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 136 transition count 156
Applied a total of 84 rules in 58 ms. Remains 136 /184 variables (removed 48) and now considering 156/194 (removed 38) transitions.
// Phase 1: matrix 156 rows 136 cols
[2022-05-15 15:33:48] [INFO ] Computed 2 place invariants in 11 ms
[2022-05-15 15:33:48] [INFO ] Implicit Places using invariants in 163 ms returned []
// Phase 1: matrix 156 rows 136 cols
[2022-05-15 15:33:48] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 15:33:48] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
// Phase 1: matrix 156 rows 136 cols
[2022-05-15 15:33:48] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 15:33:48] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/184 places, 156/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/184 places, 156/194 transitions.
Support contains 28 out of 136 places after structural reductions.
[2022-05-15 15:33:48] [INFO ] Flatten gal took : 36 ms
[2022-05-15 15:33:48] [INFO ] Flatten gal took : 14 ms
[2022-05-15 15:33:48] [INFO ] Input system was already deterministic with 156 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 156 rows 136 cols
[2022-05-15 15:33:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 15:33:49] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 15:33:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 15:33:49] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-15 15:33:49] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-15 15:33:49] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 37 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=37 )
Parikh walk visited 1 properties in 2 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 259 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 156/156 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 125 transition count 145
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 125 transition count 145
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 120 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 120 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 117 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 117 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 115 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 115 transition count 134
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 113 transition count 131
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 113 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 112 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 112 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 111 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 111 transition count 129
Applied a total of 50 rules in 16 ms. Remains 111 /136 variables (removed 25) and now considering 129/156 (removed 27) transitions.
// Phase 1: matrix 129 rows 111 cols
[2022-05-15 15:33:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:33:49] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 129 rows 111 cols
[2022-05-15 15:33:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:49] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 111 cols
[2022-05-15 15:33:49] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 15:33:49] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/136 places, 129/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 111/136 places, 129/156 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s73 0) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-00 finished in 486 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G((G(X(p2))||p1))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 156/156 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 126 transition count 146
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 126 transition count 146
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 121 transition count 141
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 121 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 118 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 118 transition count 137
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 115 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 112 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 112 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 110 transition count 127
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 110 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 108 transition count 125
Applied a total of 56 rules in 19 ms. Remains 108 /136 variables (removed 28) and now considering 125/156 (removed 31) transitions.
// Phase 1: matrix 125 rows 108 cols
[2022-05-15 15:33:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:49] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 125 rows 108 cols
[2022-05-15 15:33:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:50] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 108 cols
[2022-05-15 15:33:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:50] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/136 places, 125/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/136 places, 125/156 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s18 1), p1:(OR (EQ s7 0) (EQ s17 1)), p2:(AND (EQ s49 0) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 177 steps with 0 reset in 7 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-03 finished in 412 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 156/156 transitions.
Graph (complete) has 259 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 132 transition count 130
Reduce places removed 22 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 25 rules applied. Total rules applied 48 place count 110 transition count 127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 107 transition count 127
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 51 place count 107 transition count 113
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 79 place count 93 transition count 113
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 85 place count 87 transition count 107
Iterating global reduction 3 with 6 rules applied. Total rules applied 91 place count 87 transition count 107
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 91 place count 87 transition count 105
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 85 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 83 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 83 transition count 103
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 81 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 81 transition count 99
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 79 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 79 transition count 97
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 169 place count 48 transition count 66
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 174 place count 43 transition count 57
Iterating global reduction 3 with 5 rules applied. Total rules applied 179 place count 43 transition count 57
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 184 place count 38 transition count 51
Iterating global reduction 3 with 5 rules applied. Total rules applied 189 place count 38 transition count 51
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 193 place count 34 transition count 43
Iterating global reduction 3 with 4 rules applied. Total rules applied 197 place count 34 transition count 43
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 201 place count 30 transition count 39
Iterating global reduction 3 with 4 rules applied. Total rules applied 205 place count 30 transition count 39
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 208 place count 27 transition count 33
Iterating global reduction 3 with 3 rules applied. Total rules applied 211 place count 27 transition count 33
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 213 place count 25 transition count 31
Iterating global reduction 3 with 2 rules applied. Total rules applied 215 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 216 place count 24 transition count 29
Iterating global reduction 3 with 1 rules applied. Total rules applied 217 place count 24 transition count 29
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 218 place count 23 transition count 28
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 23 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 23 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 222 place count 21 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 22 edges and 19 vertex of which 16 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 226 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 227 place count 15 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 227 place count 15 transition count 20
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 229 place count 14 transition count 20
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 231 place count 13 transition count 19
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 233 place count 12 transition count 19
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 236 place count 12 transition count 16
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 239 place count 9 transition count 13
Applied a total of 239 rules in 39 ms. Remains 9 /136 variables (removed 127) and now considering 13/156 (removed 143) transitions.
[2022-05-15 15:33:50] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 9 cols
[2022-05-15 15:33:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:33:50] [INFO ] Implicit Places using invariants in 15 ms returned []
[2022-05-15 15:33:50] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 9 cols
[2022-05-15 15:33:50] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:33:50] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-15 15:33:50] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:33:50] [INFO ] Flow matrix only has 11 transitions (discarded 2 similar events)
// Phase 1: matrix 11 rows 9 cols
[2022-05-15 15:33:50] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-15 15:33:50] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/136 places, 13/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/136 places, 13/156 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s7 0) (EQ s4 1)), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-04 finished in 247 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(X(p0))))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 156/156 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 125 transition count 145
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 125 transition count 145
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 121 transition count 141
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 121 transition count 141
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 119 transition count 138
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 119 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 117 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 117 transition count 136
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 115 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 115 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 114 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 114 transition count 132
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 113 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 113 transition count 131
Applied a total of 46 rules in 36 ms. Remains 113 /136 variables (removed 23) and now considering 131/156 (removed 25) transitions.
// Phase 1: matrix 131 rows 113 cols
[2022-05-15 15:33:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:50] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 131 rows 113 cols
[2022-05-15 15:33:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:50] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 131 rows 113 cols
[2022-05-15 15:33:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:50] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/136 places, 131/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/136 places, 131/156 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s31 0) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 279 ms.
Product exploration explored 100000 steps with 25000 reset in 137 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 224 edges and 113 vertex of which 111 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 162 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=81 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 131/131 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 131/131 (removed 0) transitions.
// Phase 1: matrix 131 rows 113 cols
[2022-05-15 15:33:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:52] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 131 rows 113 cols
[2022-05-15 15:33:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:52] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 131 rows 113 cols
[2022-05-15 15:33:52] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 15:33:52] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 131/131 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Graph (complete) has 224 edges and 113 vertex of which 111 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 207 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=103 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Product exploration explored 100000 steps with 25000 reset in 95 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 131/131 transitions.
Graph (complete) has 224 edges and 113 vertex of which 112 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
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 112 transition count 130
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 15 place count 112 transition count 130
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 35 place count 112 transition count 130
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 54 place count 112 transition count 138
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 109 transition count 135
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 109 transition count 135
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 109 transition count 159
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 105 transition count 151
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 105 transition count 151
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 90 place count 95 transition count 134
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 100 place count 95 transition count 134
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 109 place count 86 transition count 119
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 118 place count 86 transition count 119
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 121 place count 83 transition count 116
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 124 place count 83 transition count 116
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 130 place count 77 transition count 107
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 77 transition count 107
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 148 place count 65 transition count 89
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 160 place count 65 transition count 89
Deduced a syphon composed of 37 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 168 place count 65 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 171 place count 62 transition count 78
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 174 place count 62 transition count 78
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 174 rules in 42 ms. Remains 62 /113 variables (removed 51) and now considering 78/131 (removed 53) transitions.
[2022-05-15 15:33:53] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 15:33:53] [INFO ] Flow matrix only has 74 transitions (discarded 4 similar events)
// Phase 1: matrix 74 rows 62 cols
[2022-05-15 15:33:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:53] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/113 places, 78/131 transitions.
Finished structural reductions, in 1 iterations. Remains : 62/113 places, 78/131 transitions.
Product exploration explored 100000 steps with 25000 reset in 235 ms.
Product exploration explored 100000 steps with 25000 reset in 228 ms.
Built C files in :
/tmp/ltsmin9936219140375105537
[2022-05-15 15:33:54] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9936219140375105537
Running compilation step : cd /tmp/ltsmin9936219140375105537;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1768 ms.
Running link step : cd /tmp/ltsmin9936219140375105537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 119 ms.
Running LTSmin : cd /tmp/ltsmin9936219140375105537;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8562573847444132645.hoa' '--buchi-type=spotba'
LTSmin run took 216 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-06 finished in 5912 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0))) U p1))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 156/156 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 126 transition count 146
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 126 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 122 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 122 transition count 142
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 120 transition count 139
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 120 transition count 139
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 118 transition count 137
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 118 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 116 transition count 134
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 116 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 115 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 115 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 114 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 114 transition count 132
Applied a total of 44 rules in 14 ms. Remains 114 /136 variables (removed 22) and now considering 132/156 (removed 24) transitions.
// Phase 1: matrix 132 rows 114 cols
[2022-05-15 15:33:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:33:56] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 132 rows 114 cols
[2022-05-15 15:33:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:56] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 132 rows 114 cols
[2022-05-15 15:33:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:56] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/136 places, 132/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/136 places, 132/156 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s43 1) (EQ s18 1)), p0:(OR (EQ s61 0) (EQ s101 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]]
Entered a terminal (fully accepting) state of product in 586 steps with 2 reset in 2 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-07 finished in 333 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U !p1))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 156/156 transitions.
Graph (complete) has 259 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 132 transition count 129
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 109 transition count 129
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 47 place count 109 transition count 115
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 75 place count 95 transition count 115
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 79 place count 91 transition count 111
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 91 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 83 place count 91 transition count 110
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 90 transition count 110
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 155 place count 55 transition count 75
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 158 place count 52 transition count 70
Iterating global reduction 2 with 3 rules applied. Total rules applied 161 place count 52 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 164 place count 49 transition count 66
Iterating global reduction 2 with 3 rules applied. Total rules applied 167 place count 49 transition count 66
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 170 place count 46 transition count 60
Iterating global reduction 2 with 3 rules applied. Total rules applied 173 place count 46 transition count 60
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 176 place count 43 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 179 place count 43 transition count 57
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 181 place count 41 transition count 53
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 41 transition count 53
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 185 place count 39 transition count 51
Iterating global reduction 2 with 2 rules applied. Total rules applied 187 place count 39 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 38 transition count 49
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 38 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 190 place count 37 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 191 place count 37 transition count 48
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 192 place count 37 transition count 48
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 35 transition count 46
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 61 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 199 place count 33 transition count 42
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 202 place count 30 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 208 place count 27 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 210 place count 26 transition count 39
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 213 place count 23 transition count 36
Applied a total of 213 rules in 47 ms. Remains 23 /136 variables (removed 113) and now considering 36/156 (removed 120) transitions.
[2022-05-15 15:33:56] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 23 cols
[2022-05-15 15:33:56] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:33:56] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-15 15:33:56] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 23 cols
[2022-05-15 15:33:56] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:33:56] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-15 15:33:56] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 15:33:56] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 23 cols
[2022-05-15 15:33:56] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:33:56] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/136 places, 36/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/136 places, 36/156 transitions.
Stuttering acceptance computed with spot in 73 ms :[p1, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s13 0) (EQ s8 1)), p0:(OR (EQ s21 0) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-09 finished in 242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X(G(X(p0))))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 156/156 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 124 transition count 144
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 124 transition count 144
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 120 transition count 140
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 120 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 117 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 117 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 114 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 114 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 111 transition count 128
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 111 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 109 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 109 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 107 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 107 transition count 124
Applied a total of 58 rules in 18 ms. Remains 107 /136 variables (removed 29) and now considering 124/156 (removed 32) transitions.
// Phase 1: matrix 124 rows 107 cols
[2022-05-15 15:33:57] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:33:57] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 124 rows 107 cols
[2022-05-15 15:33:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:57] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 107 cols
[2022-05-15 15:33:57] [INFO ] Computed 2 place invariants in 21 ms
[2022-05-15 15:33:57] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/136 places, 124/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/136 places, 124/156 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s30 0) (NEQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-11 finished in 353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 156/156 transitions.
Graph (complete) has 259 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 132 transition count 128
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 108 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 107 transition count 127
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 51 place count 107 transition count 112
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 81 place count 92 transition count 112
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 87 place count 86 transition count 106
Iterating global reduction 3 with 6 rules applied. Total rules applied 93 place count 86 transition count 106
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 93 place count 86 transition count 104
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 84 transition count 104
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 82 transition count 102
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 82 transition count 102
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 80 transition count 98
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 80 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 78 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 78 transition count 96
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 173 place count 46 transition count 64
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 178 place count 41 transition count 55
Iterating global reduction 3 with 5 rules applied. Total rules applied 183 place count 41 transition count 55
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 188 place count 36 transition count 49
Iterating global reduction 3 with 5 rules applied. Total rules applied 193 place count 36 transition count 49
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 196 place count 33 transition count 43
Iterating global reduction 3 with 3 rules applied. Total rules applied 199 place count 33 transition count 43
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 202 place count 30 transition count 40
Iterating global reduction 3 with 3 rules applied. Total rules applied 205 place count 30 transition count 40
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 208 place count 27 transition count 34
Iterating global reduction 3 with 3 rules applied. Total rules applied 211 place count 27 transition count 34
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 214 place count 24 transition count 31
Iterating global reduction 3 with 3 rules applied. Total rules applied 217 place count 24 transition count 31
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 218 place count 23 transition count 29
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 220 place count 22 transition count 28
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 22 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 222 place count 22 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 224 place count 20 transition count 25
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 21 edges and 18 vertex of which 15 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 3 with 5 rules applied. Total rules applied 229 place count 15 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 231 place count 13 transition count 20
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 5 with 4 rules applied. Total rules applied 235 place count 11 transition count 18
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 238 place count 11 transition count 15
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 241 place count 8 transition count 12
Applied a total of 241 rules in 27 ms. Remains 8 /136 variables (removed 128) and now considering 12/156 (removed 144) transitions.
[2022-05-15 15:33:57] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 8 cols
[2022-05-15 15:33:57] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:33:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-15 15:33:57] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 8 cols
[2022-05-15 15:33:57] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:33:57] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-15 15:33:57] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:33:57] [INFO ] Flow matrix only has 9 transitions (discarded 3 similar events)
// Phase 1: matrix 9 rows 8 cols
[2022-05-15 15:33:57] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 15:33:57] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/136 places, 12/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/136 places, 12/156 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-13 finished in 177 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U X(!p1)))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 156/156 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 123 transition count 143
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 123 transition count 143
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 118 transition count 138
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 118 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 115 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 112 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 112 transition count 131
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 109 transition count 126
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 109 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 107 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 107 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 105 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 105 transition count 122
Applied a total of 62 rules in 12 ms. Remains 105 /136 variables (removed 31) and now considering 122/156 (removed 34) transitions.
// Phase 1: matrix 122 rows 105 cols
[2022-05-15 15:33:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:57] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 122 rows 105 cols
[2022-05-15 15:33:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:57] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 105 cols
[2022-05-15 15:33:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:57] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/136 places, 122/156 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/136 places, 122/156 transitions.
Stuttering acceptance computed with spot in 73 ms :[p1, p1, true]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s44 0) (EQ s55 1)), p0:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLCardinality-15 finished in 260 ms.
All properties solved by simple procedures.
Total runtime 10094 ms.

BK_STOP 1652628837902

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

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06b.tgz
mv DiscoveryGPU-PT-06b 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;