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-165260109800108.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DiscoveryGPU-PT-12b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260109800108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 7.3K Apr 30 06:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 30 06:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 06:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 30 06:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 89K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652633068704

Running Version 202205111006
[2022-05-15 16:44:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 16:44:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:44:30] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2022-05-15 16:44:30] [INFO ] Transformed 352 places.
[2022-05-15 16:44:30] [INFO ] Transformed 374 transitions.
[2022-05-15 16:44:30] [INFO ] Found NUPN structural information;
[2022-05-15 16:44:30] [INFO ] Parsed PT model containing 352 places and 374 transitions in 245 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 352 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 374/374 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 328 transition count 374
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 78 place count 274 transition count 320
Iterating global reduction 1 with 54 rules applied. Total rules applied 132 place count 274 transition count 320
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 142 place count 264 transition count 310
Iterating global reduction 1 with 10 rules applied. Total rules applied 152 place count 264 transition count 310
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 159 place count 257 transition count 303
Iterating global reduction 1 with 7 rules applied. Total rules applied 166 place count 257 transition count 303
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 173 place count 250 transition count 296
Iterating global reduction 1 with 7 rules applied. Total rules applied 180 place count 250 transition count 296
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 184 place count 246 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 188 place count 246 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 192 place count 242 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 196 place count 242 transition count 284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 200 place count 238 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 204 place count 238 transition count 280
Applied a total of 204 rules in 88 ms. Remains 238 /352 variables (removed 114) and now considering 280/374 (removed 94) transitions.
// Phase 1: matrix 280 rows 238 cols
[2022-05-15 16:44:30] [INFO ] Computed 2 place invariants in 19 ms
[2022-05-15 16:44:30] [INFO ] Implicit Places using invariants in 226 ms returned []
// Phase 1: matrix 280 rows 238 cols
[2022-05-15 16:44:30] [INFO ] Computed 2 place invariants in 17 ms
[2022-05-15 16:44:30] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
// Phase 1: matrix 280 rows 238 cols
[2022-05-15 16:44:30] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:44:30] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/352 places, 280/374 transitions.
Finished structural reductions, in 1 iterations. Remains : 238/352 places, 280/374 transitions.
Support contains 32 out of 238 places after structural reductions.
[2022-05-15 16:44:31] [INFO ] Flatten gal took : 46 ms
[2022-05-15 16:44:31] [INFO ] Flatten gal took : 19 ms
[2022-05-15 16:44:31] [INFO ] Input system was already deterministic with 280 transitions.
Support contains 28 out of 238 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 25 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 280 rows 238 cols
[2022-05-15 16:44:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-15 16:44:31] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-12b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 471 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.12 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&p0))))'
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 280/280 transitions.
Graph (complete) has 471 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 234 transition count 238
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 196 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 195 transition count 237
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 79 place count 195 transition count 201
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 151 place count 159 transition count 201
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 159 place count 151 transition count 190
Iterating global reduction 3 with 8 rules applied. Total rules applied 167 place count 151 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 167 place count 151 transition count 189
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 169 place count 150 transition count 189
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 175 place count 144 transition count 183
Iterating global reduction 3 with 6 rules applied. Total rules applied 181 place count 144 transition count 183
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 184 place count 141 transition count 178
Iterating global reduction 3 with 3 rules applied. Total rules applied 187 place count 141 transition count 178
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 190 place count 138 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 193 place count 138 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 194 place count 137 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 137 transition count 173
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 305 place count 82 transition count 118
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 315 place count 72 transition count 99
Iterating global reduction 3 with 10 rules applied. Total rules applied 325 place count 72 transition count 99
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 335 place count 62 transition count 88
Iterating global reduction 3 with 10 rules applied. Total rules applied 345 place count 62 transition count 88
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 355 place count 52 transition count 68
Iterating global reduction 3 with 10 rules applied. Total rules applied 365 place count 52 transition count 68
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 375 place count 42 transition count 58
Iterating global reduction 3 with 10 rules applied. Total rules applied 385 place count 42 transition count 58
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 395 place count 32 transition count 38
Iterating global reduction 3 with 10 rules applied. Total rules applied 405 place count 32 transition count 38
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 415 place count 22 transition count 28
Iterating global reduction 3 with 10 rules applied. Total rules applied 425 place count 22 transition count 28
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 426 place count 21 transition count 26
Iterating global reduction 3 with 1 rules applied. Total rules applied 427 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 428 place count 20 transition count 25
Iterating global reduction 3 with 1 rules applied. Total rules applied 429 place count 20 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 430 place count 20 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 432 place count 18 transition count 22
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 19 edges and 16 vertex of which 13 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 439 place count 13 transition count 15
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 443 place count 9 transition count 15
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 447 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 448 place count 7 transition count 12
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 450 place count 5 transition count 10
Applied a total of 450 rules in 63 ms. Remains 5 /238 variables (removed 233) and now considering 10/280 (removed 270) transitions.
[2022-05-15 16:44:31] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2022-05-15 16:44:31] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:31] [INFO ] Implicit Places using invariants in 15 ms returned []
[2022-05-15 16:44:31] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2022-05-15 16:44:31] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-15 16:44:31] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-15 16:44:31] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:44:31] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 5 cols
[2022-05-15 16:44:31] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-15 16:44:32] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/238 places, 10/280 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/238 places, 10/280 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-01 finished in 328 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 280/280 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 224 transition count 265
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 224 transition count 265
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 219 transition count 260
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 219 transition count 260
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 214 transition count 255
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 214 transition count 255
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 210 transition count 248
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 210 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 206 transition count 243
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 206 transition count 243
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 202 transition count 239
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 202 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 201 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 201 transition count 238
Applied a total of 74 rules in 34 ms. Remains 201 /238 variables (removed 37) and now considering 238/280 (removed 42) transitions.
// Phase 1: matrix 238 rows 201 cols
[2022-05-15 16:44:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:32] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 238 rows 201 cols
[2022-05-15 16:44:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:32] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
// Phase 1: matrix 238 rows 201 cols
[2022-05-15 16:44:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:32] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 201/238 places, 238/280 transitions.
Finished structural reductions, in 1 iterations. Remains : 201/238 places, 238/280 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s151 1), p0:(EQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1595 steps with 4 reset in 26 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-03 finished in 508 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U X(p0)))'
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 280/280 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 224 transition count 263
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 224 transition count 263
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 218 transition count 257
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 218 transition count 257
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 212 transition count 251
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 212 transition count 251
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 209 transition count 246
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 209 transition count 246
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 206 transition count 242
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 206 transition count 242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 203 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 203 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 202 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 202 transition count 238
Applied a total of 72 rules in 22 ms. Remains 202 /238 variables (removed 36) and now considering 238/280 (removed 42) transitions.
// Phase 1: matrix 238 rows 202 cols
[2022-05-15 16:44:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:32] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 238 rows 202 cols
[2022-05-15 16:44:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:32] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 238 rows 202 cols
[2022-05-15 16:44:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:32] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 202/238 places, 238/280 transitions.
Finished structural reductions, in 1 iterations. Remains : 202/238 places, 238/280 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-04 automaton TGBA Formula[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:(OR (EQ s54 1) (AND (EQ s108 1) (EQ s198 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-04 finished in 365 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 280/280 transitions.
Graph (complete) has 471 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 234 transition count 238
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 196 transition count 238
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 77 place count 196 transition count 202
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 149 place count 160 transition count 202
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 157 place count 152 transition count 191
Iterating global reduction 2 with 8 rules applied. Total rules applied 165 place count 152 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 165 place count 152 transition count 190
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 151 transition count 190
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 173 place count 145 transition count 184
Iterating global reduction 2 with 6 rules applied. Total rules applied 179 place count 145 transition count 184
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 182 place count 142 transition count 179
Iterating global reduction 2 with 3 rules applied. Total rules applied 185 place count 142 transition count 179
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 188 place count 139 transition count 175
Iterating global reduction 2 with 3 rules applied. Total rules applied 191 place count 139 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 192 place count 138 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 193 place count 138 transition count 174
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 303 place count 83 transition count 119
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 314 place count 72 transition count 98
Iterating global reduction 2 with 11 rules applied. Total rules applied 325 place count 72 transition count 98
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 336 place count 61 transition count 86
Iterating global reduction 2 with 11 rules applied. Total rules applied 347 place count 61 transition count 86
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 357 place count 51 transition count 66
Iterating global reduction 2 with 10 rules applied. Total rules applied 367 place count 51 transition count 66
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 377 place count 41 transition count 56
Iterating global reduction 2 with 10 rules applied. Total rules applied 387 place count 41 transition count 56
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 397 place count 31 transition count 36
Iterating global reduction 2 with 10 rules applied. Total rules applied 407 place count 31 transition count 36
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 417 place count 21 transition count 26
Iterating global reduction 2 with 10 rules applied. Total rules applied 427 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 428 place count 20 transition count 24
Iterating global reduction 2 with 1 rules applied. Total rules applied 429 place count 20 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 430 place count 19 transition count 23
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 19 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 432 place count 19 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 19 transition count 22
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 435 place count 17 transition count 20
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 17 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 440 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 442 place count 10 transition count 15
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 448 place count 7 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 449 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 451 place count 5 transition count 9
Applied a total of 451 rules in 41 ms. Remains 5 /238 variables (removed 233) and now considering 9/280 (removed 271) transitions.
[2022-05-15 16:44:33] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 16:44:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:33] [INFO ] Implicit Places using invariants in 13 ms returned []
[2022-05-15 16:44:33] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 16:44:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:33] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-15 16:44:33] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:44:33] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2022-05-15 16:44:33] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:33] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/238 places, 9/280 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/238 places, 9/280 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-05 finished in 144 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))||X(G(p1)))))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 280/280 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 224 transition count 263
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 224 transition count 263
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 218 transition count 257
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 218 transition count 257
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 212 transition count 251
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 212 transition count 251
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 209 transition count 245
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 209 transition count 245
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 206 transition count 242
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 206 transition count 242
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 67 place count 203 transition count 239
Iterating global reduction 0 with 3 rules applied. Total rules applied 70 place count 203 transition count 239
Applied a total of 70 rules in 33 ms. Remains 203 /238 variables (removed 35) and now considering 239/280 (removed 41) transitions.
// Phase 1: matrix 239 rows 203 cols
[2022-05-15 16:44:33] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:44:33] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 239 rows 203 cols
[2022-05-15 16:44:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:33] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
// Phase 1: matrix 239 rows 203 cols
[2022-05-15 16:44:33] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:33] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/238 places, 239/280 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/238 places, 239/280 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s163 0), p1:(EQ s198 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 289 ms.
Product exploration explored 100000 steps with 33333 reset in 189 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 410 edges and 203 vertex of which 201 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 38 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-06 finished in 1049 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||G((F((G(p2)&&p1))||F(p3))))))'
Support contains 5 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 280/280 transitions.
Graph (complete) has 471 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 234 transition count 240
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 198 transition count 240
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 73 place count 198 transition count 203
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 147 place count 161 transition count 203
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 156 place count 152 transition count 191
Iterating global reduction 2 with 9 rules applied. Total rules applied 165 place count 152 transition count 191
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 170 place count 147 transition count 186
Iterating global reduction 2 with 5 rules applied. Total rules applied 175 place count 147 transition count 186
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 177 place count 145 transition count 182
Iterating global reduction 2 with 2 rules applied. Total rules applied 179 place count 145 transition count 182
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 181 place count 143 transition count 180
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 143 transition count 180
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 295 place count 87 transition count 124
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 304 place count 78 transition count 107
Iterating global reduction 2 with 9 rules applied. Total rules applied 313 place count 78 transition count 107
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 322 place count 69 transition count 97
Iterating global reduction 2 with 9 rules applied. Total rules applied 331 place count 69 transition count 97
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 339 place count 61 transition count 81
Iterating global reduction 2 with 8 rules applied. Total rules applied 347 place count 61 transition count 81
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 355 place count 53 transition count 73
Iterating global reduction 2 with 8 rules applied. Total rules applied 363 place count 53 transition count 73
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 371 place count 45 transition count 57
Iterating global reduction 2 with 8 rules applied. Total rules applied 379 place count 45 transition count 57
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 387 place count 37 transition count 49
Iterating global reduction 2 with 8 rules applied. Total rules applied 395 place count 37 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 396 place count 36 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 36 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 398 place count 35 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 399 place count 35 transition count 46
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 401 place count 35 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 403 place count 33 transition count 42
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 406 place count 32 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 408 place count 30 transition count 40
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 408 place count 30 transition count 36
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 416 place count 26 transition count 36
Applied a total of 416 rules in 44 ms. Remains 26 /238 variables (removed 212) and now considering 36/280 (removed 244) transitions.
[2022-05-15 16:44:34] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 26 cols
[2022-05-15 16:44:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:44:34] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-15 16:44:34] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 26 cols
[2022-05-15 16:44:34] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:44:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 16:44:34] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-15 16:44:34] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:44:34] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 26 cols
[2022-05-15 16:44:34] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:44:34] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/238 places, 36/280 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/238 places, 36/280 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s25 1)), p1:(AND (EQ s10 1) (EQ s25 1)), p3:(AND (EQ s13 1) (EQ s25 1)), p2:(AND (EQ s5 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3577 reset in 196 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-07 finished in 602 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(((G(F(p0)) U p1)&&X(p0)))&&F(X(p1))))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 280/280 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 223 transition count 262
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 223 transition count 262
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 216 transition count 255
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 216 transition count 255
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 209 transition count 248
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 209 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 62 place count 205 transition count 241
Iterating global reduction 0 with 4 rules applied. Total rules applied 66 place count 205 transition count 241
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 201 transition count 236
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 201 transition count 236
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 197 transition count 232
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 197 transition count 232
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 196 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 196 transition count 231
Applied a total of 84 rules in 21 ms. Remains 196 /238 variables (removed 42) and now considering 231/280 (removed 49) transitions.
// Phase 1: matrix 231 rows 196 cols
[2022-05-15 16:44:34] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:44:34] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 231 rows 196 cols
[2022-05-15 16:44:34] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:44:35] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
// Phase 1: matrix 231 rows 196 cols
[2022-05-15 16:44:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:35] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/238 places, 231/280 transitions.
Finished structural reductions, in 1 iterations. Remains : 196/238 places, 231/280 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s67 1), p0:(EQ s144 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 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-08 finished in 561 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X(F(p1))||p2))))'
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 280/280 transitions.
Graph (complete) has 471 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 234 transition count 239
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 197 transition count 239
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 75 place count 197 transition count 204
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 145 place count 162 transition count 204
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 152 place count 155 transition count 195
Iterating global reduction 2 with 7 rules applied. Total rules applied 159 place count 155 transition count 195
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 159 place count 155 transition count 194
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 161 place count 154 transition count 194
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 166 place count 149 transition count 189
Iterating global reduction 2 with 5 rules applied. Total rules applied 171 place count 149 transition count 189
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 174 place count 146 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 177 place count 146 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 179 place count 144 transition count 182
Iterating global reduction 2 with 2 rules applied. Total rules applied 181 place count 144 transition count 182
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 293 place count 88 transition count 126
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 302 place count 79 transition count 109
Iterating global reduction 2 with 9 rules applied. Total rules applied 311 place count 79 transition count 109
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 320 place count 70 transition count 99
Iterating global reduction 2 with 9 rules applied. Total rules applied 329 place count 70 transition count 99
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 338 place count 61 transition count 81
Iterating global reduction 2 with 9 rules applied. Total rules applied 347 place count 61 transition count 81
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 356 place count 52 transition count 72
Iterating global reduction 2 with 9 rules applied. Total rules applied 365 place count 52 transition count 72
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 374 place count 43 transition count 54
Iterating global reduction 2 with 9 rules applied. Total rules applied 383 place count 43 transition count 54
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 392 place count 34 transition count 45
Iterating global reduction 2 with 9 rules applied. Total rules applied 401 place count 34 transition count 45
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 402 place count 33 transition count 43
Iterating global reduction 2 with 1 rules applied. Total rules applied 403 place count 33 transition count 43
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 404 place count 32 transition count 42
Iterating global reduction 2 with 1 rules applied. Total rules applied 405 place count 32 transition count 42
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 406 place count 32 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 408 place count 30 transition count 40
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 51 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 413 place count 28 transition count 36
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 416 place count 25 transition count 36
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 422 place count 22 transition count 33
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 425 place count 19 transition count 30
Applied a total of 425 rules in 48 ms. Remains 19 /238 variables (removed 219) and now considering 30/280 (removed 250) transitions.
[2022-05-15 16:44:35] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 19 cols
[2022-05-15 16:44:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:44:35] [INFO ] Implicit Places using invariants in 18 ms returned []
[2022-05-15 16:44:35] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 19 cols
[2022-05-15 16:44:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:44:35] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-15 16:44:35] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:44:35] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 19 cols
[2022-05-15 16:44:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:44:35] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/238 places, 30/280 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/238 places, 30/280 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s13 0), p0:(OR (EQ s14 0) (EQ s18 0)), p1:(EQ s7 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1300 reset in 137 ms.
Product exploration explored 100000 steps with 1303 reset in 120 ms.
Computed a total of 19 stabilizing places and 24 stable transitions
Graph (complete) has 37 edges and 19 vertex of which 17 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 19 stabilizing places and 24 stable transitions
Detected a total of 19/19 stabilizing places and 24/30 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 297 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 151 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-15 16:44:36] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 19 cols
[2022-05-15 16:44:36] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:44:36] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 16:44:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-15 16:44:36] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p2 (NOT p1) (NOT p0)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p2) (NOT p0))))
Knowledge based reduction with 10 factoid took 257 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-09 finished in 1396 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X(p0)))))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 280/280 transitions.
Graph (complete) has 471 edges and 238 vertex of which 236 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 235 transition count 238
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 196 transition count 238
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 79 place count 196 transition count 202
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 151 place count 160 transition count 202
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 158 place count 153 transition count 192
Iterating global reduction 2 with 7 rules applied. Total rules applied 165 place count 153 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 165 place count 153 transition count 191
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 152 transition count 191
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 172 place count 147 transition count 186
Iterating global reduction 2 with 5 rules applied. Total rules applied 177 place count 147 transition count 186
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 179 place count 145 transition count 182
Iterating global reduction 2 with 2 rules applied. Total rules applied 181 place count 145 transition count 182
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 183 place count 143 transition count 180
Iterating global reduction 2 with 2 rules applied. Total rules applied 185 place count 143 transition count 180
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 299 place count 86 transition count 123
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 309 place count 76 transition count 104
Iterating global reduction 2 with 10 rules applied. Total rules applied 319 place count 76 transition count 104
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 329 place count 66 transition count 93
Iterating global reduction 2 with 10 rules applied. Total rules applied 339 place count 66 transition count 93
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 349 place count 56 transition count 73
Iterating global reduction 2 with 10 rules applied. Total rules applied 359 place count 56 transition count 73
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 369 place count 46 transition count 63
Iterating global reduction 2 with 10 rules applied. Total rules applied 379 place count 46 transition count 63
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 389 place count 36 transition count 43
Iterating global reduction 2 with 10 rules applied. Total rules applied 399 place count 36 transition count 43
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 408 place count 27 transition count 34
Iterating global reduction 2 with 9 rules applied. Total rules applied 417 place count 27 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 418 place count 26 transition count 32
Iterating global reduction 2 with 1 rules applied. Total rules applied 419 place count 26 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 420 place count 25 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 421 place count 25 transition count 31
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 423 place count 25 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 425 place count 23 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 23 edges and 21 vertex of which 18 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 2 with 9 rules applied. Total rules applied 434 place count 18 transition count 18
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 440 place count 12 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 444 place count 10 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 445 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 447 place count 8 transition count 13
Applied a total of 447 rules in 33 ms. Remains 8 /238 variables (removed 230) and now considering 13/280 (removed 267) transitions.
[2022-05-15 16:44:36] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 16:44:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:36] [INFO ] Implicit Places using invariants in 16 ms returned []
[2022-05-15 16:44:36] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 16:44:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:36] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-15 16:44:36] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:44:36] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-15 16:44:36] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:36] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/238 places, 13/280 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/238 places, 13/280 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s3 1) (EQ s6 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 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-10 finished in 145 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X(p0)))))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 280/280 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 222 transition count 261
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 222 transition count 261
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 39 place count 215 transition count 254
Iterating global reduction 0 with 7 rules applied. Total rules applied 46 place count 215 transition count 254
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 208 transition count 247
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 208 transition count 247
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 204 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 204 transition count 240
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 200 transition count 235
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 200 transition count 235
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 196 transition count 231
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 196 transition count 231
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 195 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 195 transition count 230
Applied a total of 86 rules in 22 ms. Remains 195 /238 variables (removed 43) and now considering 230/280 (removed 50) transitions.
// Phase 1: matrix 230 rows 195 cols
[2022-05-15 16:44:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:37] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 230 rows 195 cols
[2022-05-15 16:44:37] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:44:37] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
// Phase 1: matrix 230 rows 195 cols
[2022-05-15 16:44:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:37] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 195/238 places, 230/280 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/238 places, 230/280 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s39 1) (EQ s184 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 119 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-12 finished in 510 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F(X(p1))))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 280/280 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 224 transition count 263
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 224 transition count 263
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 217 transition count 256
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 217 transition count 256
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 210 transition count 249
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 210 transition count 249
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 206 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 206 transition count 242
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 202 transition count 237
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 202 transition count 237
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 198 transition count 233
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 198 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 197 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 197 transition count 232
Applied a total of 82 rules in 20 ms. Remains 197 /238 variables (removed 41) and now considering 232/280 (removed 48) transitions.
// Phase 1: matrix 232 rows 197 cols
[2022-05-15 16:44:37] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 16:44:37] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 232 rows 197 cols
[2022-05-15 16:44:37] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:44:37] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
// Phase 1: matrix 232 rows 197 cols
[2022-05-15 16:44:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:44:37] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/238 places, 232/280 transitions.
Finished structural reductions, in 1 iterations. Remains : 197/238 places, 232/280 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s49 1), p1:(EQ s81 0)], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Graph (complete) has 398 edges and 197 vertex of which 196 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 38 stabilizing places and 38 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-13 finished in 886 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(p0)))))'
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 280/280 transitions.
Graph (complete) has 471 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 234 transition count 238
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 196 transition count 238
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 77 place count 196 transition count 202
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 149 place count 160 transition count 202
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 157 place count 152 transition count 191
Iterating global reduction 2 with 8 rules applied. Total rules applied 165 place count 152 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 165 place count 152 transition count 190
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 151 transition count 190
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 173 place count 145 transition count 184
Iterating global reduction 2 with 6 rules applied. Total rules applied 179 place count 145 transition count 184
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 182 place count 142 transition count 179
Iterating global reduction 2 with 3 rules applied. Total rules applied 185 place count 142 transition count 179
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 188 place count 139 transition count 175
Iterating global reduction 2 with 3 rules applied. Total rules applied 191 place count 139 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 192 place count 138 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 193 place count 138 transition count 174
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 303 place count 83 transition count 119
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 313 place count 73 transition count 100
Iterating global reduction 2 with 10 rules applied. Total rules applied 323 place count 73 transition count 100
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 333 place count 63 transition count 89
Iterating global reduction 2 with 10 rules applied. Total rules applied 343 place count 63 transition count 89
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 353 place count 53 transition count 69
Iterating global reduction 2 with 10 rules applied. Total rules applied 363 place count 53 transition count 69
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 373 place count 43 transition count 59
Iterating global reduction 2 with 10 rules applied. Total rules applied 383 place count 43 transition count 59
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 393 place count 33 transition count 39
Iterating global reduction 2 with 10 rules applied. Total rules applied 403 place count 33 transition count 39
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 413 place count 23 transition count 29
Iterating global reduction 2 with 10 rules applied. Total rules applied 423 place count 23 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 424 place count 22 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 425 place count 22 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 426 place count 21 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 427 place count 21 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 428 place count 21 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 429 place count 21 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 431 place count 19 transition count 23
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 20 edges and 17 vertex of which 14 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 7 rules applied. Total rules applied 438 place count 14 transition count 16
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 442 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 446 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 447 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 449 place count 6 transition count 11
Applied a total of 449 rules in 88 ms. Remains 6 /238 variables (removed 232) and now considering 11/280 (removed 269) transitions.
[2022-05-15 16:44:38] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 16:44:38] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:38] [INFO ] Implicit Places using invariants in 51 ms returned []
[2022-05-15 16:44:38] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 16:44:38] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:38] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2022-05-15 16:44:38] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 16:44:38] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 16:44:38] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 16:44:38] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/238 places, 11/280 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/238 places, 11/280 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12b-LTLFireability-15 finished in 228 ms.
All properties solved by simple procedures.
Total runtime 8733 ms.

BK_STOP 1652633078638

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-12b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DiscoveryGPU-PT-12b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-165260109800108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-12b.tgz
mv DiscoveryGPU-PT-12b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;