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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 8.3K Apr 30 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 30 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 30 07:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 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 97K 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-13b-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-13b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652634468735

Running Version 202205111006
[2022-05-15 17:07:49] [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 17:07:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 17:07:50] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-05-15 17:07:50] [INFO ] Transformed 380 places.
[2022-05-15 17:07:50] [INFO ] Transformed 404 transitions.
[2022-05-15 17:07:50] [INFO ] Found NUPN structural information;
[2022-05-15 17:07:50] [INFO ] Parsed PT model containing 380 places and 404 transitions in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-13b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 404/404 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 354 transition count 404
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 88 place count 292 transition count 342
Iterating global reduction 1 with 62 rules applied. Total rules applied 150 place count 292 transition count 342
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 164 place count 278 transition count 328
Iterating global reduction 1 with 14 rules applied. Total rules applied 178 place count 278 transition count 328
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 189 place count 267 transition count 317
Iterating global reduction 1 with 11 rules applied. Total rules applied 200 place count 267 transition count 317
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 211 place count 256 transition count 306
Iterating global reduction 1 with 11 rules applied. Total rules applied 222 place count 256 transition count 306
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 232 place count 246 transition count 286
Iterating global reduction 1 with 10 rules applied. Total rules applied 242 place count 246 transition count 286
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 249 place count 239 transition count 279
Iterating global reduction 1 with 7 rules applied. Total rules applied 256 place count 239 transition count 279
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 263 place count 232 transition count 272
Iterating global reduction 1 with 7 rules applied. Total rules applied 270 place count 232 transition count 272
Applied a total of 270 rules in 90 ms. Remains 232 /380 variables (removed 148) and now considering 272/404 (removed 132) transitions.
// Phase 1: matrix 272 rows 232 cols
[2022-05-15 17:07:50] [INFO ] Computed 2 place invariants in 19 ms
[2022-05-15 17:07:50] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 272 rows 232 cols
[2022-05-15 17:07:50] [INFO ] Computed 2 place invariants in 9 ms
[2022-05-15 17:07:50] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
// Phase 1: matrix 272 rows 232 cols
[2022-05-15 17:07:50] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 17:07:50] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/380 places, 272/404 transitions.
Finished structural reductions, in 1 iterations. Remains : 232/380 places, 272/404 transitions.
Support contains 28 out of 232 places after structural reductions.
[2022-05-15 17:07:51] [INFO ] Flatten gal took : 45 ms
[2022-05-15 17:07:51] [INFO ] Flatten gal took : 20 ms
[2022-05-15 17:07:51] [INFO ] Input system was already deterministic with 272 transitions.
Support contains 27 out of 232 places (down from 28) after GAL structural reductions.
Finished random walk after 1686 steps, including 3 resets, run visited all 26 properties in 116 ms. (steps per millisecond=14 )
Computed a total of 45 stabilizing places and 45 stable transitions
Graph (complete) has 461 edges and 232 vertex of which 230 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 272/272 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 221 transition count 260
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 221 transition count 260
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 216 transition count 255
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 216 transition count 255
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 214 transition count 253
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 214 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 213 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 213 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 212 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 211 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 210 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 210 transition count 248
Applied a total of 44 rules in 95 ms. Remains 210 /232 variables (removed 22) and now considering 248/272 (removed 24) transitions.
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:07:51] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 17:07:51] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:07:51] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 17:07:51] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:07:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:51] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 210/232 places, 248/272 transitions.
Finished structural reductions, in 1 iterations. Remains : 210/232 places, 248/272 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s170 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-01 finished in 726 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(!(F(p0) U X(p1)))))&&F(p2)))'
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 272/272 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 222 transition count 261
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 222 transition count 261
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 217 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 217 transition count 256
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 215 transition count 254
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 215 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 214 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 214 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 213 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 213 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 212 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 211 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 211 transition count 249
Applied a total of 42 rules in 29 ms. Remains 211 /232 variables (removed 21) and now considering 249/272 (removed 23) transitions.
// Phase 1: matrix 249 rows 211 cols
[2022-05-15 17:07:52] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:07:52] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 249 rows 211 cols
[2022-05-15 17:07:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:52] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
// Phase 1: matrix 249 rows 211 cols
[2022-05-15 17:07:52] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:07:52] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 211/232 places, 249/272 transitions.
Finished structural reductions, in 1 iterations. Remains : 211/232 places, 249/272 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p2) p1), (NOT p2), p1, p1, p1, true]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s148 0), p1:(EQ s59 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 163 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-02 finished in 550 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 272/272 transitions.
Graph (complete) has 461 edges and 232 vertex of which 230 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 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 229 transition count 232
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 192 transition count 232
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 75 place count 192 transition count 196
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 147 place count 156 transition count 196
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 152 place count 151 transition count 190
Iterating global reduction 2 with 5 rules applied. Total rules applied 157 place count 151 transition count 190
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 159 place count 149 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 161 place count 149 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 162 place count 148 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 163 place count 148 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 164 place count 147 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 147 transition count 185
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 285 place count 87 transition count 125
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 296 place count 76 transition count 103
Iterating global reduction 2 with 11 rules applied. Total rules applied 307 place count 76 transition count 103
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 318 place count 65 transition count 92
Iterating global reduction 2 with 11 rules applied. Total rules applied 329 place count 65 transition count 92
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 340 place count 54 transition count 70
Iterating global reduction 2 with 11 rules applied. Total rules applied 351 place count 54 transition count 70
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 362 place count 43 transition count 59
Iterating global reduction 2 with 11 rules applied. Total rules applied 373 place count 43 transition count 59
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 384 place count 32 transition count 37
Iterating global reduction 2 with 11 rules applied. Total rules applied 395 place count 32 transition count 37
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 406 place count 21 transition count 26
Iterating global reduction 2 with 11 rules applied. Total rules applied 417 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 418 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 420 place count 19 transition count 23
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 422 place count 18 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 423 place count 17 transition count 22
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 423 place count 17 transition count 19
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 429 place count 14 transition count 19
Applied a total of 429 rules in 66 ms. Remains 14 /232 variables (removed 218) and now considering 19/272 (removed 253) transitions.
[2022-05-15 17:07:52] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 17:07:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:07:52] [INFO ] Implicit Places using invariants in 23 ms returned []
[2022-05-15 17:07:52] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 17:07:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:07:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 17:07:52] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-15 17:07:52] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:07:52] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 17:07:52] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-15 17:07:52] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/232 places, 19/272 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/232 places, 19/272 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s8 1) (NEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1017 reset in 242 ms.
Product exploration explored 100000 steps with 1003 reset in 171 ms.
Computed a total of 9 stabilizing places and 11 stable transitions
Computed a total of 9 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Finished random walk after 268 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=134 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 19/19 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2022-05-15 17:07:53] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 17:07:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:07:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-15 17:07:53] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 17:07:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:07:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 17:07:53] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-15 17:07:53] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:07:53] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 17:07:53] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-15 17:07:53] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 19/19 transitions.
Computed a total of 9 stabilizing places and 11 stable transitions
Computed a total of 9 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 690 steps, including 4 resets, run visited all 1 properties in 3 ms. (steps per millisecond=230 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 961 reset in 108 ms.
Product exploration explored 100000 steps with 1019 reset in 103 ms.
Built C files in :
/tmp/ltsmin12716683796121086787
[2022-05-15 17:07:54] [INFO ] Computing symmetric may disable matrix : 19 transitions.
[2022-05-15 17:07:54] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:07:54] [INFO ] Computing symmetric may enable matrix : 19 transitions.
[2022-05-15 17:07:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:07:54] [INFO ] Computing Do-Not-Accords matrix : 19 transitions.
[2022-05-15 17:07:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 17:07:54] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12716683796121086787
Running compilation step : cd /tmp/ltsmin12716683796121086787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 166 ms.
Running link step : cd /tmp/ltsmin12716683796121086787;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin12716683796121086787;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1455199810872800027.hoa' '--buchi-type=spotba'
LTSmin run took 1985 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-03 finished in 4143 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F((F(p0)||p1)) U !(F(p0)&&p1)))))'
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 272/272 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 222 transition count 261
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 222 transition count 261
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 218 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 218 transition count 257
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 216 transition count 255
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 216 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 215 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 215 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 214 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 214 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 213 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 213 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 212 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 212 transition count 250
Applied a total of 40 rules in 41 ms. Remains 212 /232 variables (removed 20) and now considering 250/272 (removed 22) transitions.
// Phase 1: matrix 250 rows 212 cols
[2022-05-15 17:07:56] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:07:57] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 250 rows 212 cols
[2022-05-15 17:07:57] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:07:57] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 212 cols
[2022-05-15 17:07:57] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:07:57] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 212/232 places, 250/272 transitions.
Finished structural reductions, in 1 iterations. Remains : 212/232 places, 250/272 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND p0 p1), (AND p0 p1)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(AND (EQ s177 1) (EQ s211 1)), p1:(EQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Computed a total of 41 stabilizing places and 41 stable transitions
Graph (complete) has 430 edges and 212 vertex of which 211 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 41 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1))
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-04 finished in 1130 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0)||p1))))'
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 272/272 transitions.
Graph (complete) has 461 edges and 232 vertex of which 230 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 229 transition count 234
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 194 transition count 234
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 71 place count 194 transition count 197
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 145 place count 157 transition count 197
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 153 transition count 192
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 153 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 155 place count 151 transition count 190
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 151 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 150 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 150 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 160 place count 149 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 149 transition count 187
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 277 place count 91 transition count 129
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 287 place count 81 transition count 109
Iterating global reduction 2 with 10 rules applied. Total rules applied 297 place count 81 transition count 109
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 307 place count 71 transition count 99
Iterating global reduction 2 with 10 rules applied. Total rules applied 317 place count 71 transition count 99
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 327 place count 61 transition count 79
Iterating global reduction 2 with 10 rules applied. Total rules applied 337 place count 61 transition count 79
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 347 place count 51 transition count 69
Iterating global reduction 2 with 10 rules applied. Total rules applied 357 place count 51 transition count 69
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 367 place count 41 transition count 49
Iterating global reduction 2 with 10 rules applied. Total rules applied 377 place count 41 transition count 49
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 387 place count 31 transition count 39
Iterating global reduction 2 with 10 rules applied. Total rules applied 397 place count 31 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 399 place count 30 transition count 39
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 400 place count 30 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 402 place count 28 transition count 37
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 45 edges and 27 vertex of which 26 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 407 place count 26 transition count 33
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 410 place count 23 transition count 33
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 416 place count 20 transition count 30
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 419 place count 17 transition count 27
Applied a total of 419 rules in 47 ms. Remains 17 /232 variables (removed 215) and now considering 27/272 (removed 245) transitions.
[2022-05-15 17:07:58] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 17 cols
[2022-05-15 17:07:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:07:58] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-15 17:07:58] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 17 cols
[2022-05-15 17:07:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:07:58] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-15 17:07:58] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 17:07:58] [INFO ] Flow matrix only has 22 transitions (discarded 5 similar events)
// Phase 1: matrix 22 rows 17 cols
[2022-05-15 17:07:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:07:58] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/232 places, 27/272 transitions.
Finished structural reductions, in 1 iterations. Remains : 17/232 places, 27/272 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s16 1)), p1:(AND (EQ s10 0) (OR (EQ s6 0) (EQ s16 0)))], nbAcceptance=2, 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 30 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-05 finished in 175 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(F((G(F(p0))&&G(p1))))||p2))))'
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 272/272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 223 transition count 263
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 223 transition count 263
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 219 transition count 259
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 219 transition count 259
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 218 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 218 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 217 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 217 transition count 257
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 216 transition count 255
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 216 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 215 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 215 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 214 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 214 transition count 253
Applied a total of 36 rules in 36 ms. Remains 214 /232 variables (removed 18) and now considering 253/272 (removed 19) transitions.
// Phase 1: matrix 253 rows 214 cols
[2022-05-15 17:07:58] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:07:58] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 253 rows 214 cols
[2022-05-15 17:07:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:58] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
// Phase 1: matrix 253 rows 214 cols
[2022-05-15 17:07:58] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:07:58] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 214/232 places, 253/272 transitions.
Finished structural reductions, in 1 iterations. Remains : 214/232 places, 253/272 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s20 1), p1:(EQ s178 1), p0:(EQ s110 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 488 steps with 0 reset in 9 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-06 finished in 555 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||F(p1))))'
Support contains 3 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 272/272 transitions.
Graph (complete) has 461 edges and 232 vertex of which 231 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 230 transition count 233
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 193 transition count 233
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 75 place count 193 transition count 196
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 149 place count 156 transition count 196
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 153 place count 152 transition count 191
Iterating global reduction 2 with 4 rules applied. Total rules applied 157 place count 152 transition count 191
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 151 transition count 190
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 151 transition count 190
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 281 place count 90 transition count 129
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 292 place count 79 transition count 107
Iterating global reduction 2 with 11 rules applied. Total rules applied 303 place count 79 transition count 107
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 314 place count 68 transition count 96
Iterating global reduction 2 with 11 rules applied. Total rules applied 325 place count 68 transition count 96
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 335 place count 58 transition count 76
Iterating global reduction 2 with 10 rules applied. Total rules applied 345 place count 58 transition count 76
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 355 place count 48 transition count 66
Iterating global reduction 2 with 10 rules applied. Total rules applied 365 place count 48 transition count 66
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 375 place count 38 transition count 46
Iterating global reduction 2 with 10 rules applied. Total rules applied 385 place count 38 transition count 46
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 395 place count 28 transition count 36
Iterating global reduction 2 with 10 rules applied. Total rules applied 405 place count 28 transition count 36
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 407 place count 28 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 409 place count 26 transition count 32
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 412 place count 25 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 414 place count 23 transition count 30
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 414 place count 23 transition count 26
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 422 place count 19 transition count 26
Applied a total of 422 rules in 43 ms. Remains 19 /232 variables (removed 213) and now considering 26/272 (removed 246) transitions.
[2022-05-15 17:07:58] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-15 17:07:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:07:58] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-15 17:07:58] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-15 17:07:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:07:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 17:07:58] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-15 17:07:58] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:07:58] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-15 17:07:58] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 17:07:58] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/232 places, 26/272 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/232 places, 26/272 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s18 1)), p1:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 58632 steps with 2639 reset in 102 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-07 finished in 338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 272/272 transitions.
Graph (complete) has 461 edges and 232 vertex of which 230 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 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 229 transition count 234
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 194 transition count 234
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 71 place count 194 transition count 198
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 143 place count 158 transition count 198
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 148 place count 153 transition count 192
Iterating global reduction 2 with 5 rules applied. Total rules applied 153 place count 153 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 155 place count 151 transition count 190
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 151 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 150 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 150 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 160 place count 149 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 149 transition count 187
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 281 place count 89 transition count 127
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 293 place count 77 transition count 103
Iterating global reduction 2 with 12 rules applied. Total rules applied 305 place count 77 transition count 103
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 316 place count 66 transition count 92
Iterating global reduction 2 with 11 rules applied. Total rules applied 327 place count 66 transition count 92
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 338 place count 55 transition count 70
Iterating global reduction 2 with 11 rules applied. Total rules applied 349 place count 55 transition count 70
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 359 place count 45 transition count 60
Iterating global reduction 2 with 10 rules applied. Total rules applied 369 place count 45 transition count 60
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 379 place count 35 transition count 40
Iterating global reduction 2 with 10 rules applied. Total rules applied 389 place count 35 transition count 40
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 399 place count 25 transition count 30
Iterating global reduction 2 with 10 rules applied. Total rules applied 409 place count 25 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 411 place count 23 transition count 28
Applied a total of 411 rules in 29 ms. Remains 23 /232 variables (removed 209) and now considering 28/272 (removed 244) transitions.
[2022-05-15 17:07:59] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-15 17:07:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:07:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-15 17:07:59] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-15 17:07:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:07:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 17:07:59] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-15 17:07:59] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 17:07:59] [INFO ] Flow matrix only has 25 transitions (discarded 3 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-15 17:07:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:59] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/232 places, 28/272 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/232 places, 28/272 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s15 1) (EQ s20 1)), p0:(AND (EQ s8 1) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 225 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-08 finished in 208 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 272/272 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 222 transition count 261
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 222 transition count 261
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 218 transition count 257
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 218 transition count 257
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 216 transition count 255
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 216 transition count 255
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 215 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 215 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 214 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 214 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 213 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 213 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 212 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 212 transition count 250
Applied a total of 40 rules in 21 ms. Remains 212 /232 variables (removed 20) and now considering 250/272 (removed 22) transitions.
// Phase 1: matrix 250 rows 212 cols
[2022-05-15 17:07:59] [INFO ] Computed 2 place invariants in 7 ms
[2022-05-15 17:07:59] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 250 rows 212 cols
[2022-05-15 17:07:59] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:07:59] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 212 cols
[2022-05-15 17:07:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:07:59] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 212/232 places, 250/272 transitions.
Finished structural reductions, in 1 iterations. Remains : 212/232 places, 250/272 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-10 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 (NEQ s135 1) (NEQ s211 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 376 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-10 finished in 497 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 272/272 transitions.
Graph (complete) has 461 edges and 232 vertex of which 230 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 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 229 transition count 232
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 192 transition count 232
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 75 place count 192 transition count 195
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 149 place count 155 transition count 195
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 154 place count 150 transition count 189
Iterating global reduction 2 with 5 rules applied. Total rules applied 159 place count 150 transition count 189
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 148 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 148 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 164 place count 147 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 165 place count 147 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 146 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 146 transition count 184
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 287 place count 86 transition count 124
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 299 place count 74 transition count 100
Iterating global reduction 2 with 12 rules applied. Total rules applied 311 place count 74 transition count 100
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 323 place count 62 transition count 88
Iterating global reduction 2 with 12 rules applied. Total rules applied 335 place count 62 transition count 88
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 346 place count 51 transition count 66
Iterating global reduction 2 with 11 rules applied. Total rules applied 357 place count 51 transition count 66
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 368 place count 40 transition count 55
Iterating global reduction 2 with 11 rules applied. Total rules applied 379 place count 40 transition count 55
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 390 place count 29 transition count 33
Iterating global reduction 2 with 11 rules applied. Total rules applied 401 place count 29 transition count 33
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 412 place count 18 transition count 22
Iterating global reduction 2 with 11 rules applied. Total rules applied 423 place count 18 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 424 place count 18 transition count 21
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 426 place count 16 transition count 19
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 428 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 429 place count 14 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 429 place count 14 transition count 16
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 433 place count 12 transition count 16
Applied a total of 433 rules in 26 ms. Remains 12 /232 variables (removed 220) and now considering 16/272 (removed 256) transitions.
[2022-05-15 17:07:59] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 12 cols
[2022-05-15 17:07:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:07:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-15 17:07:59] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 12 cols
[2022-05-15 17:07:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:07:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 17:07:59] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-15 17:07:59] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:07:59] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 12 cols
[2022-05-15 17:07:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:07:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/232 places, 16/272 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/232 places, 16/272 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s11 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 126 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-11 finished in 151 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(p0)&&X(X(F(p1)))))||(G(p2) U p3))))'
Support contains 4 out of 232 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 272/272 transitions.
Graph (complete) has 461 edges and 232 vertex of which 230 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 229 transition count 235
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 195 transition count 235
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 69 place count 195 transition count 198
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 143 place count 158 transition count 198
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 148 place count 153 transition count 192
Iterating global reduction 2 with 5 rules applied. Total rules applied 153 place count 153 transition count 192
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 155 place count 151 transition count 190
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 151 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 150 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 150 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 160 place count 149 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 149 transition count 187
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 273 place count 93 transition count 131
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 285 place count 81 transition count 107
Iterating global reduction 2 with 12 rules applied. Total rules applied 297 place count 81 transition count 107
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 308 place count 70 transition count 96
Iterating global reduction 2 with 11 rules applied. Total rules applied 319 place count 70 transition count 96
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 330 place count 59 transition count 74
Iterating global reduction 2 with 11 rules applied. Total rules applied 341 place count 59 transition count 74
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 352 place count 48 transition count 63
Iterating global reduction 2 with 11 rules applied. Total rules applied 363 place count 48 transition count 63
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 373 place count 38 transition count 43
Iterating global reduction 2 with 10 rules applied. Total rules applied 383 place count 38 transition count 43
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 393 place count 28 transition count 33
Iterating global reduction 2 with 10 rules applied. Total rules applied 403 place count 28 transition count 33
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 404 place count 28 transition count 32
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 406 place count 28 transition count 32
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 408 place count 26 transition count 30
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 410 place count 25 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 411 place count 24 transition count 29
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 411 place count 24 transition count 26
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 417 place count 21 transition count 26
Applied a total of 417 rules in 25 ms. Remains 21 /232 variables (removed 211) and now considering 26/272 (removed 246) transitions.
[2022-05-15 17:08:00] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
// Phase 1: matrix 25 rows 21 cols
[2022-05-15 17:08:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:08:00] [INFO ] Implicit Places using invariants in 24 ms returned []
[2022-05-15 17:08:00] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
// Phase 1: matrix 25 rows 21 cols
[2022-05-15 17:08:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:08:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 17:08:00] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-15 17:08:00] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 17:08:00] [INFO ] Flow matrix only has 25 transitions (discarded 1 similar events)
// Phase 1: matrix 25 rows 21 cols
[2022-05-15 17:08:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:08:00] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/232 places, 26/272 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/232 places, 26/272 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s9 1), p3:(EQ s1 1), p1:(AND (EQ s10 1) (EQ s20 1))], 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 32875 reset in 90 ms.
Stack based approach found an accepted trace after 7 steps with 2 reset with depth 4 and stack size 4 in 1 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-12 finished in 303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X(p0)))))'
Support contains 1 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 272/272 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 221 transition count 260
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 221 transition count 260
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 216 transition count 255
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 216 transition count 255
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 214 transition count 253
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 214 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 213 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 213 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 212 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 211 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 211 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 210 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 210 transition count 248
Applied a total of 44 rules in 22 ms. Remains 210 /232 variables (removed 22) and now considering 248/272 (removed 24) transitions.
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:08:00] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:08:00] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:08:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:08:00] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 248 rows 210 cols
[2022-05-15 17:08:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:08:00] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 210/232 places, 248/272 transitions.
Finished structural reductions, in 1 iterations. Remains : 210/232 places, 248/272 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-13 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:(EQ s177 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 660 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-13 finished in 462 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1 U X(p2))))'
Support contains 4 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 272/272 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 222 transition count 261
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 222 transition count 261
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 217 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 217 transition count 256
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 215 transition count 254
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 215 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 214 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 214 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 213 transition count 251
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 213 transition count 251
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 212 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 212 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 211 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 211 transition count 249
Applied a total of 42 rules in 27 ms. Remains 211 /232 variables (removed 21) and now considering 249/272 (removed 23) transitions.
// Phase 1: matrix 249 rows 211 cols
[2022-05-15 17:08:00] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:08:00] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 249 rows 211 cols
[2022-05-15 17:08:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:08:00] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 249 rows 211 cols
[2022-05-15 17:08:00] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:08:01] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 211/232 places, 249/272 transitions.
Finished structural reductions, in 1 iterations. Remains : 211/232 places, 249/272 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-13b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s116 1) (EQ s207 1)), p2:(EQ s179 1), p0:(AND (EQ s84 1) (EQ s207 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 0 ms.
FORMULA DiscoveryGPU-PT-13b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-13b-LTLFireability-14 finished in 558 ms.
All properties solved by simple procedures.
Total runtime 11444 ms.

BK_STOP 1652634481366

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

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