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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 7.3K Apr 30 07:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 07:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 07:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 07:14 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.7K May 9 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 50K 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-14a-LTLFireability-00
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-01
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-02
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-03
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-04
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-05
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-06
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-07
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-08
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-09
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-10
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-11
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-12
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-13
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-14
FORMULA_NAME DiscoveryGPU-PT-14a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652635428711

Running Version 202205111006
[2022-05-15 17:23:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 17:23:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 17:23:50] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2022-05-15 17:23:50] [INFO ] Transformed 143 places.
[2022-05-15 17:23:50] [INFO ] Transformed 197 transitions.
[2022-05-15 17:23:50] [INFO ] Found NUPN structural information;
[2022-05-15 17:23:50] [INFO ] Parsed PT model containing 143 places and 197 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-14a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 197/197 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 132 transition count 186
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 132 transition count 186
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 122 transition count 176
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 122 transition count 176
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 113 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 113 transition count 158
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 65 place count 113 transition count 153
Applied a total of 65 rules in 39 ms. Remains 113 /143 variables (removed 30) and now considering 153/197 (removed 44) transitions.
// Phase 1: matrix 153 rows 113 cols
[2022-05-15 17:23:50] [INFO ] Computed 2 place invariants in 14 ms
[2022-05-15 17:23:50] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 153 rows 113 cols
[2022-05-15 17:23:50] [INFO ] Computed 2 place invariants in 8 ms
[2022-05-15 17:23:50] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-15 17:23:50] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
// Phase 1: matrix 153 rows 113 cols
[2022-05-15 17:23:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:23:50] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/143 places, 153/197 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/143 places, 153/197 transitions.
Support contains 26 out of 113 places after structural reductions.
[2022-05-15 17:23:50] [INFO ] Flatten gal took : 33 ms
[2022-05-15 17:23:50] [INFO ] Flatten gal took : 14 ms
[2022-05-15 17:23:50] [INFO ] Input system was already deterministic with 153 transitions.
Finished random walk after 7743 steps, including 50 resets, run visited all 25 properties in 123 ms. (steps per millisecond=62 )
Computed a total of 17 stabilizing places and 15 stable transitions
Graph (complete) has 347 edges and 113 vertex of which 110 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.11 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&!(G(!p1) U F(X(X(p2))))))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 153/153 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 106 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 106 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 104 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 104 transition count 144
Applied a total of 18 rules in 14 ms. Remains 104 /113 variables (removed 9) and now considering 144/153 (removed 9) transitions.
// Phase 1: matrix 144 rows 104 cols
[2022-05-15 17:23:51] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:23:51] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 144 rows 104 cols
[2022-05-15 17:23:51] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:23:51] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-05-15 17:23:51] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 104 cols
[2022-05-15 17:23:51] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:23:51] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 104/113 places, 144/153 transitions.
Finished structural reductions, in 1 iterations. Remains : 104/113 places, 144/153 transitions.
Stuttering acceptance computed with spot in 282 ms :[p2, (OR (NOT p0) p2), (OR (NOT p0) p2), true, (OR (NOT p0) p2)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(AND (EQ s46 1) (EQ s103 1) (EQ s45 1) (EQ s102 1)), p0:(OR (EQ s35 0) (EQ s102 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Entered a terminal (fully accepting) state of product in 19100 steps with 128 reset in 116 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-01 finished in 709 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U (F(p0)||p1))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 153/153 transitions.
Graph (complete) has 347 edges and 113 vertex of which 111 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
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 111 transition count 147
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 107 transition count 147
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 12 place count 104 transition count 144
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 104 transition count 144
Applied a total of 15 rules in 23 ms. Remains 104 /113 variables (removed 9) and now considering 144/153 (removed 9) transitions.
// Phase 1: matrix 144 rows 104 cols
[2022-05-15 17:23:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:23:52] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 144 rows 104 cols
[2022-05-15 17:23:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:23:52] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 17:23:52] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 164 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/113 places, 144/153 transitions.
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 0 with 54 rules applied. Total rules applied 54 place count 76 transition count 117
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 66 place count 64 transition count 93
Iterating global reduction 0 with 12 rules applied. Total rules applied 78 place count 64 transition count 93
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 90 place count 52 transition count 69
Iterating global reduction 0 with 12 rules applied. Total rules applied 102 place count 52 transition count 69
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 114 place count 40 transition count 57
Iterating global reduction 0 with 12 rules applied. Total rules applied 126 place count 40 transition count 57
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 137 place count 29 transition count 35
Iterating global reduction 0 with 11 rules applied. Total rules applied 148 place count 29 transition count 35
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 159 place count 18 transition count 24
Iterating global reduction 0 with 11 rules applied. Total rules applied 170 place count 18 transition count 24
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 171 place count 18 transition count 24
Applied a total of 171 rules in 17 ms. Remains 18 /103 variables (removed 85) and now considering 24/144 (removed 120) transitions.
[2022-05-15 17:23:52] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 18 cols
[2022-05-15 17:23:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:23:52] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-15 17:23:52] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 18 cols
[2022-05-15 17:23:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:23:52] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-15 17:23:52] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/113 places, 24/153 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/113 places, 24/153 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s10 1), p0:(AND (EQ s8 1) (EQ s17 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 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-03 finished in 448 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((p0||(G(p1)&&p1))))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 153/153 transitions.
Graph (complete) has 347 edges and 113 vertex of which 110 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
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 110 transition count 146
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 106 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 102 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 102 transition count 142
Applied a total of 17 rules in 22 ms. Remains 102 /113 variables (removed 11) and now considering 142/153 (removed 11) transitions.
// Phase 1: matrix 142 rows 102 cols
[2022-05-15 17:23:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:23:52] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 142 rows 102 cols
[2022-05-15 17:23:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:23:52] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-05-15 17:23:52] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 149 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/113 places, 142/153 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 4 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 52 place count 75 transition count 116
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 64 place count 63 transition count 92
Iterating global reduction 0 with 12 rules applied. Total rules applied 76 place count 63 transition count 92
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 88 place count 51 transition count 68
Iterating global reduction 0 with 12 rules applied. Total rules applied 100 place count 51 transition count 68
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 112 place count 39 transition count 56
Iterating global reduction 0 with 12 rules applied. Total rules applied 124 place count 39 transition count 56
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 135 place count 28 transition count 34
Iterating global reduction 0 with 11 rules applied. Total rules applied 146 place count 28 transition count 34
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 157 place count 17 transition count 23
Iterating global reduction 0 with 11 rules applied. Total rules applied 168 place count 17 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 169 place count 17 transition count 23
Applied a total of 169 rules in 24 ms. Remains 17 /101 variables (removed 84) and now considering 23/142 (removed 119) transitions.
[2022-05-15 17:23:52] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 17 cols
[2022-05-15 17:23:52] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:23:52] [INFO ] Implicit Places using invariants in 22 ms returned []
[2022-05-15 17:23:52] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 17 cols
[2022-05-15 17:23:52] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 17:23:52] [INFO ] State equation strengthened by 15 read => feed constraints.
[2022-05-15 17:23:52] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/113 places, 23/153 transitions.
Finished structural reductions, in 2 iterations. Remains : 17/113 places, 23/153 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-04 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:(EQ s13 1), p0:(AND (EQ s3 1) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-04 finished in 335 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 153/153 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 106 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 106 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 104 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 104 transition count 144
Applied a total of 18 rules in 13 ms. Remains 104 /113 variables (removed 9) and now considering 144/153 (removed 9) transitions.
// Phase 1: matrix 144 rows 104 cols
[2022-05-15 17:23:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:23:52] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 144 rows 104 cols
[2022-05-15 17:23:52] [INFO ] Computed 2 place invariants in 10 ms
[2022-05-15 17:23:52] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-05-15 17:23:53] [INFO ] Implicit Places using invariants and state equation in 173 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 246 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/113 places, 144/153 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 103/113 places, 144/153 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-05 finished in 393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&G(p2)&&p0)))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 153/153 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 106 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 106 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 104 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 104 transition count 144
Applied a total of 18 rules in 10 ms. Remains 104 /113 variables (removed 9) and now considering 144/153 (removed 9) transitions.
// Phase 1: matrix 144 rows 104 cols
[2022-05-15 17:23:53] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-15 17:23:53] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 144 rows 104 cols
[2022-05-15 17:23:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:23:53] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-05-15 17:23:53] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 154 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/113 places, 144/153 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 103/113 places, 144/153 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s13 1), p2:(AND (EQ s68 1) (EQ s102 1)), p0:(AND (EQ s94 1) (EQ s102 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 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-06 finished in 313 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((!X(p0) U p1))||(X(p2)&&F(p3))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 153/153 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 151
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 151
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 109 transition count 149
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 109 transition count 149
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 108 transition count 148
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 108 transition count 148
Applied a total of 10 rules in 5 ms. Remains 108 /113 variables (removed 5) and now considering 148/153 (removed 5) transitions.
// Phase 1: matrix 148 rows 108 cols
[2022-05-15 17:23:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:23:53] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 148 rows 108 cols
[2022-05-15 17:23:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:23:53] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 17:23:53] [INFO ] Implicit Places using invariants and state equation in 132 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 213 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/113 places, 148/153 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 107/113 places, 148/153 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s14 1) (EQ s106 1)), p3:(EQ s89 0), p2:(EQ s18 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1615 reset in 274 ms.
Stack based approach found an accepted trace after 106 steps with 1 reset with depth 59 and stack size 59 in 1 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-07 finished in 670 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)||p1))&&F((X(X(p2))||p3))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 153/153 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 106 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 106 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 104 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 104 transition count 144
Applied a total of 18 rules in 5 ms. Remains 104 /113 variables (removed 9) and now considering 144/153 (removed 9) transitions.
// Phase 1: matrix 144 rows 104 cols
[2022-05-15 17:23:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:23:54] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 144 rows 104 cols
[2022-05-15 17:23:54] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-15 17:23:54] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-05-15 17:23:54] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 153 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/113 places, 144/153 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 103/113 places, 144/153 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s54 1) (EQ s102 1)), p3:(AND (EQ s63 1) (EQ s102 1)), p0:(AND (EQ s83 1) (EQ s102 1)), p2:(OR (EQ s54 0) (EQ s102 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 274 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-09 finished in 320 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))&&(p1||(G(p2)&&F(p2))))))'
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 153/153 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 150
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 108 transition count 148
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 108 transition count 148
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 107 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 107 transition count 147
Applied a total of 12 rules in 3 ms. Remains 107 /113 variables (removed 6) and now considering 147/153 (removed 6) transitions.
// Phase 1: matrix 147 rows 107 cols
[2022-05-15 17:23:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:23:54] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 147 rows 107 cols
[2022-05-15 17:23:54] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:23:54] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 17:23:54] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 147 rows 107 cols
[2022-05-15 17:23:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:23:54] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/113 places, 147/153 transitions.
Finished structural reductions, in 1 iterations. Remains : 107/113 places, 147/153 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(OR p1 p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s93 0), p2:(EQ s74 1), p0:(OR (AND (EQ s92 1) (EQ s105 1)) (AND (EQ s15 1) (EQ s106 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]]
Product exploration explored 100000 steps with 3103 reset in 218 ms.
Stack based approach found an accepted trace after 96 steps with 3 reset with depth 30 and stack size 30 in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-10 finished in 673 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 1 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 153/153 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 109 transition count 149
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 109 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 106 transition count 146
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 106 transition count 146
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 104 transition count 144
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 104 transition count 144
Applied a total of 18 rules in 8 ms. Remains 104 /113 variables (removed 9) and now considering 144/153 (removed 9) transitions.
// Phase 1: matrix 144 rows 104 cols
[2022-05-15 17:23:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:23:55] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 144 rows 104 cols
[2022-05-15 17:23:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:23:55] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-05-15 17:23:55] [INFO ] Implicit Places using invariants and state equation in 121 ms returned [103]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 177 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/113 places, 144/153 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 103/113 places, 144/153 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-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 s97 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 1362 reset in 208 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-11 finished in 497 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 153/153 transitions.
Graph (complete) has 347 edges and 113 vertex of which 110 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
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 110 transition count 146
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 106 transition count 146
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 13 place count 102 transition count 142
Iterating global reduction 0 with 4 rules applied. Total rules applied 17 place count 102 transition count 142
Applied a total of 17 rules in 9 ms. Remains 102 /113 variables (removed 11) and now considering 142/153 (removed 11) transitions.
// Phase 1: matrix 142 rows 102 cols
[2022-05-15 17:23:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:23:55] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 142 rows 102 cols
[2022-05-15 17:23:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 17:23:55] [INFO ] State equation strengthened by 99 read => feed constraints.
[2022-05-15 17:23:55] [INFO ] Implicit Places using invariants and state equation in 121 ms returned [101]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 184 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/113 places, 142/153 transitions.
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 0 with 54 rules applied. Total rules applied 54 place count 74 transition count 115
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 67 place count 61 transition count 89
Iterating global reduction 0 with 13 rules applied. Total rules applied 80 place count 61 transition count 89
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 93 place count 48 transition count 63
Iterating global reduction 0 with 13 rules applied. Total rules applied 106 place count 48 transition count 63
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 118 place count 36 transition count 51
Iterating global reduction 0 with 12 rules applied. Total rules applied 130 place count 36 transition count 51
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 142 place count 24 transition count 27
Iterating global reduction 0 with 12 rules applied. Total rules applied 154 place count 24 transition count 27
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 166 place count 12 transition count 15
Iterating global reduction 0 with 12 rules applied. Total rules applied 178 place count 12 transition count 15
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 179 place count 12 transition count 15
Applied a total of 179 rules in 10 ms. Remains 12 /101 variables (removed 89) and now considering 15/142 (removed 127) transitions.
[2022-05-15 17:23:55] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 12 cols
[2022-05-15 17:23:55] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:23:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2022-05-15 17:23:55] [INFO ] Flow matrix only has 13 transitions (discarded 2 similar events)
// Phase 1: matrix 13 rows 12 cols
[2022-05-15 17:23:55] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 17:23:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-15 17:23:55] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/113 places, 15/153 transitions.
Finished structural reductions, in 2 iterations. Remains : 12/113 places, 15/153 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s7 1) (EQ s11 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 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-14 finished in 359 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(X(X(p1))))&&p0)))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 153/153 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 110 transition count 150
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 110 transition count 150
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 108 transition count 148
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 108 transition count 148
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 106 transition count 146
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 106 transition count 146
Applied a total of 14 rules in 8 ms. Remains 106 /113 variables (removed 7) and now considering 146/153 (removed 7) transitions.
// Phase 1: matrix 146 rows 106 cols
[2022-05-15 17:23:56] [INFO ] Computed 2 place invariants in 12 ms
[2022-05-15 17:23:56] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 146 rows 106 cols
[2022-05-15 17:23:56] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 17:23:56] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-15 17:23:56] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [105]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 168 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/113 places, 146/153 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 105/113 places, 146/153 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-14a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s104 1)), p1:(AND (EQ s46 1) (EQ s104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-14a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-14a-LTLFireability-15 finished in 304 ms.
All properties solved by simple procedures.
Total runtime 6490 ms.

BK_STOP 1652635436412

--------------------
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-14a"
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-14a, 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-165260109900132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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