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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 6.3K Apr 30 06:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 06:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 06:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 30 06:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 9 07:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 46K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652628828774

Running Version 202205111006
[2022-05-15 15:33: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 15:33:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 15:33:50] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2022-05-15 15:33:50] [INFO ] Transformed 184 places.
[2022-05-15 15:33:50] [INFO ] Transformed 194 transitions.
[2022-05-15 15:33:50] [INFO ] Found NUPN structural information;
[2022-05-15 15:33:50] [INFO ] Parsed PT model containing 184 places and 194 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 172 transition count 194
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 37 place count 147 transition count 169
Iterating global reduction 1 with 25 rules applied. Total rules applied 62 place count 147 transition count 169
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 143 transition count 165
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 143 transition count 165
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 139 transition count 161
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 139 transition count 161
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 137 transition count 159
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 137 transition count 159
Applied a total of 82 rules in 58 ms. Remains 137 /184 variables (removed 47) and now considering 159/194 (removed 35) transitions.
// Phase 1: matrix 159 rows 137 cols
[2022-05-15 15:33:50] [INFO ] Computed 2 place invariants in 11 ms
[2022-05-15 15:33:50] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 159 rows 137 cols
[2022-05-15 15:33:50] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 15:33:50] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
// Phase 1: matrix 159 rows 137 cols
[2022-05-15 15:33:50] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-15 15:33:50] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/184 places, 159/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 137/184 places, 159/194 transitions.
Support contains 36 out of 137 places after structural reductions.
[2022-05-15 15:33:50] [INFO ] Flatten gal took : 36 ms
[2022-05-15 15:33:50] [INFO ] Flatten gal took : 13 ms
[2022-05-15 15:33:51] [INFO ] Input system was already deterministic with 159 transitions.
Incomplete random walk after 10000 steps, including 51 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 31) seen :30
Finished Best-First random walk after 628 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=314 )
FORMULA DiscoveryGPU-PT-06b-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DiscoveryGPU-PT-06b-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 25 stabilizing places and 25 stable transitions
Graph (complete) has 263 edges and 137 vertex of which 134 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 159/159 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 126 transition count 147
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 126 transition count 147
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 119 transition count 138
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 119 transition count 138
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 114 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 114 transition count 132
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 110 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 110 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 108 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 107 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 106 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 106 transition count 123
Applied a total of 62 rules in 21 ms. Remains 106 /137 variables (removed 31) and now considering 123/159 (removed 36) transitions.
// Phase 1: matrix 123 rows 106 cols
[2022-05-15 15:33:51] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:33:51] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 123 rows 106 cols
[2022-05-15 15:33:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:51] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 106 cols
[2022-05-15 15:33:51] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 15:33:51] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/137 places, 123/159 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/137 places, 123/159 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1666 reset in 372 ms.
Stack based approach found an accepted trace after 129 steps with 2 reset with depth 34 and stack size 34 in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-00 finished in 828 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||p1))))'
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 159/159 transitions.
Graph (complete) has 263 edges and 137 vertex of which 134 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 134 transition count 132
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 110 transition count 132
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 49 place count 110 transition count 116
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 81 place count 94 transition count 116
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 88 place count 87 transition count 108
Iterating global reduction 2 with 7 rules applied. Total rules applied 95 place count 87 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 95 place count 87 transition count 107
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 97 place count 86 transition count 107
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 101 place count 82 transition count 102
Iterating global reduction 2 with 4 rules applied. Total rules applied 105 place count 82 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 79 transition count 98
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 79 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 77 transition count 95
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 77 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 76 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 76 transition count 94
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 179 place count 45 transition count 63
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 184 place count 40 transition count 53
Iterating global reduction 2 with 5 rules applied. Total rules applied 189 place count 40 transition count 53
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 194 place count 35 transition count 47
Iterating global reduction 2 with 5 rules applied. Total rules applied 199 place count 35 transition count 47
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 204 place count 30 transition count 38
Iterating global reduction 2 with 5 rules applied. Total rules applied 209 place count 30 transition count 38
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 214 place count 25 transition count 32
Iterating global reduction 2 with 5 rules applied. Total rules applied 219 place count 25 transition count 32
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 224 place count 20 transition count 23
Iterating global reduction 2 with 5 rules applied. Total rules applied 229 place count 20 transition count 23
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 233 place count 16 transition count 18
Iterating global reduction 2 with 4 rules applied. Total rules applied 237 place count 16 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 238 place count 15 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 239 place count 15 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 240 place count 15 transition count 16
Applied a total of 240 rules in 35 ms. Remains 15 /137 variables (removed 122) and now considering 16/159 (removed 143) transitions.
[2022-05-15 15:33:52] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 15:33:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:52] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-15 15:33:52] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 15:33:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 15:33:52] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-15 15:33:52] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 15:33:52] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 15:33:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:52] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/137 places, 16/159 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/137 places, 16/159 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s13 1)), p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2408 reset in 234 ms.
Product exploration explored 100000 steps with 2297 reset in 195 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Detected a total of 13/15 stabilizing places and 13/16 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 343 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 113 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 15:33:53] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 15:33:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:53] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 15:33:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-05-15 15:33:53] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 268 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2022-05-15 15:33:54] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 15:33:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:54] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 15:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 15:33:54] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-15 15:33:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 15:33:54] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2022-05-15 15:33:54] [INFO ] Computed and/alt/rep : 14/29/13 causal constraints (skipped 1 transitions) in 1 ms.
[2022-05-15 15:33:54] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 15 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 : 15/15 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2022-05-15 15:33:54] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 15:33:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:54] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-05-15 15:33:54] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 15:33:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 15:33:54] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-15 15:33:54] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:33:54] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 15:33:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:54] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 16/16 transitions.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Detected a total of 13/15 stabilizing places and 13/16 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 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 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 150 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2022-05-15 15:33:54] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 15 cols
[2022-05-15 15:33:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:54] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-15 15:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 15:33:54] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-15 15:33:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 15:33:54] [INFO ] [Real]Added 4 Read/Feed constraints in 3 ms returned sat
[2022-05-15 15:33:54] [INFO ] Computed and/alt/rep : 14/29/13 causal constraints (skipped 1 transitions) in 1 ms.
[2022-05-15 15:33:54] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2215 reset in 172 ms.
Product exploration explored 100000 steps with 2173 reset in 122 ms.
Built C files in :
/tmp/ltsmin2405670546631864834
[2022-05-15 15:33:55] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2022-05-15 15:33:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:33:55] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2022-05-15 15:33:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:33:55] [INFO ] Computing Do-Not-Accords matrix : 16 transitions.
[2022-05-15 15:33:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 15:33:55] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2405670546631864834
Running compilation step : cd /tmp/ltsmin2405670546631864834;'/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 556 ms.
Running link step : cd /tmp/ltsmin2405670546631864834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 112 ms.
Running LTSmin : cd /tmp/ltsmin2405670546631864834;'/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/stateBased14057287153779739989.hoa' '--buchi-type=spotba'
LTSmin run took 176 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-01 finished in 3730 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U (G(X(F(p1)))||p2))))'
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 159/159 transitions.
Graph (complete) has 263 edges and 137 vertex of which 134 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 133 transition count 133
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 111 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 110 transition count 132
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 47 place count 110 transition count 116
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 79 place count 94 transition count 116
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 86 place count 87 transition count 108
Iterating global reduction 3 with 7 rules applied. Total rules applied 93 place count 87 transition count 108
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 93 place count 87 transition count 106
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 97 place count 85 transition count 106
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 101 place count 81 transition count 101
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 81 transition count 101
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 78 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 78 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 77 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 77 transition count 96
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 167 place count 50 transition count 69
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 171 place count 46 transition count 61
Iterating global reduction 3 with 4 rules applied. Total rules applied 175 place count 46 transition count 61
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 179 place count 42 transition count 56
Iterating global reduction 3 with 4 rules applied. Total rules applied 183 place count 42 transition count 56
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 39 transition count 51
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 39 transition count 51
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 36 transition count 47
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 36 transition count 47
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 198 place count 33 transition count 42
Iterating global reduction 3 with 3 rules applied. Total rules applied 201 place count 33 transition count 42
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 204 place count 30 transition count 38
Iterating global reduction 3 with 3 rules applied. Total rules applied 207 place count 30 transition count 38
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 208 place count 29 transition count 37
Iterating global reduction 3 with 1 rules applied. Total rules applied 209 place count 29 transition count 37
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 210 place count 29 transition count 36
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 212 place count 29 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 214 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 30 edges and 25 vertex of which 22 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 221 place count 22 transition count 27
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 225 place count 18 transition count 27
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 235 place count 13 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 236 place count 13 transition count 21
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 239 place count 10 transition count 18
Applied a total of 239 rules in 39 ms. Remains 10 /137 variables (removed 127) and now considering 18/159 (removed 141) transitions.
[2022-05-15 15:33:56] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 10 cols
[2022-05-15 15:33:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:33:56] [INFO ] Implicit Places using invariants in 19 ms returned []
[2022-05-15 15:33:56] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 10 cols
[2022-05-15 15:33:56] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-15 15:33:56] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-15 15:33:56] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 15:33:56] [INFO ] Flow matrix only has 15 transitions (discarded 3 similar events)
// Phase 1: matrix 15 rows 10 cols
[2022-05-15 15:33:56] [INFO ] Computed 0 place invariants in 12 ms
[2022-05-15 15:33:56] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/137 places, 18/159 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/137 places, 18/159 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s8 1), p1:(EQ s4 1), p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-02 finished in 354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 159/159 transitions.
Graph (complete) has 263 edges and 137 vertex of which 134 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 133 transition count 132
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 110 transition count 132
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 47 place count 110 transition count 115
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 81 place count 93 transition count 115
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 87 place count 87 transition count 108
Iterating global reduction 2 with 6 rules applied. Total rules applied 93 place count 87 transition count 108
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 96 place count 84 transition count 105
Iterating global reduction 2 with 3 rules applied. Total rules applied 99 place count 84 transition count 105
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 82 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 82 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 80 transition count 99
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 80 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 79 transition count 98
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 79 transition count 98
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 167 place count 50 transition count 69
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 171 place count 46 transition count 61
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 46 transition count 61
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 179 place count 42 transition count 56
Iterating global reduction 2 with 4 rules applied. Total rules applied 183 place count 42 transition count 56
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 187 place count 38 transition count 49
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 38 transition count 49
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 195 place count 34 transition count 44
Iterating global reduction 2 with 4 rules applied. Total rules applied 199 place count 34 transition count 44
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 202 place count 31 transition count 39
Iterating global reduction 2 with 3 rules applied. Total rules applied 205 place count 31 transition count 39
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 208 place count 28 transition count 35
Iterating global reduction 2 with 3 rules applied. Total rules applied 211 place count 28 transition count 35
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 212 place count 27 transition count 34
Iterating global reduction 2 with 1 rules applied. Total rules applied 213 place count 27 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 214 place count 27 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 216 place count 25 transition count 32
Applied a total of 216 rules in 34 ms. Remains 25 /137 variables (removed 112) and now considering 32/159 (removed 127) transitions.
[2022-05-15 15:33:56] [INFO ] Flow matrix only has 29 transitions (discarded 3 similar events)
// Phase 1: matrix 29 rows 25 cols
[2022-05-15 15:33:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:56] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-15 15:33:56] [INFO ] Flow matrix only has 29 transitions (discarded 3 similar events)
// Phase 1: matrix 29 rows 25 cols
[2022-05-15 15:33:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 15:33:56] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-15 15:33:56] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 15:33:56] [INFO ] Flow matrix only has 29 transitions (discarded 3 similar events)
// Phase 1: matrix 29 rows 25 cols
[2022-05-15 15:33:56] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:56] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/137 places, 32/159 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/137 places, 32/159 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s22 0)), p1:(AND (EQ s4 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 103 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-03 finished in 236 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((F(F(G(p0)))&&X(p1)))))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 159/159 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 126 transition count 147
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 126 transition count 147
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 119 transition count 138
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 119 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 115 transition count 134
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 115 transition count 134
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 112 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 112 transition count 131
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 111 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 111 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 110 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 110 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 109 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 109 transition count 127
Applied a total of 56 rules in 20 ms. Remains 109 /137 variables (removed 28) and now considering 127/159 (removed 32) transitions.
// Phase 1: matrix 127 rows 109 cols
[2022-05-15 15:33:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:56] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 127 rows 109 cols
[2022-05-15 15:33:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:56] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 109 cols
[2022-05-15 15:33:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:56] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/137 places, 127/159 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/137 places, 127/159 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s104 0), p0:(EQ s30 1)], 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 193 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-04 finished in 358 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (G(p2) U X(p3))))'
Support contains 6 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 159/159 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 125 transition count 146
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 125 transition count 146
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 118 transition count 137
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 118 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 114 transition count 132
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 114 transition count 132
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 110 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 110 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 109 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 109 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 108 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 108 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 107 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 107 transition count 124
Applied a total of 60 rules in 13 ms. Remains 107 /137 variables (removed 30) and now considering 124/159 (removed 35) transitions.
// Phase 1: matrix 124 rows 107 cols
[2022-05-15 15:33:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:57] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 124 rows 107 cols
[2022-05-15 15:33:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:57] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 107 cols
[2022-05-15 15:33:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:57] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/137 places, 124/159 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/137 places, 124/159 transitions.
Stuttering acceptance computed with spot in 468 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p3), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=5 dest: 8}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=9 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (EQ s17 1) (EQ s103 1)), p1:(EQ s30 1), p0:(OR (EQ s45 1) (EQ s87 1)), p3:(OR (EQ s30 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, 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-06b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-05 finished in 689 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||p1))))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 159/159 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 126 transition count 147
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 126 transition count 147
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 120 transition count 140
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 120 transition count 140
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 116 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 116 transition count 135
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 113 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 113 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 111 transition count 129
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 111 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 110 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 110 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 109 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 109 transition count 127
Applied a total of 56 rules in 17 ms. Remains 109 /137 variables (removed 28) and now considering 127/159 (removed 32) transitions.
// Phase 1: matrix 127 rows 109 cols
[2022-05-15 15:33:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:57] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 127 rows 109 cols
[2022-05-15 15:33:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:57] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 109 cols
[2022-05-15 15:33:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:58] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/137 places, 127/159 transitions.
Finished structural reductions, in 1 iterations. Remains : 109/137 places, 127/159 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s44 1) (EQ s24 1)), p0:(AND (EQ s36 1) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 196 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-08 finished in 296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(X(p0)))&&G(F(p0)))))'
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 159/159 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 125 transition count 146
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 125 transition count 146
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 118 transition count 137
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 118 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 113 transition count 131
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 113 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 109 transition count 127
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 109 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 107 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 106 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 105 transition count 122
Applied a total of 64 rules in 11 ms. Remains 105 /137 variables (removed 32) and now considering 122/159 (removed 37) transitions.
// Phase 1: matrix 122 rows 105 cols
[2022-05-15 15:33:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:58] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 122 rows 105 cols
[2022-05-15 15:33:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:58] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 105 cols
[2022-05-15 15:33:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:58] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/137 places, 122/159 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/137 places, 122/159 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-09 finished in 321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(X(p0)))||p1)))'
Support contains 3 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 159/159 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 125 transition count 146
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 125 transition count 146
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 118 transition count 137
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 118 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 113 transition count 131
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 113 transition count 131
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 109 transition count 127
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 109 transition count 127
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 107 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 106 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 106 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 105 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 105 transition count 122
Applied a total of 64 rules in 14 ms. Remains 105 /137 variables (removed 32) and now considering 122/159 (removed 37) transitions.
// Phase 1: matrix 122 rows 105 cols
[2022-05-15 15:33:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:58] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 122 rows 105 cols
[2022-05-15 15:33:58] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 15:33:58] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 122 rows 105 cols
[2022-05-15 15:33:58] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:58] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/137 places, 122/159 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/137 places, 122/159 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s66 1), p0:(OR (EQ s54 0) (EQ s101 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-10 finished in 334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 159/159 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 126 transition count 147
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 126 transition count 147
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 120 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 120 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 115 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 115 transition count 133
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 111 transition count 129
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 111 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 109 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 109 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 108 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 108 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 107 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 107 transition count 124
Applied a total of 60 rules in 11 ms. Remains 107 /137 variables (removed 30) and now considering 124/159 (removed 35) transitions.
// Phase 1: matrix 124 rows 107 cols
[2022-05-15 15:33:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:58] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 124 rows 107 cols
[2022-05-15 15:33:58] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 15:33:58] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 107 cols
[2022-05-15 15:33:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:58] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/137 places, 124/159 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/137 places, 124/159 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s106 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 12307 reset in 96 ms.
Stack based approach found an accepted trace after 17366 steps with 2134 reset with depth 16 and stack size 16 in 19 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-11 finished in 378 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!F(p0) U (X((F(p1)||p2))&&p1)))))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 159/159 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 126 transition count 147
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 126 transition count 147
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 119 transition count 138
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 119 transition count 138
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 114 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 114 transition count 132
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 110 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 110 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 108 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 107 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 106 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 106 transition count 123
Applied a total of 62 rules in 10 ms. Remains 106 /137 variables (removed 31) and now considering 123/159 (removed 36) transitions.
// Phase 1: matrix 123 rows 106 cols
[2022-05-15 15:33:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:59] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 123 rows 106 cols
[2022-05-15 15:33:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 15:33:59] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 106 cols
[2022-05-15 15:33:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:59] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/137 places, 123/159 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/137 places, 123/159 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0, (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}, { cond=p1, acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s48 1), p0:(EQ s98 1), p2:(AND (EQ s6 1) (EQ s70 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, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-12 finished in 412 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))||F(p1)))'
Support contains 2 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 159/159 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 126 transition count 147
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 126 transition count 147
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 29 place count 119 transition count 138
Iterating global reduction 0 with 7 rules applied. Total rules applied 36 place count 119 transition count 138
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 114 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 114 transition count 132
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 110 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 110 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 108 transition count 125
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 108 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 107 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 106 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 106 transition count 123
Applied a total of 62 rules in 10 ms. Remains 106 /137 variables (removed 31) and now considering 123/159 (removed 36) transitions.
// Phase 1: matrix 123 rows 106 cols
[2022-05-15 15:33:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:59] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 123 rows 106 cols
[2022-05-15 15:33:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:59] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 123 rows 106 cols
[2022-05-15 15:33:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 15:33:59] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/137 places, 123/159 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/137 places, 123/159 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s62 1), p0:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 647 steps with 3 reset in 2 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-13 finished in 422 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p1)||p0)))'
Support contains 4 out of 137 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 137/137 places, 159/159 transitions.
Graph (complete) has 263 edges and 137 vertex of which 134 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 133 transition count 132
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 110 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 109 transition count 131
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 49 place count 109 transition count 114
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 83 place count 92 transition count 114
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 89 place count 86 transition count 107
Iterating global reduction 3 with 6 rules applied. Total rules applied 95 place count 86 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 95 place count 86 transition count 106
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 85 transition count 106
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 82 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 82 transition count 102
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 80 transition count 100
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 80 transition count 100
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 108 place count 79 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 79 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 78 transition count 97
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 78 transition count 97
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 169 place count 49 transition count 68
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 173 place count 45 transition count 60
Iterating global reduction 3 with 4 rules applied. Total rules applied 177 place count 45 transition count 60
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 181 place count 41 transition count 55
Iterating global reduction 3 with 4 rules applied. Total rules applied 185 place count 41 transition count 55
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 188 place count 38 transition count 50
Iterating global reduction 3 with 3 rules applied. Total rules applied 191 place count 38 transition count 50
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 194 place count 35 transition count 46
Iterating global reduction 3 with 3 rules applied. Total rules applied 197 place count 35 transition count 46
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 200 place count 32 transition count 41
Iterating global reduction 3 with 3 rules applied. Total rules applied 203 place count 32 transition count 41
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 206 place count 29 transition count 37
Iterating global reduction 3 with 3 rules applied. Total rules applied 209 place count 29 transition count 37
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 210 place count 28 transition count 36
Iterating global reduction 3 with 1 rules applied. Total rules applied 211 place count 28 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 212 place count 28 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 214 place count 26 transition count 33
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 3 with 2 rules applied. Total rules applied 216 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 217 place count 24 transition count 32
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 217 place count 24 transition count 30
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 221 place count 22 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 225 place count 20 transition count 28
Applied a total of 225 rules in 24 ms. Remains 20 /137 variables (removed 117) and now considering 28/159 (removed 131) transitions.
[2022-05-15 15:33:59] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 20 cols
[2022-05-15 15:33:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:34:00] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-15 15:34:00] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 20 cols
[2022-05-15 15:34:00] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 15:34:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-15 15:34:00] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-15 15:34:00] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 15:34:00] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 20 cols
[2022-05-15 15:34:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 15:34:00] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/137 places, 28/159 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/137 places, 28/159 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s12 1) (AND (EQ s15 1) (EQ s19 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 85 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06b-LTLFireability-14 finished in 204 ms.
All properties solved by simple procedures.
Total runtime 10230 ms.

BK_STOP 1652628840230

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-06b"
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-06b, 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-165260109700012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06b.tgz
mv DiscoveryGPU-PT-06b execution
cd execution
if [ "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 ;