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.r240-smll-165303241600268.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 SmartHome-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241600268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 29 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 29 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 09:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 68K May 10 09:34 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 SmartHome-PT-10-LTLFireability-00
FORMULA_NAME SmartHome-PT-10-LTLFireability-01
FORMULA_NAME SmartHome-PT-10-LTLFireability-02
FORMULA_NAME SmartHome-PT-10-LTLFireability-03
FORMULA_NAME SmartHome-PT-10-LTLFireability-04
FORMULA_NAME SmartHome-PT-10-LTLFireability-05
FORMULA_NAME SmartHome-PT-10-LTLFireability-06
FORMULA_NAME SmartHome-PT-10-LTLFireability-07
FORMULA_NAME SmartHome-PT-10-LTLFireability-08
FORMULA_NAME SmartHome-PT-10-LTLFireability-09
FORMULA_NAME SmartHome-PT-10-LTLFireability-10
FORMULA_NAME SmartHome-PT-10-LTLFireability-11
FORMULA_NAME SmartHome-PT-10-LTLFireability-12
FORMULA_NAME SmartHome-PT-10-LTLFireability-13
FORMULA_NAME SmartHome-PT-10-LTLFireability-14
FORMULA_NAME SmartHome-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653108185575

Running Version 202205111006
[2022-05-21 04:43:07] [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-21 04:43:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:43:08] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2022-05-21 04:43:08] [INFO ] Transformed 273 places.
[2022-05-21 04:43:08] [INFO ] Transformed 308 transitions.
[2022-05-21 04:43:08] [INFO ] Found NUPN structural information;
[2022-05-21 04:43:08] [INFO ] Parsed PT model containing 273 places and 308 transitions in 429 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 45 transitions.
FORMULA SmartHome-PT-10-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 263/263 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 184 transition count 214
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 184 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 100 place count 184 transition count 212
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 107 place count 177 transition count 205
Iterating global reduction 1 with 7 rules applied. Total rules applied 114 place count 177 transition count 205
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 119 place count 172 transition count 200
Iterating global reduction 1 with 5 rules applied. Total rules applied 124 place count 172 transition count 200
Applied a total of 124 rules in 116 ms. Remains 172 /233 variables (removed 61) and now considering 200/263 (removed 63) transitions.
// Phase 1: matrix 200 rows 172 cols
[2022-05-21 04:43:08] [INFO ] Computed 12 place invariants in 21 ms
[2022-05-21 04:43:09] [INFO ] Implicit Places using invariants in 506 ms returned []
// Phase 1: matrix 200 rows 172 cols
[2022-05-21 04:43:09] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-21 04:43:09] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
// Phase 1: matrix 200 rows 172 cols
[2022-05-21 04:43:09] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-21 04:43:09] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 172/233 places, 200/263 transitions.
Finished structural reductions, in 1 iterations. Remains : 172/233 places, 200/263 transitions.
Support contains 34 out of 172 places after structural reductions.
[2022-05-21 04:43:10] [INFO ] Flatten gal took : 97 ms
[2022-05-21 04:43:10] [INFO ] Flatten gal took : 35 ms
[2022-05-21 04:43:10] [INFO ] Input system was already deterministic with 200 transitions.
Support contains 31 out of 172 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 77 resets, run finished after 726 ms. (steps per millisecond=13 ) properties (out of 30) seen :25
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 200 rows 172 cols
[2022-05-21 04:43:11] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-21 04:43:11] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2022-05-21 04:43:11] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 04:43:12] [INFO ] After 160ms SMT Verify possible using state equation in real domain returned unsat :1 sat :4
[2022-05-21 04:43:12] [INFO ] After 253ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 60 ms.
[2022-05-21 04:43:12] [INFO ] After 500ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 29 ms.
Support contains 7 out of 172 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 172/172 places, 200/200 transitions.
Graph (trivial) has 149 edges and 172 vertex of which 53 / 172 are part of one of the 4 SCC in 4 ms
Free SCC test removed 49 places
Drop transitions removed 67 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 123 transition count 97
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 45 rules applied. Total rules applied 81 place count 88 transition count 87
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 89 place count 82 transition count 85
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 81 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 92 place count 80 transition count 84
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 92 place count 80 transition count 79
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 102 place count 75 transition count 79
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 110 place count 67 transition count 71
Iterating global reduction 5 with 8 rules applied. Total rules applied 118 place count 67 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 121 place count 67 transition count 68
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 123 place count 66 transition count 67
Performed 23 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 169 place count 43 transition count 42
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 142 edges and 43 vertex of which 41 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 8 rules applied. Total rules applied 177 place count 41 transition count 35
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 181 place count 41 transition count 31
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 185 place count 37 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 186 place count 36 transition count 30
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 6 rules applied. Total rules applied 192 place count 32 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 194 place count 30 transition count 28
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 4 Pre rules applied. Total rules applied 194 place count 30 transition count 24
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 202 place count 26 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 204 place count 25 transition count 23
Applied a total of 204 rules in 62 ms. Remains 25 /172 variables (removed 147) and now considering 23/200 (removed 177) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/172 places, 23/200 transitions.
Finished random walk after 1638 steps, including 115 resets, run visited all 4 properties in 20 ms. (steps per millisecond=81 )
FORMULA SmartHome-PT-10-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 21 stabilizing places and 21 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 200/200 transitions.
Graph (trivial) has 155 edges and 172 vertex of which 77 / 172 are part of one of the 6 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 100 transition count 84
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 77 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 75 transition count 80
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 53 place count 75 transition count 76
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 61 place count 71 transition count 76
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 68 place count 64 transition count 69
Iterating global reduction 3 with 7 rules applied. Total rules applied 75 place count 64 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 64 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 76 place count 64 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 63 transition count 67
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 118 place count 43 transition count 46
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 124 place count 43 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 126 place count 41 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 128 place count 39 transition count 38
Applied a total of 128 rules in 44 ms. Remains 39 /172 variables (removed 133) and now considering 38/200 (removed 162) transitions.
[2022-05-21 04:43:12] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
// Phase 1: matrix 33 rows 39 cols
[2022-05-21 04:43:12] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-21 04:43:12] [INFO ] Implicit Places using invariants in 70 ms returned []
[2022-05-21 04:43:12] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
// Phase 1: matrix 33 rows 39 cols
[2022-05-21 04:43:12] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-21 04:43:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-21 04:43:12] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2022-05-21 04:43:12] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-21 04:43:12] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
// Phase 1: matrix 33 rows 39 cols
[2022-05-21 04:43:12] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 04:43:13] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/172 places, 38/200 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/172 places, 38/200 transitions.
Stuttering acceptance computed with spot in 382 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s5 1), p0:(EQ s7 1)], nbAcceptance=0, 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 0 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-01 finished in 771 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0) U X(p1)))||(p2 U p3))))'
Support contains 3 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 200/200 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 161 transition count 189
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 161 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 161 transition count 188
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 154 transition count 181
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 154 transition count 181
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 148 transition count 175
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 148 transition count 175
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 146 transition count 173
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 146 transition count 173
Applied a total of 53 rules in 33 ms. Remains 146 /172 variables (removed 26) and now considering 173/200 (removed 27) transitions.
// Phase 1: matrix 173 rows 146 cols
[2022-05-21 04:43:13] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:43:13] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 173 rows 146 cols
[2022-05-21 04:43:13] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:43:13] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
// Phase 1: matrix 173 rows 146 cols
[2022-05-21 04:43:13] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:43:13] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/172 places, 173/200 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/172 places, 173/200 transitions.
Stuttering acceptance computed with spot in 488 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), false, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2 (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p3:(EQ s92 1), p2:(EQ s44 1), p0:(EQ s94 1), p1:(OR (EQ s92 1) (EQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2089 steps with 45 reset in 31 ms.
FORMULA SmartHome-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-02 finished in 1036 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(true U p0)||X((X(p1) U X(p2)))))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 200/200 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 160 transition count 188
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 160 transition count 188
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 32 place count 152 transition count 180
Iterating global reduction 0 with 8 rules applied. Total rules applied 40 place count 152 transition count 180
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 146 transition count 174
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 146 transition count 174
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 144 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 144 transition count 172
Applied a total of 56 rules in 20 ms. Remains 144 /172 variables (removed 28) and now considering 172/200 (removed 28) transitions.
// Phase 1: matrix 172 rows 144 cols
[2022-05-21 04:43:14] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:43:14] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 172 rows 144 cols
[2022-05-21 04:43:14] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:43:14] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
// Phase 1: matrix 172 rows 144 cols
[2022-05-21 04:43:14] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:43:14] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 144/172 places, 172/200 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/172 places, 172/200 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), true, (AND p0 (NOT p2)), p0]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 3}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=5, aps=[p2:(EQ s107 1), p1:(AND (EQ s30 1) (EQ s143 1)), p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 79 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-04 finished in 726 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(p0 U p1))||(!(p2 U p3)&&F(p4)))))'
Support contains 7 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 200/200 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 161 transition count 189
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 161 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 161 transition count 188
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 30 place count 154 transition count 181
Iterating global reduction 1 with 7 rules applied. Total rules applied 37 place count 154 transition count 181
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 149 transition count 176
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 149 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 148 transition count 175
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 148 transition count 175
Applied a total of 49 rules in 24 ms. Remains 148 /172 variables (removed 24) and now considering 175/200 (removed 25) transitions.
// Phase 1: matrix 175 rows 148 cols
[2022-05-21 04:43:15] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:43:15] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 175 rows 148 cols
[2022-05-21 04:43:15] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:43:15] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 175 rows 148 cols
[2022-05-21 04:43:15] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:43:15] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 148/172 places, 175/200 transitions.
Finished structural reductions, in 1 iterations. Remains : 148/172 places, 175/200 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (AND p1 (NOT p4)) (AND p1 p3)), (OR (AND p1 (NOT p4)) (AND p1 p3)), p1, (AND p1 (NOT p4)), (AND p1 p3), true, (NOT p4), p3]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p3, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p4)), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p4) p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p4) p1), acceptance={} source=3 dest: 6}], [{ cond=(AND p3 p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p3 p1), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p3) p1), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p4), acceptance={0} source=6 dest: 6}], [{ cond=p3, acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p3:(EQ s18 1), p4:(EQ s66 0), p2:(EQ s109 1), p0:(AND (EQ s95 1) (EQ s121 1)), p1:(AND (EQ s139 1) (EQ s145 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 770 ms.
Product exploration explored 100000 steps with 50000 reset in 389 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p3) p4 (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT p3)), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p4) p0 (NOT p1))))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p4) p1)))), (X (X (NOT (AND p2 (NOT p3) p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p2 (NOT p3))))
Knowledge based reduction with 12 factoid took 287 ms. Reduced automaton from 8 states, 16 edges and 5 AP to 1 states, 0 edges and 0 AP.
FORMULA SmartHome-PT-10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-10-LTLFireability-05 finished in 2216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(p2)))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 200/200 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 160 transition count 188
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 160 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 160 transition count 187
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 153 transition count 180
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 153 transition count 180
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 147 transition count 174
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 147 transition count 174
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 145 transition count 172
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 145 transition count 172
Applied a total of 55 rules in 39 ms. Remains 145 /172 variables (removed 27) and now considering 172/200 (removed 28) transitions.
// Phase 1: matrix 172 rows 145 cols
[2022-05-21 04:43:17] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:43:17] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 172 rows 145 cols
[2022-05-21 04:43:17] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:43:17] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
// Phase 1: matrix 172 rows 145 cols
[2022-05-21 04:43:17] [INFO ] Computed 12 place invariants in 8 ms
[2022-05-21 04:43:17] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/172 places, 172/200 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/172 places, 172/200 transitions.
Stuttering acceptance computed with spot in 296 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s101 1), p0:(OR (EQ s61 1) (EQ s101 1)), p2:(EQ s61 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-08 finished in 846 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 200/200 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 161 transition count 189
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 161 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 161 transition count 188
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 153 transition count 180
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 153 transition count 180
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 147 transition count 174
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 147 transition count 174
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 145 transition count 172
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 145 transition count 172
Applied a total of 55 rules in 15 ms. Remains 145 /172 variables (removed 27) and now considering 172/200 (removed 28) transitions.
// Phase 1: matrix 172 rows 145 cols
[2022-05-21 04:43:18] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:43:18] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 172 rows 145 cols
[2022-05-21 04:43:18] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:43:18] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
// Phase 1: matrix 172 rows 145 cols
[2022-05-21 04:43:18] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:43:18] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/172 places, 172/200 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/172 places, 172/200 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s34 1) (EQ s111 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-09 finished in 573 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F(G(F(X(p0)))))))'
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 200/200 transitions.
Graph (trivial) has 157 edges and 172 vertex of which 76 / 172 are part of one of the 6 SCC in 2 ms
Free SCC test removed 70 places
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 101 transition count 84
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 29 rules applied. Total rules applied 54 place count 77 transition count 79
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 74 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 73 transition count 78
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 59 place count 73 transition count 74
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 67 place count 69 transition count 74
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 74 place count 62 transition count 67
Iterating global reduction 4 with 7 rules applied. Total rules applied 81 place count 62 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 62 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 82 place count 62 transition count 65
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 84 place count 61 transition count 65
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 126 place count 40 transition count 43
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 132 place count 40 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 134 place count 38 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 136 place count 36 transition count 35
Applied a total of 136 rules in 51 ms. Remains 36 /172 variables (removed 136) and now considering 35/200 (removed 165) transitions.
[2022-05-21 04:43:18] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
// Phase 1: matrix 30 rows 36 cols
[2022-05-21 04:43:18] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-21 04:43:18] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-05-21 04:43:18] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
// Phase 1: matrix 30 rows 36 cols
[2022-05-21 04:43:18] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-21 04:43:19] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2022-05-21 04:43:19] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-21 04:43:19] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
// Phase 1: matrix 30 rows 36 cols
[2022-05-21 04:43:19] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:43:19] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/172 places, 35/200 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/172 places, 35/200 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-10 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:(EQ s7 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 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-10 finished in 371 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1)||p2)))'
Support contains 3 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 200/200 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 160 transition count 188
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 160 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 160 transition count 187
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 153 transition count 180
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 153 transition count 180
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 148 transition count 175
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 148 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 147 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 147 transition count 174
Applied a total of 51 rules in 16 ms. Remains 147 /172 variables (removed 25) and now considering 174/200 (removed 26) transitions.
// Phase 1: matrix 174 rows 147 cols
[2022-05-21 04:43:19] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:43:19] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 174 rows 147 cols
[2022-05-21 04:43:19] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:43:19] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
// Phase 1: matrix 174 rows 147 cols
[2022-05-21 04:43:19] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:43:19] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/172 places, 174/200 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/172 places, 174/200 transitions.
Stuttering acceptance computed with spot in 231 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ 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: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(EQ s44 1), p0:(EQ s0 1), p2:(EQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-11 finished in 782 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 200/200 transitions.
Graph (trivial) has 157 edges and 172 vertex of which 77 / 172 are part of one of the 6 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 100 transition count 85
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 48 place count 78 transition count 82
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 77 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 76 transition count 81
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 51 place count 76 transition count 76
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 61 place count 71 transition count 76
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 69 place count 63 transition count 68
Iterating global reduction 4 with 8 rules applied. Total rules applied 77 place count 63 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 63 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 63 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 62 transition count 66
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 122 place count 41 transition count 44
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 128 place count 41 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 130 place count 39 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 132 place count 37 transition count 36
Applied a total of 132 rules in 31 ms. Remains 37 /172 variables (removed 135) and now considering 36/200 (removed 164) transitions.
[2022-05-21 04:43:20] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 37 cols
[2022-05-21 04:43:20] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:43:20] [INFO ] Implicit Places using invariants in 70 ms returned []
[2022-05-21 04:43:20] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 37 cols
[2022-05-21 04:43:20] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:43:20] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2022-05-21 04:43:20] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-21 04:43:20] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 37 cols
[2022-05-21 04:43:20] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-21 04:43:20] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/172 places, 36/200 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/172 places, 36/200 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-12 finished in 340 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(X(p1)&&p2)) U G(!X((F(p1)||p3)))))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 200/200 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 159 transition count 187
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 159 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 159 transition count 186
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 35 place count 151 transition count 178
Iterating global reduction 1 with 8 rules applied. Total rules applied 43 place count 151 transition count 178
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 145 transition count 172
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 145 transition count 172
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 143 transition count 170
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 143 transition count 170
Applied a total of 59 rules in 15 ms. Remains 143 /172 variables (removed 29) and now considering 170/200 (removed 30) transitions.
// Phase 1: matrix 170 rows 143 cols
[2022-05-21 04:43:20] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-21 04:43:20] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 170 rows 143 cols
[2022-05-21 04:43:20] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-21 04:43:20] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 143 cols
[2022-05-21 04:43:20] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-21 04:43:20] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/172 places, 170/200 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/172 places, 170/200 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR p3 p1), (AND (NOT p1) p3), (OR p3 p1), true]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(OR p1 p3), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p2 (NOT p1) (NOT p3))), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND p2 (NOT p1) (NOT p3))), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p3) (AND p2 p1) (AND p2 p3)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s5 1), p3:(EQ s82 1), p0:(EQ s115 1), p2:(EQ s105 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-13 finished in 686 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X((X(F(G(p0)))||X(p1)))))))'
Support contains 3 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 200/200 transitions.
Graph (trivial) has 152 edges and 172 vertex of which 71 / 172 are part of one of the 5 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 85 transitions
Reduce isomorphic transitions removed 85 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 105 transition count 89
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 30 rules applied. Total rules applied 56 place count 80 transition count 84
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 60 place count 77 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 76 transition count 83
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 61 place count 76 transition count 79
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 69 place count 72 transition count 79
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 77 place count 64 transition count 71
Iterating global reduction 4 with 8 rules applied. Total rules applied 85 place count 64 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 88 place count 64 transition count 68
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 90 place count 63 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 90 place count 63 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 92 place count 62 transition count 66
Performed 21 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 134 place count 41 transition count 44
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 140 place count 41 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 142 place count 39 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 144 place count 37 transition count 36
Applied a total of 144 rules in 32 ms. Remains 37 /172 variables (removed 135) and now considering 36/200 (removed 164) transitions.
[2022-05-21 04:43:21] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
// Phase 1: matrix 32 rows 37 cols
[2022-05-21 04:43:21] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:43:21] [INFO ] Implicit Places using invariants in 68 ms returned []
[2022-05-21 04:43:21] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
// Phase 1: matrix 32 rows 37 cols
[2022-05-21 04:43:21] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:43:21] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2022-05-21 04:43:21] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-21 04:43:21] [INFO ] Flow matrix only has 32 transitions (discarded 4 similar events)
// Phase 1: matrix 32 rows 37 cols
[2022-05-21 04:43:21] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-21 04:43:21] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/172 places, 36/200 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/172 places, 36/200 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s4 0), p1:(AND (EQ s7 1) (EQ s30 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 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-14 finished in 376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0)||p1))))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 200/200 transitions.
Graph (trivial) has 154 edges and 172 vertex of which 73 / 172 are part of one of the 5 SCC in 1 ms
Free SCC test removed 68 places
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 103 transition count 88
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 79 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 78 transition count 86
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 52 place count 78 transition count 81
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 62 place count 73 transition count 81
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 68 place count 67 transition count 75
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 67 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 67 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 75 place count 67 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 66 transition count 73
Performed 25 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 127 place count 41 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 128 place count 41 transition count 43
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 134 place count 41 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 136 place count 39 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 138 place count 37 transition count 35
Applied a total of 138 rules in 19 ms. Remains 37 /172 variables (removed 135) and now considering 35/200 (removed 165) transitions.
[2022-05-21 04:43:21] [INFO ] Flow matrix only has 31 transitions (discarded 4 similar events)
// Phase 1: matrix 31 rows 37 cols
[2022-05-21 04:43:21] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-21 04:43:21] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-05-21 04:43:21] [INFO ] Flow matrix only has 31 transitions (discarded 4 similar events)
// Phase 1: matrix 31 rows 37 cols
[2022-05-21 04:43:21] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-21 04:43:21] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-21 04:43:21] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-21 04:43:21] [INFO ] Flow matrix only has 31 transitions (discarded 4 similar events)
// Phase 1: matrix 31 rows 37 cols
[2022-05-21 04:43:21] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:43:21] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/172 places, 35/200 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/172 places, 35/200 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s12 1), p1:(EQ s14 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-15 finished in 224 ms.
All properties solved by simple procedures.
Total runtime 13649 ms.

BK_STOP 1653108201730

--------------------
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="SmartHome-PT-10"
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 SmartHome-PT-10, 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 r240-smll-165303241600268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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