Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 46K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-06b-00
FORMULA_NAME DiscoveryGPU-PT-06b-01
FORMULA_NAME DiscoveryGPU-PT-06b-02
FORMULA_NAME DiscoveryGPU-PT-06b-03
FORMULA_NAME DiscoveryGPU-PT-06b-04
FORMULA_NAME DiscoveryGPU-PT-06b-05
FORMULA_NAME DiscoveryGPU-PT-06b-06
FORMULA_NAME DiscoveryGPU-PT-06b-07
FORMULA_NAME DiscoveryGPU-PT-06b-08
FORMULA_NAME DiscoveryGPU-PT-06b-09
FORMULA_NAME DiscoveryGPU-PT-06b-10
FORMULA_NAME DiscoveryGPU-PT-06b-11
FORMULA_NAME DiscoveryGPU-PT-06b-12
FORMULA_NAME DiscoveryGPU-PT-06b-13
FORMULA_NAME DiscoveryGPU-PT-06b-14
FORMULA_NAME DiscoveryGPU-PT-06b-15

=== Now, execution of the tool begins

BK_START 1620571769075

Running Version 0
[2021-05-09 14:49:30] [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]
[2021-05-09 14:49:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:49:30] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-09 14:49:30] [INFO ] Transformed 184 places.
[2021-05-09 14:49:30] [INFO ] Transformed 194 transitions.
[2021-05-09 14:49:30] [INFO ] Found NUPN structural information;
[2021-05-09 14:49:30] [INFO ] Parsed PT model containing 184 places and 194 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 14:49:30] [INFO ] Initial state test concluded for 3 properties.
FORMULA DiscoveryGPU-PT-06b-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 184 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 174 transition count 194
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 33 place count 151 transition count 171
Iterating global reduction 1 with 23 rules applied. Total rules applied 56 place count 151 transition count 171
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 63 place count 144 transition count 164
Iterating global reduction 1 with 7 rules applied. Total rules applied 70 place count 144 transition count 164
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 140 transition count 160
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 140 transition count 160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 139 transition count 159
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 139 transition count 159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 138 transition count 157
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 138 transition count 157
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 137 transition count 156
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 137 transition count 156
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 136 transition count 155
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 136 transition count 155
Applied a total of 86 rules in 67 ms. Remains 136 /184 variables (removed 48) and now considering 155/194 (removed 39) transitions.
// Phase 1: matrix 155 rows 136 cols
[2021-05-09 14:49:30] [INFO ] Computed 2 place invariants in 9 ms
[2021-05-09 14:49:30] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 155 rows 136 cols
[2021-05-09 14:49:30] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 14:49:31] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
// Phase 1: matrix 155 rows 136 cols
[2021-05-09 14:49:31] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 14:49:31] [INFO ] Dead Transitions using invariants and state equation in 86 ms returned []
Finished structural reductions, in 1 iterations. Remains : 136/184 places, 155/194 transitions.
[2021-05-09 14:49:31] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 14:49:31] [INFO ] Flatten gal took : 44 ms
FORMULA DiscoveryGPU-PT-06b-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06b-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:49:31] [INFO ] Flatten gal took : 15 ms
[2021-05-09 14:49:31] [INFO ] Input system was already deterministic with 155 transitions.
Incomplete random walk after 100000 steps, including 510 resets, run finished after 290 ms. (steps per millisecond=344 ) properties (out of 13) seen :12
Running SMT prover for 1 properties.
// Phase 1: matrix 155 rows 136 cols
[2021-05-09 14:49:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:49:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 14:49:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:49:31] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-09 14:49:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:49:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 14:49:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 14:49:31] [INFO ] [Nat]Absence check using state equation in 22 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 155/155 transitions.
Graph (complete) has 257 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output 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 133 transition count 130
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 109 transition count 130
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 49 place count 109 transition count 113
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 83 place count 92 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 89 transition count 110
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 89 transition count 110
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 87 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 87 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 85 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 85 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 84 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 84 transition count 103
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 167 place count 50 transition count 69
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 171 place count 46 transition count 62
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 46 transition count 62
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 179 place count 42 transition count 57
Iterating global reduction 2 with 4 rules applied. Total rules applied 183 place count 42 transition count 57
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 187 place count 38 transition count 49
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 38 transition count 49
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 34 transition count 45
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 34 transition count 45
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 203 place count 30 transition count 37
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 30 transition count 37
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 211 place count 26 transition count 33
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 26 transition count 33
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 216 place count 25 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 217 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 218 place count 24 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 24 transition count 30
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 220 place count 24 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 221 place count 24 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 222 place count 23 transition count 28
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 230 place count 21 transition count 22
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 236 place count 15 transition count 22
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 248 place count 9 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 250 place count 8 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 251 place count 8 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 252 place count 8 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 253 place count 7 transition count 14
Applied a total of 253 rules in 45 ms. Remains 7 /136 variables (removed 129) and now considering 14/155 (removed 141) transitions.
[2021-05-09 14:49:31] [INFO ] Flow matrix only has 12 transitions (discarded 2 similar events)
// Phase 1: matrix 12 rows 7 cols
[2021-05-09 14:49:31] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 14:49:31] [INFO ] Implicit Places using invariants in 10 ms returned []
[2021-05-09 14:49:31] [INFO ] Flow matrix only has 12 transitions (discarded 2 similar events)
// Phase 1: matrix 12 rows 7 cols
[2021-05-09 14:49:31] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:49:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 14:49:31] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-09 14:49:32] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:49:32] [INFO ] Flow matrix only has 12 transitions (discarded 2 similar events)
// Phase 1: matrix 12 rows 7 cols
[2021-05-09 14:49:32] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 14:49:32] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/136 places, 14/155 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s4 0) (NEQ s3 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-06b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-00 finished in 254 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 155/155 transitions.
Graph (complete) has 257 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output 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 133 transition count 130
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 109 transition count 130
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 49 place count 109 transition count 112
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 85 place count 91 transition count 112
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 89 place count 87 transition count 108
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 87 transition count 108
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 97 place count 83 transition count 103
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 83 transition count 103
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 105 place count 79 transition count 96
Iterating global reduction 2 with 4 rules applied. Total rules applied 109 place count 79 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 112 place count 76 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 115 place count 76 transition count 93
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 175 place count 46 transition count 63
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 179 place count 42 transition count 55
Iterating global reduction 2 with 4 rules applied. Total rules applied 183 place count 42 transition count 55
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 187 place count 38 transition count 51
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 38 transition count 51
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 34 transition count 43
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 34 transition count 43
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 203 place count 30 transition count 39
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 30 transition count 39
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 211 place count 26 transition count 31
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 26 transition count 31
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 218 place count 23 transition count 28
Iterating global reduction 2 with 3 rules applied. Total rules applied 221 place count 23 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 222 place count 23 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 223 place count 23 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 224 place count 22 transition count 26
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 8 rules applied. Total rules applied 232 place count 20 transition count 20
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 238 place count 14 transition count 20
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 248 place count 9 transition count 15
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 250 place count 8 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 251 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 252 place count 8 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 253 place count 7 transition count 12
Applied a total of 253 rules in 29 ms. Remains 7 /136 variables (removed 129) and now considering 12/155 (removed 143) transitions.
[2021-05-09 14:49:32] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 7 cols
[2021-05-09 14:49:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:49:32] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-09 14:49:32] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 7 cols
[2021-05-09 14:49:32] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:49:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 14:49:32] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-05-09 14:49:32] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:49:32] [INFO ] Flow matrix only has 10 transitions (discarded 2 similar events)
// Phase 1: matrix 10 rows 7 cols
[2021-05-09 14:49:32] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 14:49:32] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/136 places, 12/155 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s6 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-01 finished in 121 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&X((p0 U (p1||G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 155/155 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 134 transition count 155
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 123 transition count 144
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 123 transition count 144
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 120 transition count 140
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 120 transition count 140
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 117 transition count 136
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 117 transition count 136
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 114 transition count 132
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 114 transition count 132
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 112 transition count 130
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 112 transition count 130
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 111 transition count 129
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 111 transition count 129
Applied a total of 48 rules in 22 ms. Remains 111 /136 variables (removed 25) and now considering 129/155 (removed 26) transitions.
// Phase 1: matrix 129 rows 111 cols
[2021-05-09 14:49:32] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:49:32] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 129 rows 111 cols
[2021-05-09 14:49:32] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:49:32] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 111 cols
[2021-05-09 14:49:32] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:49:32] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 111/136 places, 129/155 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-06b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s73 1), p1:(NEQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33322 reset in 246 ms.
Product exploration explored 100000 steps with 33320 reset in 173 ms.
Graph (complete) has 221 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33329 reset in 146 ms.
Product exploration explored 100000 steps with 33401 reset in 128 ms.
[2021-05-09 14:49:33] [INFO ] Flatten gal took : 8 ms
[2021-05-09 14:49:33] [INFO ] Flatten gal took : 8 ms
[2021-05-09 14:49:33] [INFO ] Time to serialize gal into /tmp/LTL14138959377008728029.gal : 12 ms
[2021-05-09 14:49:33] [INFO ] Time to serialize properties into /tmp/LTL12702527641722517566.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14138959377008728029.gal, -t, CGAL, -LTL, /tmp/LTL12702527641722517566.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14138959377008728029.gal -t CGAL -LTL /tmp/LTL12702527641722517566.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p121!=1)")&&(X(("(p121!=1)")U(("(p101!=1)")||(G("(p121!=1)")))))))))
Formula 0 simplified : !GF("(p121!=1)" & X("(p121!=1)" U ("(p101!=1)" | G"(p121!=1)")))
Detected timeout of ITS tools.
[2021-05-09 14:49:48] [INFO ] Flatten gal took : 20 ms
[2021-05-09 14:49:48] [INFO ] Applying decomposition
[2021-05-09 14:49:48] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11375042656071868528.txt, -o, /tmp/graph11375042656071868528.bin, -w, /tmp/graph11375042656071868528.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11375042656071868528.bin, -l, -1, -v, -w, /tmp/graph11375042656071868528.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 14:49:48] [INFO ] Decomposing Gal with order
[2021-05-09 14:49:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 14:49:48] [INFO ] Removed a total of 46 redundant transitions.
[2021-05-09 14:49:48] [INFO ] Flatten gal took : 33 ms
[2021-05-09 14:49:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2021-05-09 14:49:48] [INFO ] Time to serialize gal into /tmp/LTL13828983590747984713.gal : 8 ms
[2021-05-09 14:49:48] [INFO ] Time to serialize properties into /tmp/LTL12158412839876327114.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13828983590747984713.gal, -t, CGAL, -LTL, /tmp/LTL12158412839876327114.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13828983590747984713.gal -t CGAL -LTL /tmp/LTL12158412839876327114.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i3.u6.p121!=1)")&&(X(("(i3.u6.p121!=1)")U(("(u22.p101!=1)")||(G("(i3.u6.p121!=1)")))))))))
Formula 0 simplified : !GF("(i3.u6.p121!=1)" & X("(i3.u6.p121!=1)" U ("(u22.p101!=1)" | G"(i3.u6.p121!=1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9951614673636230286
[2021-05-09 14:50:03] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9951614673636230286
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9951614673636230286]
Compilation finished in 552 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9951614673636230286]
Link finished in 39 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, [](<>(((LTLAPp0==true)&&X(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9951614673636230286]
LTSmin run took 278 ms.
FORMULA DiscoveryGPU-PT-06b-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-06b-03 finished in 32493 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 155/155 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 134 transition count 155
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 121 transition count 142
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 121 transition count 142
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 117 transition count 137
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 117 transition count 137
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 113 transition count 131
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 113 transition count 131
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 109 transition count 126
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 109 transition count 126
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 106 transition count 123
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 105 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 105 transition count 122
Applied a total of 60 rules in 10 ms. Remains 105 /136 variables (removed 31) and now considering 122/155 (removed 33) transitions.
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:50:04] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:04] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:50:04] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 14:50:04] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:50:04] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:04] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/136 places, 122/155 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s26 0) (NEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 11708 steps with 529 reset in 21 ms.
FORMULA DiscoveryGPU-PT-06b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-04 finished in 240 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 155/155 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 134 transition count 155
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 122 transition count 143
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 122 transition count 143
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 118 transition count 138
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 118 transition count 138
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 115 transition count 133
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 115 transition count 133
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 112 transition count 130
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 112 transition count 130
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 110 transition count 128
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 110 transition count 128
Applied a total of 50 rules in 12 ms. Remains 110 /136 variables (removed 26) and now considering 128/155 (removed 27) transitions.
// Phase 1: matrix 128 rows 110 cols
[2021-05-09 14:50:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:05] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 128 rows 110 cols
[2021-05-09 14:50:05] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:50:05] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 110 cols
[2021-05-09 14:50:05] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:50:05] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 110/136 places, 128/155 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-06b-11 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (NEQ s66 0) (NEQ s58 1)), p0:(NEQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 76 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-11 finished in 290 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 155/155 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 134 transition count 155
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 122 transition count 143
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 122 transition count 143
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 119 transition count 140
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 119 transition count 140
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 116 transition count 135
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 116 transition count 135
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 113 transition count 131
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 113 transition count 131
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 110 transition count 128
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 110 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 109 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 109 transition count 127
Applied a total of 52 rules in 7 ms. Remains 109 /136 variables (removed 27) and now considering 127/155 (removed 28) transitions.
// Phase 1: matrix 127 rows 109 cols
[2021-05-09 14:50:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:05] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 127 rows 109 cols
[2021-05-09 14:50:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:05] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 109 cols
[2021-05-09 14:50:05] [INFO ] Computed 2 place invariants in 8 ms
[2021-05-09 14:50:05] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 109/136 places, 127/155 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-12 finished in 261 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 155/155 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 134 transition count 155
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 121 transition count 142
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 121 transition count 142
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 117 transition count 137
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 117 transition count 137
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 113 transition count 131
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 113 transition count 131
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 109 transition count 126
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 109 transition count 126
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 106 transition count 123
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 105 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 105 transition count 122
Applied a total of 60 rules in 5 ms. Remains 105 /136 variables (removed 31) and now considering 122/155 (removed 33) transitions.
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:50:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:05] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:50:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:05] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 105 cols
[2021-05-09 14:50:05] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:50:05] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 105/136 places, 122/155 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-06b-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s65 0) (NEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 1 ms.
FORMULA DiscoveryGPU-PT-06b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-13 finished in 211 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&(G(F(p1))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 155/155 transitions.
Graph (complete) has 257 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output 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 133 transition count 132
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 111 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 110 transition count 131
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 47 place count 110 transition count 113
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 83 place count 92 transition count 113
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 88 transition count 109
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 88 transition count 109
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 95 place count 84 transition count 104
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 84 transition count 104
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 80 transition count 97
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 80 transition count 97
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 77 transition count 94
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 77 transition count 94
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 173 place count 47 transition count 64
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 177 place count 43 transition count 56
Iterating global reduction 3 with 4 rules applied. Total rules applied 181 place count 43 transition count 56
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 185 place count 39 transition count 52
Iterating global reduction 3 with 4 rules applied. Total rules applied 189 place count 39 transition count 52
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 193 place count 35 transition count 44
Iterating global reduction 3 with 4 rules applied. Total rules applied 197 place count 35 transition count 44
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 200 place count 32 transition count 41
Iterating global reduction 3 with 3 rules applied. Total rules applied 203 place count 32 transition count 41
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 205 place count 30 transition count 37
Iterating global reduction 3 with 2 rules applied. Total rules applied 207 place count 30 transition count 37
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 209 place count 28 transition count 35
Iterating global reduction 3 with 2 rules applied. Total rules applied 211 place count 28 transition count 35
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 212 place count 28 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 28 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 27 transition count 33
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 7 rules applied. Total rules applied 221 place count 25 transition count 28
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 226 place count 20 transition count 28
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 240 place count 13 transition count 21
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 244 place count 11 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 246 place count 11 transition count 21
Applied a total of 246 rules in 26 ms. Remains 11 /136 variables (removed 125) and now considering 21/155 (removed 134) transitions.
[2021-05-09 14:50:05] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 11 cols
[2021-05-09 14:50:05] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:50:05] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 14:50:05] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 11 cols
[2021-05-09 14:50:05] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 14:50:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 14:50:05] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-09 14:50:05] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:50:05] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 11 cols
[2021-05-09 14:50:05] [INFO ] Computed 0 place invariants in 8 ms
[2021-05-09 14:50:05] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/136 places, 21/155 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-06b-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s3 1)), p1:(EQ s10 0), p2:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 31 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-15 finished in 304 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620571806932

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-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 r083-tall-162048875100244"
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 ;