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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 8.7K Apr 30 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 30 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 07:03 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.8K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 82K 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-11b-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-11b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652632506792

Running Version 202205111006
[2022-05-15 16:35:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 16:35:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:35:08] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2022-05-15 16:35:08] [INFO ] Transformed 324 places.
[2022-05-15 16:35:08] [INFO ] Transformed 344 transitions.
[2022-05-15 16:35:08] [INFO ] Found NUPN structural information;
[2022-05-15 16:35:08] [INFO ] Parsed PT model containing 324 places and 344 transitions in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 344/344 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 305 transition count 344
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 63 place count 261 transition count 300
Iterating global reduction 1 with 44 rules applied. Total rules applied 107 place count 261 transition count 300
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 116 place count 252 transition count 291
Iterating global reduction 1 with 9 rules applied. Total rules applied 125 place count 252 transition count 291
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 133 place count 244 transition count 283
Iterating global reduction 1 with 8 rules applied. Total rules applied 141 place count 244 transition count 283
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 147 place count 238 transition count 277
Iterating global reduction 1 with 6 rules applied. Total rules applied 153 place count 238 transition count 277
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 157 place count 234 transition count 269
Iterating global reduction 1 with 4 rules applied. Total rules applied 161 place count 234 transition count 269
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 164 place count 231 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 167 place count 231 transition count 266
Applied a total of 167 rules in 81 ms. Remains 231 /324 variables (removed 93) and now considering 266/344 (removed 78) transitions.
// Phase 1: matrix 266 rows 231 cols
[2022-05-15 16:35:08] [INFO ] Computed 2 place invariants in 20 ms
[2022-05-15 16:35:08] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 266 rows 231 cols
[2022-05-15 16:35:08] [INFO ] Computed 2 place invariants in 7 ms
[2022-05-15 16:35:08] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
// Phase 1: matrix 266 rows 231 cols
[2022-05-15 16:35:08] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:08] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 231/324 places, 266/344 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/324 places, 266/344 transitions.
Support contains 33 out of 231 places after structural reductions.
[2022-05-15 16:35:09] [INFO ] Flatten gal took : 46 ms
[2022-05-15 16:35:09] [INFO ] Flatten gal took : 19 ms
[2022-05-15 16:35:09] [INFO ] Input system was already deterministic with 266 transitions.
Support contains 32 out of 231 places (down from 33) after GAL structural reductions.
Finished random walk after 1058 steps, including 2 resets, run visited all 21 properties in 104 ms. (steps per millisecond=10 )
Computed a total of 36 stabilizing places and 36 stable transitions
Graph (complete) has 439 edges and 231 vertex of which 220 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.118 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 229 transition count 266
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 210 transition count 247
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 210 transition count 247
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 201 transition count 235
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 201 transition count 235
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 195 transition count 228
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 195 transition count 228
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 76 place count 189 transition count 221
Iterating global reduction 1 with 6 rules applied. Total rules applied 82 place count 189 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 186 transition count 217
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 186 transition count 217
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 184 transition count 215
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 184 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 183 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 183 transition count 214
Applied a total of 94 rules in 27 ms. Remains 183 /231 variables (removed 48) and now considering 214/266 (removed 52) transitions.
// Phase 1: matrix 214 rows 183 cols
[2022-05-15 16:35:09] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:09] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 214 rows 183 cols
[2022-05-15 16:35:09] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-15 16:35:09] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 214 rows 183 cols
[2022-05-15 16:35:09] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:35:10] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 183/231 places, 214/266 transitions.
Finished structural reductions, in 1 iterations. Remains : 183/231 places, 214/266 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT 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:(EQ s170 1), p0:(OR (EQ s93 0) (EQ s166 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 968 steps with 4 reset in 13 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-02 finished in 671 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!(F(p0) U X(p1))&&F(p2)&&p3))))'
Support contains 7 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 266/266 transitions.
Graph (complete) has 439 edges and 231 vertex of which 220 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 219 transition count 222
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 184 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 183 transition count 221
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 73 place count 183 transition count 190
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 135 place count 152 transition count 190
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 143 place count 144 transition count 181
Iterating global reduction 3 with 8 rules applied. Total rules applied 151 place count 144 transition count 181
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 151 place count 144 transition count 179
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 155 place count 142 transition count 179
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 159 place count 138 transition count 174
Iterating global reduction 3 with 4 rules applied. Total rules applied 163 place count 138 transition count 174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 135 transition count 170
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 135 transition count 170
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 171 place count 133 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 133 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 132 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 132 transition count 166
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 267 place count 86 transition count 120
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 274 place count 79 transition count 106
Iterating global reduction 3 with 7 rules applied. Total rules applied 281 place count 79 transition count 106
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 288 place count 72 transition count 98
Iterating global reduction 3 with 7 rules applied. Total rules applied 295 place count 72 transition count 98
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 301 place count 66 transition count 87
Iterating global reduction 3 with 6 rules applied. Total rules applied 307 place count 66 transition count 87
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 311 place count 62 transition count 82
Iterating global reduction 3 with 4 rules applied. Total rules applied 315 place count 62 transition count 82
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 319 place count 58 transition count 75
Iterating global reduction 3 with 4 rules applied. Total rules applied 323 place count 58 transition count 75
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 327 place count 54 transition count 70
Iterating global reduction 3 with 4 rules applied. Total rules applied 331 place count 54 transition count 70
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 332 place count 53 transition count 69
Iterating global reduction 3 with 1 rules applied. Total rules applied 333 place count 53 transition count 69
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 334 place count 53 transition count 68
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 336 place count 53 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 338 place count 51 transition count 66
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 63 edges and 49 vertex of which 46 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 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 11 rules applied. Total rules applied 349 place count 46 transition count 55
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 357 place count 38 transition count 55
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 371 place count 31 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 375 place count 29 transition count 48
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 380 place count 29 transition count 43
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 384 place count 25 transition count 39
Applied a total of 384 rules in 97 ms. Remains 25 /231 variables (removed 206) and now considering 39/266 (removed 227) transitions.
[2022-05-15 16:35:10] [INFO ] Flow matrix only has 29 transitions (discarded 10 similar events)
// Phase 1: matrix 29 rows 25 cols
[2022-05-15 16:35:10] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 16:35:10] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-15 16:35:10] [INFO ] Flow matrix only has 29 transitions (discarded 10 similar events)
// Phase 1: matrix 29 rows 25 cols
[2022-05-15 16:35:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:35:10] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-15 16:35:10] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:35:10] [INFO ] Flow matrix only has 29 transitions (discarded 10 similar events)
// Phase 1: matrix 29 rows 25 cols
[2022-05-15 16:35:10] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:35:10] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/231 places, 39/266 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/231 places, 39/266 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p3) (NOT p2) p1), (AND p0 p1), p1, (NOT p2), (AND p1 (NOT p3)), (AND p0 p1), (OR (AND p0 (NOT p2)) (AND p0 (NOT p3)) (AND p0 p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p3), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={2} source=0 dest: 1}, { cond=p3, acceptance={0, 1, 2} source=0 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p3), acceptance={0, 2} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={2} source=1 dest: 1}, { cond=p0, acceptance={0, 1, 2} source=1 dest: 2}, { cond=p0, acceptance={0, 2} source=1 dest: 4}, { cond=(NOT p0), acceptance={1, 2} source=1 dest: 5}], [{ cond=(AND p3 p1), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p3) p1), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p0) p3 p1), acceptance={2} source=2 dest: 1}, { cond=(AND p3 p1), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p3 p1), acceptance={0, 2} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0, 1, 2} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), acceptance={2} source=4 dest: 1}, { cond=(OR (NOT p3) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND p0 (NOT p1))), acceptance={0, 2} source=4 dest: 4}], [{ cond=(AND p0 p3 p1), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p3) p1), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND (NOT p0) p3 p1), acceptance={2} source=5 dest: 1}, { cond=(AND p0 p3 p1), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 p3 p1), acceptance={0, 2} source=5 dest: 4}, { cond=(AND (NOT p0) p3 p1), acceptance={1, 2} source=5 dest: 5}, { cond=(AND (NOT p0) p3 p1), acceptance={1} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={1, 2} source=5 dest: 6}], [{ cond=(AND p0 p3), acceptance={0, 1} source=6 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={2} source=6 dest: 1}, { cond=(AND p0 p3), acceptance={0, 1, 2} source=6 dest: 2}, { cond=(AND p0 p3 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p0 p3), acceptance={0, 2} source=6 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={1, 2} source=6 dest: 5}, { cond=(AND (NOT p0) p3), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p3)), acceptance={1, 2} source=6 dest: 6}]], initial=0, aps=[p3:(OR (EQ s19 0) (EQ s23 1)), p0:(OR (EQ s12 0) (EQ s10 1)), p2:(EQ s15 1), p1:(OR (EQ s8 0) (EQ s4 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-04 finished in 550 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&X(p1)&&X(F(p2))))'
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 266/266 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 228 transition count 266
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 210 transition count 248
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 210 transition count 248
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 203 transition count 239
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 203 transition count 239
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 198 transition count 233
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 198 transition count 233
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 68 place count 193 transition count 227
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 193 transition count 227
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 76 place count 190 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 79 place count 190 transition count 223
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 188 transition count 221
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 188 transition count 221
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 187 transition count 220
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 187 transition count 220
Applied a total of 85 rules in 17 ms. Remains 187 /231 variables (removed 44) and now considering 220/266 (removed 46) transitions.
// Phase 1: matrix 220 rows 187 cols
[2022-05-15 16:35:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:10] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 220 rows 187 cols
[2022-05-15 16:35:10] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:35:11] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
// Phase 1: matrix 220 rows 187 cols
[2022-05-15 16:35:11] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:11] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/231 places, 220/266 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/231 places, 220/266 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s63 1), p0:(EQ s63 0), p1:(AND (EQ s120 0) (EQ s152 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-06 finished in 440 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(F(p0))||X(p1)))))'
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 231/231 places, 266/266 transitions.
Graph (complete) has 439 edges and 231 vertex of which 223 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 222 transition count 220
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 183 transition count 220
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 79 place count 183 transition count 188
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 143 place count 151 transition count 188
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 150 place count 144 transition count 180
Iterating global reduction 2 with 7 rules applied. Total rules applied 157 place count 144 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 157 place count 144 transition count 178
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 161 place count 142 transition count 178
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 165 place count 138 transition count 173
Iterating global reduction 2 with 4 rules applied. Total rules applied 169 place count 138 transition count 173
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 172 place count 135 transition count 169
Iterating global reduction 2 with 3 rules applied. Total rules applied 175 place count 135 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 176 place count 134 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 177 place count 134 transition count 168
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 277 place count 84 transition count 118
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 285 place count 76 transition count 102
Iterating global reduction 2 with 8 rules applied. Total rules applied 293 place count 76 transition count 102
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 301 place count 68 transition count 93
Iterating global reduction 2 with 8 rules applied. Total rules applied 309 place count 68 transition count 93
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 316 place count 61 transition count 80
Iterating global reduction 2 with 7 rules applied. Total rules applied 323 place count 61 transition count 80
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 330 place count 54 transition count 72
Iterating global reduction 2 with 7 rules applied. Total rules applied 337 place count 54 transition count 72
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 344 place count 47 transition count 59
Iterating global reduction 2 with 7 rules applied. Total rules applied 351 place count 47 transition count 59
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 358 place count 40 transition count 51
Iterating global reduction 2 with 7 rules applied. Total rules applied 365 place count 40 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 366 place count 39 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 367 place count 39 transition count 50
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 369 place count 39 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 370 place count 39 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 371 place count 38 transition count 47
Applied a total of 371 rules in 45 ms. Remains 38 /231 variables (removed 193) and now considering 47/266 (removed 219) transitions.
[2022-05-15 16:35:11] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 38 cols
[2022-05-15 16:35:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:35:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-05-15 16:35:11] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 38 cols
[2022-05-15 16:35:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:35:11] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-15 16:35:11] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-15 16:35:11] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 16:35:11] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 38 cols
[2022-05-15 16:35:11] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:35:11] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/231 places, 47/266 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/231 places, 47/266 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s22 1)), p1:(OR (EQ s35 0) (EQ s30 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]]
Product exploration explored 100000 steps with 1141 reset in 204 ms.
Product exploration explored 100000 steps with 1143 reset in 138 ms.
Computed a total of 38 stabilizing places and 40 stable transitions
Graph (complete) has 102 edges and 38 vertex of which 35 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Computed a total of 38 stabilizing places and 40 stable transitions
Detected a total of 38/38 stabilizing places and 40/47 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 119 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4339256 steps, run timeout after 3001 ms. (steps per millisecond=1445 ) properties seen :{}
Probabilistic random walk after 4339256 steps, saw 546978 distinct states, run finished after 3004 ms. (steps per millisecond=1444 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-15 16:35:15] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 38 cols
[2022-05-15 16:35:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:15] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 16:35:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 16:35:15] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-15 16:35:15] [INFO ] State equation strengthened by 35 read => feed constraints.
[2022-05-15 16:35:15] [INFO ] After 7ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2022-05-15 16:35:15] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 150 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-07 finished in 4182 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(!((G(F(!p1))||p0) U p2)))&&X(p1))))'
Support contains 6 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 266/266 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 228 transition count 266
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 209 transition count 247
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 209 transition count 247
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 202 transition count 238
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 202 transition count 238
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 198 transition count 234
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 198 transition count 234
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 194 transition count 229
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 194 transition count 229
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 192 transition count 226
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 192 transition count 226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 190 transition count 224
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 190 transition count 224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 189 transition count 223
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 189 transition count 223
Applied a total of 81 rules in 14 ms. Remains 189 /231 variables (removed 42) and now considering 223/266 (removed 43) transitions.
// Phase 1: matrix 223 rows 189 cols
[2022-05-15 16:35:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:15] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 223 rows 189 cols
[2022-05-15 16:35:15] [INFO ] Computed 2 place invariants in 10 ms
[2022-05-15 16:35:15] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
// Phase 1: matrix 223 rows 189 cols
[2022-05-15 16:35:15] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 16:35:15] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/231 places, 223/266 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/231 places, 223/266 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (AND (NOT p1) p2), p2]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p1 p0) (AND p1 p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s56 0) (EQ s119 1)), p0:(OR (EQ s145 0) (EQ s14 1)), p2:(OR (EQ s170 0) (EQ s95 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 421 steps with 0 reset in 4 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-08 finished in 590 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(X(p0)))||p0)))'
Support contains 2 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 266/266 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 228 transition count 266
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 208 transition count 246
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 208 transition count 246
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 200 transition count 235
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 200 transition count 235
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 195 transition count 229
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 195 transition count 229
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 74 place count 190 transition count 224
Iterating global reduction 1 with 5 rules applied. Total rules applied 79 place count 190 transition count 224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 188 transition count 221
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 188 transition count 221
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 187 transition count 220
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 187 transition count 220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 186 transition count 219
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 186 transition count 219
Applied a total of 87 rules in 18 ms. Remains 186 /231 variables (removed 45) and now considering 219/266 (removed 47) transitions.
// Phase 1: matrix 219 rows 186 cols
[2022-05-15 16:35:16] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:35:16] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 219 rows 186 cols
[2022-05-15 16:35:16] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:16] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 219 rows 186 cols
[2022-05-15 16:35:16] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 16:35:16] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/231 places, 219/266 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/231 places, 219/266 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s78 0) (EQ s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 287 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-10 finished in 442 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(X(p0))||X(p0)))&&F(p1))))'
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 229 transition count 266
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 211 transition count 248
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 211 transition count 248
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 202 transition count 236
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 202 transition count 236
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 196 transition count 229
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 196 transition count 229
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 190 transition count 222
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 190 transition count 222
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 187 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 187 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 88 place count 185 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 185 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 184 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 184 transition count 215
Applied a total of 92 rules in 21 ms. Remains 184 /231 variables (removed 47) and now considering 215/266 (removed 51) transitions.
// Phase 1: matrix 215 rows 184 cols
[2022-05-15 16:35:16] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:16] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 215 rows 184 cols
[2022-05-15 16:35:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:16] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 215 rows 184 cols
[2022-05-15 16:35:16] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 16:35:16] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/231 places, 215/266 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/231 places, 215/266 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s84 0) (EQ s53 1)), p0:(EQ s69 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-11 finished in 519 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(X(F(p1)))))'
Support contains 2 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 266/266 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 228 transition count 266
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 207 transition count 245
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 207 transition count 245
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 198 transition count 233
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 198 transition count 233
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 69 place count 192 transition count 226
Iterating global reduction 1 with 6 rules applied. Total rules applied 75 place count 192 transition count 226
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 81 place count 186 transition count 219
Iterating global reduction 1 with 6 rules applied. Total rules applied 87 place count 186 transition count 219
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 183 transition count 215
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 183 transition count 215
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 181 transition count 213
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 181 transition count 213
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 180 transition count 212
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 180 transition count 212
Applied a total of 99 rules in 14 ms. Remains 180 /231 variables (removed 51) and now considering 212/266 (removed 54) transitions.
// Phase 1: matrix 212 rows 180 cols
[2022-05-15 16:35:17] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:17] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 212 rows 180 cols
[2022-05-15 16:35:17] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:17] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
// Phase 1: matrix 212 rows 180 cols
[2022-05-15 16:35:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:17] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/231 places, 212/266 transitions.
Finished structural reductions, in 1 iterations. Remains : 180/231 places, 212/266 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s140 0) (EQ s95 1)), p1:(AND (EQ s95 0) (EQ s140 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 395 ms.
Product exploration explored 100000 steps with 50000 reset in 340 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Graph (complete) has 365 edges and 180 vertex of which 179 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-12 finished in 1288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 266/266 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 228 transition count 266
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 209 transition count 247
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 209 transition count 247
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 202 transition count 237
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 202 transition count 237
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 61 place count 196 transition count 230
Iterating global reduction 1 with 6 rules applied. Total rules applied 67 place count 196 transition count 230
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 73 place count 190 transition count 223
Iterating global reduction 1 with 6 rules applied. Total rules applied 79 place count 190 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 187 transition count 219
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 187 transition count 219
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 185 transition count 217
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 185 transition count 217
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 184 transition count 216
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 184 transition count 216
Applied a total of 91 rules in 20 ms. Remains 184 /231 variables (removed 47) and now considering 216/266 (removed 50) transitions.
// Phase 1: matrix 216 rows 184 cols
[2022-05-15 16:35:18] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:35:18] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 216 rows 184 cols
[2022-05-15 16:35:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:18] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 184 cols
[2022-05-15 16:35:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:18] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/231 places, 216/266 transitions.
Finished structural reductions, in 1 iterations. Remains : 184/231 places, 216/266 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-13 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 (NEQ s180 0) (NEQ s174 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 0 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-13 finished in 398 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 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 266/266 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 228 transition count 266
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 208 transition count 246
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 208 transition count 246
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 199 transition count 234
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 199 transition count 234
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 193 transition count 227
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 193 transition count 227
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 79 place count 187 transition count 220
Iterating global reduction 1 with 6 rules applied. Total rules applied 85 place count 187 transition count 220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 184 transition count 216
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 184 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 182 transition count 214
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 182 transition count 214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 181 transition count 213
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 181 transition count 213
Applied a total of 97 rules in 33 ms. Remains 181 /231 variables (removed 50) and now considering 213/266 (removed 53) transitions.
// Phase 1: matrix 213 rows 181 cols
[2022-05-15 16:35:18] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-15 16:35:18] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 213 rows 181 cols
[2022-05-15 16:35:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:19] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
// Phase 1: matrix 213 rows 181 cols
[2022-05-15 16:35:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:35:19] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 181/231 places, 213/266 transitions.
Finished structural reductions, in 1 iterations. Remains : 181/231 places, 213/266 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11b-LTLCardinality-14 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:(OR (EQ s25 0) (EQ s174 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 907 steps with 2 reset in 3 ms.
FORMULA DiscoveryGPU-PT-11b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11b-LTLCardinality-14 finished in 404 ms.
All properties solved by simple procedures.
Total runtime 11242 ms.

BK_STOP 1652632519243

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

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