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

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

=== Now, execution of the tool begins

BK_START 1652630697774

Running Version 202205111006
[2022-05-15 16:04:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 16:04:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 16:04:59] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2022-05-15 16:04:59] [INFO ] Transformed 103 places.
[2022-05-15 16:04:59] [INFO ] Transformed 141 transitions.
[2022-05-15 16:04:59] [INFO ] Found NUPN structural information;
[2022-05-15 16:04:59] [INFO ] Parsed PT model containing 103 places and 141 transitions in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 135
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 135
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 91 transition count 129
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 91 transition count 129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 87 transition count 121
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 87 transition count 121
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 87 transition count 115
Applied a total of 38 rules in 23 ms. Remains 87 /103 variables (removed 16) and now considering 115/141 (removed 26) transitions.
// Phase 1: matrix 115 rows 87 cols
[2022-05-15 16:04:59] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-15 16:04:59] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 115 rows 87 cols
[2022-05-15 16:04:59] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 16:04:59] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-05-15 16:04:59] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
// Phase 1: matrix 115 rows 87 cols
[2022-05-15 16:04:59] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 16:04:59] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/103 places, 115/141 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/103 places, 115/141 transitions.
Support contains 25 out of 87 places after structural reductions.
[2022-05-15 16:04:59] [INFO ] Flatten gal took : 31 ms
[2022-05-15 16:04:59] [INFO ] Flatten gal took : 12 ms
[2022-05-15 16:04:59] [INFO ] Input system was already deterministic with 115 transitions.
Finished random walk after 313 steps, including 2 resets, run visited all 23 properties in 64 ms. (steps per millisecond=4 )
FORMULA DiscoveryGPU-PT-10a-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 13 stabilizing places and 11 stable transitions
Graph (complete) has 258 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 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 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 115/115 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 82 transition count 110
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 82 transition count 110
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 79 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 79 transition count 107
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 76 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 76 transition count 104
Applied a total of 22 rules in 13 ms. Remains 76 /87 variables (removed 11) and now considering 104/115 (removed 11) transitions.
// Phase 1: matrix 104 rows 76 cols
[2022-05-15 16:05:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:00] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 104 rows 76 cols
[2022-05-15 16:05:00] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:00] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-15 16:05:00] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 310 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/87 places, 104/115 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 75/87 places, 104/115 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-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 s60 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]]
Stuttering criterion allowed to conclude after 186 steps with 1 reset in 3 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-00 finished in 602 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 115/115 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 111
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 111
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 81 transition count 109
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 81 transition count 109
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 79 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 79 transition count 107
Applied a total of 16 rules in 8 ms. Remains 79 /87 variables (removed 8) and now considering 107/115 (removed 8) transitions.
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:05:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:00] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:05:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 16:05:01] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 206 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/87 places, 107/115 transitions.
Applied a total of 0 rules in 9 ms. Remains 78 /78 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 78/87 places, 107/115 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s67 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-01 finished in 323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!F(p0) U p1)&&X(G(p1)))))'
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 115/115 transitions.
Graph (complete) has 258 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 83 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 79 transition count 107
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 74 transition count 102
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 74 transition count 102
Applied a total of 19 rules in 21 ms. Remains 74 /87 variables (removed 13) and now considering 102/115 (removed 13) transitions.
// Phase 1: matrix 102 rows 74 cols
[2022-05-15 16:05:01] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:01] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 102 rows 74 cols
[2022-05-15 16:05:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:01] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-15 16:05:01] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 156 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/87 places, 102/115 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 7 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 55 transition count 84
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 44 place count 47 transition count 68
Iterating global reduction 0 with 8 rules applied. Total rules applied 52 place count 47 transition count 68
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 39 transition count 52
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 39 transition count 52
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 31 transition count 44
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 31 transition count 44
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 24 transition count 30
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 24 transition count 30
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 17 transition count 23
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 17 transition count 23
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 17 transition count 23
Applied a total of 114 rules in 42 ms. Remains 17 /73 variables (removed 56) and now considering 23/102 (removed 79) transitions.
[2022-05-15 16:05:01] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 17 cols
[2022-05-15 16:05:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:05:01] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-05-15 16:05:01] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 17 cols
[2022-05-15 16:05:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:05:01] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-15 16:05:01] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/87 places, 23/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 17/87 places, 23/115 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 1}, { cond=(OR p1 (NOT p0)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s16 1)), p0:(AND (EQ s11 1) (EQ s16 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 79 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-02 finished in 617 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 115/115 transitions.
Graph (complete) has 258 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 83 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 79 transition count 107
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 74 transition count 102
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 74 transition count 102
Applied a total of 19 rules in 18 ms. Remains 74 /87 variables (removed 13) and now considering 102/115 (removed 13) transitions.
// Phase 1: matrix 102 rows 74 cols
[2022-05-15 16:05:01] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:01] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 102 rows 74 cols
[2022-05-15 16:05:01] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:01] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-15 16:05:01] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 211 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/87 places, 102/115 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 53 transition count 82
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 49 place count 44 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 58 place count 44 transition count 64
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 35 transition count 46
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 35 transition count 46
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 85 place count 26 transition count 37
Iterating global reduction 0 with 9 rules applied. Total rules applied 94 place count 26 transition count 37
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 103 place count 17 transition count 19
Iterating global reduction 0 with 9 rules applied. Total rules applied 112 place count 17 transition count 19
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 120 place count 9 transition count 11
Iterating global reduction 0 with 8 rules applied. Total rules applied 128 place count 9 transition count 11
Applied a total of 128 rules in 7 ms. Remains 9 /73 variables (removed 64) and now considering 11/102 (removed 91) transitions.
[2022-05-15 16:05:02] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2022-05-15 16:05:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:05:02] [INFO ] Implicit Places using invariants in 48 ms returned []
[2022-05-15 16:05:02] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2022-05-15 16:05:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:05:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-15 16:05:02] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/87 places, 11/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 9/87 places, 11/115 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-04 finished in 379 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&F(G(X(p1))))))'
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 115/115 transitions.
Graph (complete) has 258 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 83 transition count 108
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 80 transition count 108
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 11 place count 76 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 15 place count 76 transition count 104
Applied a total of 15 rules in 13 ms. Remains 76 /87 variables (removed 11) and now considering 104/115 (removed 11) transitions.
// Phase 1: matrix 104 rows 76 cols
[2022-05-15 16:05:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:02] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 104 rows 76 cols
[2022-05-15 16:05:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:02] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 16:05:02] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 246 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/87 places, 104/115 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 55 transition count 84
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 47 transition count 68
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 47 transition count 68
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 40 transition count 54
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 40 transition count 54
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 33 transition count 47
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 33 transition count 47
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 26 transition count 33
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 26 transition count 33
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 19 transition count 26
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 19 transition count 26
Applied a total of 112 rules in 72 ms. Remains 19 /75 variables (removed 56) and now considering 26/104 (removed 78) transitions.
[2022-05-15 16:05:02] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-15 16:05:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:05:02] [INFO ] Implicit Places using invariants in 143 ms returned []
[2022-05-15 16:05:02] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 19 cols
[2022-05-15 16:05:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 16:05:02] [INFO ] State equation strengthened by 17 read => feed constraints.
[2022-05-15 16:05:02] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/87 places, 26/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/87 places, 26/115 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s18 0)), p1:(OR (EQ s14 0) (EQ s18 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-05 finished in 650 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&X(p1)&&X(G((p0 U !G(p0))))))'
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 115/115 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 82 transition count 110
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 82 transition count 110
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 79 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 79 transition count 107
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 76 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 76 transition count 104
Applied a total of 22 rules in 3 ms. Remains 76 /87 variables (removed 11) and now considering 104/115 (removed 11) transitions.
// Phase 1: matrix 104 rows 76 cols
[2022-05-15 16:05:02] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:03] [INFO ] Implicit Places using invariants in 403 ms returned []
// Phase 1: matrix 104 rows 76 cols
[2022-05-15 16:05:03] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 16:05:03] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-15 16:05:03] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 540 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/87 places, 104/115 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 75/87 places, 104/115 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, true, true, p0, p0]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s18 1), p1:(AND (EQ s33 1) (EQ s74 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][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-10a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-06 finished in 744 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(G(p2)))))'
Support contains 6 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 115/115 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 111
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 80 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 80 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 77 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 77 transition count 105
Applied a total of 20 rules in 5 ms. Remains 77 /87 variables (removed 10) and now considering 105/115 (removed 10) transitions.
// Phase 1: matrix 105 rows 77 cols
[2022-05-15 16:05:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:03] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 105 rows 77 cols
[2022-05-15 16:05:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:03] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-15 16:05:03] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 77 cols
[2022-05-15 16:05:03] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:03] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 77/87 places, 105/115 transitions.
Finished structural reductions, in 1 iterations. Remains : 77/87 places, 105/115 transitions.
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (EQ s73 1) (EQ s75 1)), p0:(AND (EQ s11 1) (EQ s76 1)), p2:(AND (OR (EQ s29 0) (EQ s75 0)) (EQ s28 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-08 finished in 566 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((X((G(p1)||p0))&&p1)))))'
Support contains 2 out of 87 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 115/115 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 82 transition count 110
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 82 transition count 110
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 79 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 79 transition count 107
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 76 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 76 transition count 104
Applied a total of 22 rules in 2 ms. Remains 76 /87 variables (removed 11) and now considering 104/115 (removed 11) transitions.
// Phase 1: matrix 104 rows 76 cols
[2022-05-15 16:05:04] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:04] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 104 rows 76 cols
[2022-05-15 16:05:04] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:04] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-15 16:05:04] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 116 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/87 places, 104/115 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 75/87 places, 104/115 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s10 0) (EQ s74 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-10 finished in 221 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 115/115 transitions.
Graph (complete) has 258 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 83 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 79 transition count 107
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 74 transition count 102
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 74 transition count 102
Applied a total of 19 rules in 8 ms. Remains 74 /87 variables (removed 13) and now considering 102/115 (removed 13) transitions.
// Phase 1: matrix 102 rows 74 cols
[2022-05-15 16:05:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:04] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 102 rows 74 cols
[2022-05-15 16:05:04] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:04] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-15 16:05:04] [INFO ] Implicit Places using invariants and state equation in 161 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 224 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/87 places, 102/115 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 54 transition count 83
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 47 place count 45 transition count 65
Iterating global reduction 0 with 9 rules applied. Total rules applied 56 place count 45 transition count 65
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 36 transition count 47
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 36 transition count 47
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 27 transition count 38
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 27 transition count 38
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 100 place count 19 transition count 22
Iterating global reduction 0 with 8 rules applied. Total rules applied 108 place count 19 transition count 22
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 116 place count 11 transition count 14
Iterating global reduction 0 with 8 rules applied. Total rules applied 124 place count 11 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 125 place count 11 transition count 14
Applied a total of 125 rules in 6 ms. Remains 11 /73 variables (removed 62) and now considering 14/102 (removed 88) transitions.
[2022-05-15 16:05:04] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2022-05-15 16:05:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:05:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2022-05-15 16:05:04] [INFO ] Flow matrix only has 13 transitions (discarded 1 similar events)
// Phase 1: matrix 13 rows 11 cols
[2022-05-15 16:05:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:05:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-15 16:05:04] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/87 places, 14/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/87 places, 14/115 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 3 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-11 finished in 332 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||X(p1))))'
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 115/115 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 111
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 111
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 81 transition count 109
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 81 transition count 109
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 79 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 79 transition count 107
Applied a total of 16 rules in 3 ms. Remains 79 /87 variables (removed 8) and now considering 107/115 (removed 8) transitions.
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:05:04] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:04] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 107 rows 79 cols
[2022-05-15 16:05:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:04] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-05-15 16:05:04] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 255 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/87 places, 107/115 transitions.
Applied a total of 0 rules in 0 ms. Remains 78 /78 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 78/87 places, 107/115 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (EQ s16 0) (EQ s77 0)), p1:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-13 finished in 395 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (p2 U (G(p3)&&X(G(!p0))))))'
Support contains 5 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 115/115 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 83 transition count 111
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 83 transition count 111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 80 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 80 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 77 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 77 transition count 105
Applied a total of 20 rules in 3 ms. Remains 77 /87 variables (removed 10) and now considering 105/115 (removed 10) transitions.
// Phase 1: matrix 105 rows 77 cols
[2022-05-15 16:05:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:05] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 105 rows 77 cols
[2022-05-15 16:05:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 16:05:05] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-15 16:05:05] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 77 cols
[2022-05-15 16:05:05] [INFO ] Computed 2 place invariants in 5 ms
[2022-05-15 16:05:05] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 77/87 places, 105/115 transitions.
Finished structural reductions, in 1 iterations. Remains : 77/87 places, 105/115 transitions.
Stuttering acceptance computed with spot in 587 ms :[(OR (NOT p3) p0), true, (NOT p1), (NOT p3), p0, (OR (NOT p3) p0), (AND (NOT p1) p2 (NOT p3)), (NOT p3), (AND p0 (NOT p1) p3), p0, (NOT p3), p0]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 6}, { cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={1} source=0 dest: 7}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 8}, { cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={0, 1} source=0 dest: 9}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 10}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 11}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p3 p2), acceptance={1} source=5 dest: 10}, { cond=(AND p3 p2), acceptance={0, 1} source=5 dest: 11}], [{ cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=6 dest: 2}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p3 p2 (NOT p1) p0), acceptance={} source=6 dest: 6}], [{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 6}, { cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={1} source=7 dest: 7}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 10}], [{ cond=(AND p3 (NOT p1) p0), acceptance={} source=8 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=8 dest: 4}], [{ cond=(AND (NOT p3) p0), acceptance={0, 1} source=9 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=9 dest: 6}, { cond=(AND p3 p0), acceptance={1} source=9 dest: 7}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=9 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={0} source=9 dest: 9}, { cond=(AND p3 p0), acceptance={0, 1} source=9 dest: 9}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=10 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=10 dest: 5}, { cond=(AND p3 p2), acceptance={1} source=10 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=11 dest: 1}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=11 dest: 3}, { cond=(OR (AND p3 (NOT p2)) (AND (NOT p2) (NOT p0))), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p3) p2 p0), acceptance={0, 1} source=11 dest: 5}, { cond=(AND p3 p2 p0), acceptance={1} source=11 dest: 10}, { cond=(AND p2 (NOT p0)), acceptance={0} source=11 dest: 11}, { cond=(AND p3 p2 p0), acceptance={0, 1} source=11 dest: 11}]], initial=0, aps=[p3:(AND (EQ s65 1) (EQ s76 1)), p1:(AND (EQ s18 1) (EQ s76 1)), p0:(NEQ s70 1), p2:(AND (EQ s54 1) (EQ s76 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 45 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-14 finished in 933 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 115/115 transitions.
Graph (complete) has 258 edges and 87 vertex of which 83 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 83 transition count 107
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 79 transition count 107
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 14 place count 74 transition count 102
Iterating global reduction 0 with 5 rules applied. Total rules applied 19 place count 74 transition count 102
Applied a total of 19 rules in 16 ms. Remains 74 /87 variables (removed 13) and now considering 102/115 (removed 13) transitions.
// Phase 1: matrix 102 rows 74 cols
[2022-05-15 16:05:06] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 16:05:06] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 102 rows 74 cols
[2022-05-15 16:05:06] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-15 16:05:06] [INFO ] State equation strengthened by 71 read => feed constraints.
[2022-05-15 16:05:06] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 268 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/87 places, 102/115 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 54 transition count 83
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 46 transition count 67
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 46 transition count 67
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 38 transition count 51
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 38 transition count 51
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 30 transition count 43
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 30 transition count 43
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 22 transition count 27
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 22 transition count 27
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 110 place count 14 transition count 19
Iterating global reduction 0 with 8 rules applied. Total rules applied 118 place count 14 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 119 place count 14 transition count 19
Applied a total of 119 rules in 7 ms. Remains 14 /73 variables (removed 59) and now considering 19/102 (removed 83) transitions.
[2022-05-15 16:05:06] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 16:05:06] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:05:06] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-15 16:05:06] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2022-05-15 16:05:06] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 16:05:06] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 16:05:06] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/87 places, 19/115 transitions.
Finished structural reductions, in 2 iterations. Remains : 14/87 places, 19/115 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-LTLFireability-15 finished in 406 ms.
All properties solved by simple procedures.
Total runtime 7494 ms.

BK_STOP 1652630706441

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DiscoveryGPU-PT-10a"
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-10a, 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-165260109800068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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