Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r254-tall-162106745700221.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SmartHome-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106745700221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 64K May 5 16:52 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-09-00
FORMULA_NAME SmartHome-PT-09-01
FORMULA_NAME SmartHome-PT-09-02
FORMULA_NAME SmartHome-PT-09-03
FORMULA_NAME SmartHome-PT-09-04
FORMULA_NAME SmartHome-PT-09-05
FORMULA_NAME SmartHome-PT-09-06
FORMULA_NAME SmartHome-PT-09-07
FORMULA_NAME SmartHome-PT-09-08
FORMULA_NAME SmartHome-PT-09-09
FORMULA_NAME SmartHome-PT-09-10
FORMULA_NAME SmartHome-PT-09-11
FORMULA_NAME SmartHome-PT-09-12
FORMULA_NAME SmartHome-PT-09-13
FORMULA_NAME SmartHome-PT-09-14
FORMULA_NAME SmartHome-PT-09-15

=== Now, execution of the tool begins

BK_START 1621167219112

Running Version 0
[2021-05-16 12:13:41] [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]
[2021-05-16 12:13:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 12:13:41] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2021-05-16 12:13:41] [INFO ] Transformed 253 places.
[2021-05-16 12:13:41] [INFO ] Transformed 293 transitions.
[2021-05-16 12:13:41] [INFO ] Found NUPN structural information;
[2021-05-16 12:13:41] [INFO ] Parsed PT model containing 253 places and 293 transitions in 113 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 12:13:41] [INFO ] Initial state test concluded for 2 properties.
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 30 transitions.
FORMULA SmartHome-PT-09-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 224 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 224/224 places, 263/263 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 217 transition count 263
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 57 place count 167 transition count 213
Iterating global reduction 1 with 50 rules applied. Total rules applied 107 place count 167 transition count 213
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 112 place count 167 transition count 208
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 122 place count 157 transition count 198
Iterating global reduction 2 with 10 rules applied. Total rules applied 132 place count 157 transition count 198
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 140 place count 149 transition count 190
Iterating global reduction 2 with 8 rules applied. Total rules applied 148 place count 149 transition count 190
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 148 transition count 189
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 148 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 151 place count 147 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 147 transition count 188
Applied a total of 152 rules in 80 ms. Remains 147 /224 variables (removed 77) and now considering 188/263 (removed 75) transitions.
// Phase 1: matrix 188 rows 147 cols
[2021-05-16 12:13:41] [INFO ] Computed 3 place invariants in 9 ms
[2021-05-16 12:13:41] [INFO ] Implicit Places using invariants in 142 ms returned []
// Phase 1: matrix 188 rows 147 cols
[2021-05-16 12:13:41] [INFO ] Computed 3 place invariants in 14 ms
[2021-05-16 12:13:41] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
// Phase 1: matrix 188 rows 147 cols
[2021-05-16 12:13:41] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-16 12:13:41] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 147/224 places, 188/263 transitions.
[2021-05-16 12:13:42] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 12:13:42] [INFO ] Flatten gal took : 67 ms
FORMULA SmartHome-PT-09-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 12:13:42] [INFO ] Flatten gal took : 20 ms
[2021-05-16 12:13:42] [INFO ] Input system was already deterministic with 188 transitions.
Incomplete random walk after 100000 steps, including 657 resets, run finished after 301 ms. (steps per millisecond=332 ) properties (out of 31) seen :29
Running SMT prover for 2 properties.
// Phase 1: matrix 188 rows 147 cols
[2021-05-16 12:13:42] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-16 12:13:42] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 12:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:13:42] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
[2021-05-16 12:13:42] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-16 12:13:42] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-16 12:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:13:42] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-05-16 12:13:42] [INFO ] Computed and/alt/rep : 187/326/187 causal constraints (skipped 0 transitions) in 27 ms.
[2021-05-16 12:13:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:13:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-16 12:13:42] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 12:13:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:13:42] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-16 12:13:43] [INFO ] Computed and/alt/rep : 187/326/187 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-16 12:13:43] [INFO ] Added : 159 causal constraints over 32 iterations in 527 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2021-05-16 12:13:43] [INFO ] Initial state test concluded for 1 properties.
FORMULA SmartHome-PT-09-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X((G(p1)||(G(p2) U G(p3))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 188/188 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 134 transition count 175
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 134 transition count 175
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 134 transition count 174
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 130 transition count 170
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 130 transition count 170
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 127 transition count 167
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 127 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 127 transition count 166
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 126 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 126 transition count 165
Applied a total of 44 rules in 21 ms. Remains 126 /147 variables (removed 21) and now considering 165/188 (removed 23) transitions.
// Phase 1: matrix 165 rows 126 cols
[2021-05-16 12:13:43] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:43] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 165 rows 126 cols
[2021-05-16 12:13:43] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:43] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 165 rows 126 cols
[2021-05-16 12:13:43] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:43] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/147 places, 165/188 transitions.
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-09-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p3 (NOT p2)), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) p3 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 p3 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1 p3 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) p3 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) p3), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s34 1), p1:(OR (EQ s34 1) (EQ s57 1)), p2:(EQ s57 1), p3:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6899 reset in 343 ms.
Stack based approach found an accepted trace after 125 steps with 7 reset with depth 9 and stack size 9 in 1 ms.
FORMULA SmartHome-PT-09-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-00 finished in 1057 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p0)||((p0&&X(F(p1))) U p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 147 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 147/147 places, 188/188 transitions.
Graph (trivial) has 145 edges and 147 vertex of which 77 / 147 are part of one of the 6 SCC in 4 ms
Free SCC test removed 71 places
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 75 transition count 74
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 25 rules applied. Total rules applied 46 place count 55 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 53 transition count 69
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 48 place count 53 transition count 63
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 60 place count 47 transition count 63
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 64 place count 43 transition count 59
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 43 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 43 transition count 58
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 103 place count 26 transition count 40
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 112 place count 26 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 25 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 113 place count 25 transition count 30
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 115 place count 24 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 116 place count 23 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 117 place count 22 transition count 29
Applied a total of 117 rules in 23 ms. Remains 22 /147 variables (removed 125) and now considering 29/188 (removed 159) transitions.
[2021-05-16 12:13:44] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
// Phase 1: matrix 24 rows 22 cols
[2021-05-16 12:13:44] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-16 12:13:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2021-05-16 12:13:44] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
// Phase 1: matrix 24 rows 22 cols
[2021-05-16 12:13:44] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-16 12:13:44] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2021-05-16 12:13:44] [INFO ] Redundant transitions in 19 ms returned []
[2021-05-16 12:13:44] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
// Phase 1: matrix 24 rows 22 cols
[2021-05-16 12:13:44] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-16 12:13:44] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/147 places, 29/188 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SmartHome-PT-09-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s6 1), p2:(EQ s5 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 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-09-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-01 finished in 198 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 188/188 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 132 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 132 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 132 transition count 172
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 127 transition count 167
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 127 transition count 167
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 124 transition count 164
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 124 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 123 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 123 transition count 162
Applied a total of 50 rules in 18 ms. Remains 123 /147 variables (removed 24) and now considering 162/188 (removed 26) transitions.
// Phase 1: matrix 162 rows 123 cols
[2021-05-16 12:13:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 12:13:44] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 162 rows 123 cols
[2021-05-16 12:13:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 12:13:45] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 123 cols
[2021-05-16 12:13:45] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:45] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/147 places, 162/188 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-09-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s41 0), p1:(AND (NEQ s115 1) (NEQ s81 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 166 ms.
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 123 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 123/123 places, 162/162 transitions.
Graph (trivial) has 118 edges and 123 vertex of which 63 / 123 are part of one of the 6 SCC in 0 ms
Free SCC test removed 57 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 66 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 66 transition count 82
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 22 place count 66 transition count 82
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 66 transition count 82
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 38 place count 53 transition count 69
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 51 place count 53 transition count 69
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 67 place count 53 transition count 70
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 73 place count 47 transition count 64
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 47 transition count 64
Deduced a syphon composed of 21 places in 0 ms
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 47 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 45 transition count 54
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 43 transition count 52
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 43 transition count 52
Deduced a syphon composed of 19 places in 1 ms
Applied a total of 95 rules in 14 ms. Remains 43 /123 variables (removed 80) and now considering 52/162 (removed 110) transitions.
[2021-05-16 12:13:46] [INFO ] Redundant transitions in 118 ms returned []
[2021-05-16 12:13:46] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
// Phase 1: matrix 47 rows 43 cols
[2021-05-16 12:13:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-16 12:13:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 43/123 places, 52/162 transitions.
Product exploration explored 100000 steps with 50000 reset in 408 ms.
Product exploration explored 100000 steps with 50000 reset in 326 ms.
[2021-05-16 12:13:47] [INFO ] Flatten gal took : 18 ms
[2021-05-16 12:13:47] [INFO ] Flatten gal took : 16 ms
[2021-05-16 12:13:47] [INFO ] Time to serialize gal into /tmp/LTL3692795539193871723.gal : 20 ms
[2021-05-16 12:13:47] [INFO ] Time to serialize properties into /tmp/LTL2152007613781928352.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3692795539193871723.gal, -t, CGAL, -LTL, /tmp/LTL2152007613781928352.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3692795539193871723.gal -t CGAL -LTL /tmp/LTL2152007613781928352.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(p93==0)"))||(G("((p245!=1)&&(p176!=1))")))))
Formula 0 simplified : !X(F"(p93==0)" | G"((p245!=1)&&(p176!=1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t12, t31, t34, t71, t74, t95, t98, t117, t120, t135, t160, t164, t172, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/147/15/162
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
49 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.508085,34020,1,0,206,82146,353,141,3636,84316,338
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SmartHome-PT-09-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SmartHome-PT-09-04 finished in 3242 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0)) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 188/188 transitions.
Graph (trivial) has 145 edges and 147 vertex of which 77 / 147 are part of one of the 6 SCC in 0 ms
Free SCC test removed 71 places
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 75 transition count 74
Reduce places removed 20 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 23 rules applied. Total rules applied 44 place count 55 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 54 transition count 71
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 45 place count 54 transition count 64
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 59 place count 47 transition count 64
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 63 place count 43 transition count 60
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 43 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 43 transition count 59
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 100 place count 27 transition count 42
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 109 place count 27 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 26 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 110 place count 26 transition count 32
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 112 place count 25 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 25 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 114 place count 25 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 115 place count 24 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 116 place count 23 transition count 30
Applied a total of 116 rules in 12 ms. Remains 23 /147 variables (removed 124) and now considering 30/188 (removed 158) transitions.
[2021-05-16 12:13:48] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 23 cols
[2021-05-16 12:13:48] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-16 12:13:48] [INFO ] Implicit Places using invariants in 30 ms returned []
[2021-05-16 12:13:48] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 23 cols
[2021-05-16 12:13:48] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-16 12:13:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-16 12:13:48] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2021-05-16 12:13:48] [INFO ] Redundant transitions in 29 ms returned []
[2021-05-16 12:13:48] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 23 cols
[2021-05-16 12:13:48] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-16 12:13:48] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/147 places, 30/188 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-09-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s3 1), p0:(NEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-09-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-05 finished in 257 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X((p1 U ((p2&&G(F(p3)))||G(p1))))&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 188/188 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 131 transition count 172
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 131 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 131 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 126 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 126 transition count 166
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 123 transition count 163
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 123 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 123 transition count 162
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 122 transition count 161
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 122 transition count 161
Applied a total of 52 rules in 9 ms. Remains 122 /147 variables (removed 25) and now considering 161/188 (removed 27) transitions.
// Phase 1: matrix 161 rows 122 cols
[2021-05-16 12:13:48] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:48] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 161 rows 122 cols
[2021-05-16 12:13:48] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-16 12:13:48] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
// Phase 1: matrix 161 rows 122 cols
[2021-05-16 12:13:48] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-16 12:13:48] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 122/147 places, 161/188 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : SmartHome-PT-09-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (NEQ s51 1) (NEQ s97 1)), p2:(NEQ s99 1), p1:(NEQ s51 1), p3:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1175 steps with 6 reset in 2 ms.
FORMULA SmartHome-PT-09-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-06 finished in 494 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(G(!p0)))||F((p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 188/188 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 132 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 132 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 132 transition count 172
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 128 transition count 168
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 128 transition count 168
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 126 transition count 166
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 126 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 126 transition count 165
Applied a total of 44 rules in 6 ms. Remains 126 /147 variables (removed 21) and now considering 165/188 (removed 23) transitions.
// Phase 1: matrix 165 rows 126 cols
[2021-05-16 12:13:48] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:48] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 165 rows 126 cols
[2021-05-16 12:13:48] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 12:13:48] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 165 rows 126 cols
[2021-05-16 12:13:48] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:49] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/147 places, 165/188 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SmartHome-PT-09-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (NEQ s18 1) (NEQ s102 1)), p0:(EQ s21 1), p1:(NEQ s102 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Knowledge obtained : [p2, (NOT p0), p1]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 3 out of 126 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 126/126 places, 165/165 transitions.
Graph (trivial) has 120 edges and 126 vertex of which 53 / 126 are part of one of the 5 SCC in 0 ms
Free SCC test removed 48 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 78 transition count 99
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 23 place count 78 transition count 100
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 78 transition count 100
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 38 place count 68 transition count 90
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 68 transition count 90
Performed 22 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 70 place count 68 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 68 transition count 86
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 88 place count 54 transition count 71
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 102 place count 54 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 54 transition count 71
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 108 place count 50 transition count 67
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 50 transition count 67
Deduced a syphon composed of 23 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 120 place count 50 transition count 59
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 120 rules in 11 ms. Remains 50 /126 variables (removed 76) and now considering 59/165 (removed 106) transitions.
[2021-05-16 12:13:50] [INFO ] Redundant transitions in 13 ms returned [54, 58]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions :[58, 54]
[2021-05-16 12:13:50] [INFO ] Flow matrix only has 53 transitions (discarded 4 similar events)
// Phase 1: matrix 53 rows 50 cols
[2021-05-16 12:13:50] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 12:13:50] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 50/126 places, 57/165 transitions.
Graph (complete) has 113 edges and 50 vertex of which 48 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 46 transition count 55
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 46 transition count 55
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 5 rules in 4 ms. Remains 46 /50 variables (removed 4) and now considering 55/57 (removed 2) transitions.
Finished structural reductions, in 2 iterations. Remains : 46/126 places, 55/165 transitions.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 130 ms.
[2021-05-16 12:13:50] [INFO ] Flatten gal took : 8 ms
[2021-05-16 12:13:50] [INFO ] Flatten gal took : 8 ms
[2021-05-16 12:13:50] [INFO ] Time to serialize gal into /tmp/LTL715601942508095641.gal : 7 ms
[2021-05-16 12:13:50] [INFO ] Time to serialize properties into /tmp/LTL12902464211309867264.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL715601942508095641.gal, -t, CGAL, -LTL, /tmp/LTL12902464211309867264.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL715601942508095641.gal -t CGAL -LTL /tmp/LTL12902464211309867264.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(X(G("(p36!=1)"))))||(F(("(p217!=1)")U(("((p32!=1)&&(p217!=1))")||(G("(p217!=1)"))))))))
Formula 0 simplified : !X(XXG"(p36!=1)" | F("(p217!=1)" U ("((p32!=1)&&(p217!=1))" | G"(p217!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t12, t31, t34, t71, t74, t95, t98, t117, t120, t135, t138, t160, t164, t172, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/149/16/165
Computing Next relation with stutter on 14 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
50 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.522978,35324,1,0,211,86667,350,144,3702,90182,341
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SmartHome-PT-09-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property SmartHome-PT-09-07 finished in 2246 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 188/188 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 132 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 132 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 132 transition count 172
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 127 transition count 167
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 127 transition count 167
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 124 transition count 164
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 124 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 123 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 123 transition count 162
Applied a total of 50 rules in 6 ms. Remains 123 /147 variables (removed 24) and now considering 162/188 (removed 26) transitions.
// Phase 1: matrix 162 rows 123 cols
[2021-05-16 12:13:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:51] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 162 rows 123 cols
[2021-05-16 12:13:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:51] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 123 cols
[2021-05-16 12:13:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:51] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/147 places, 162/188 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : SmartHome-PT-09-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s42 1), p0:(EQ s93 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 SmartHome-PT-09-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-09 finished in 270 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 188/188 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 133 transition count 174
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 133 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 133 transition count 173
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 129 transition count 169
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 129 transition count 169
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 126 transition count 166
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 126 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 126 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 125 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 125 transition count 164
Applied a total of 46 rules in 5 ms. Remains 125 /147 variables (removed 22) and now considering 164/188 (removed 24) transitions.
// Phase 1: matrix 164 rows 125 cols
[2021-05-16 12:13:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:51] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 164 rows 125 cols
[2021-05-16 12:13:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 12:13:51] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 164 rows 125 cols
[2021-05-16 12:13:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:51] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 125/147 places, 164/188 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : SmartHome-PT-09-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s55 1), p0:(EQ s63 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5806 steps with 38 reset in 12 ms.
FORMULA SmartHome-PT-09-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-10 finished in 305 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X(((p1||X(F(p2))) U (p0&&(p1||X(F(p2))))))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 147 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 147/147 places, 188/188 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 132 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 132 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 132 transition count 172
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 127 transition count 167
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 127 transition count 167
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 124 transition count 164
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 124 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 123 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 123 transition count 162
Applied a total of 50 rules in 9 ms. Remains 123 /147 variables (removed 24) and now considering 162/188 (removed 26) transitions.
// Phase 1: matrix 162 rows 123 cols
[2021-05-16 12:13:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:51] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 162 rows 123 cols
[2021-05-16 12:13:51] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-16 12:13:51] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 123 cols
[2021-05-16 12:13:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:51] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/147 places, 162/188 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-09-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s69 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-09-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-11 finished in 333 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&(p1 U (p2||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 188/188 transitions.
Graph (trivial) has 143 edges and 147 vertex of which 58 / 147 are part of one of the 6 SCC in 1 ms
Free SCC test removed 52 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 94 transition count 88
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 36 rules applied. Total rules applied 67 place count 64 transition count 82
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 71 place count 61 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 60 transition count 81
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 72 place count 60 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 84 place count 54 transition count 75
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 88 place count 50 transition count 71
Iterating global reduction 4 with 4 rules applied. Total rules applied 92 place count 50 transition count 71
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 4 with 3 rules applied. Total rules applied 95 place count 50 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 96 place count 49 transition count 68
Performed 21 Post agglomeration using F-continuation condition with reduction of 4 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 138 place count 28 transition count 43
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 147 place count 28 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 148 place count 27 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 148 place count 27 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 150 place count 26 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 151 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 152 place count 24 transition count 32
Applied a total of 152 rules in 20 ms. Remains 24 /147 variables (removed 123) and now considering 32/188 (removed 156) transitions.
[2021-05-16 12:13:51] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 24 cols
[2021-05-16 12:13:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-16 12:13:51] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-16 12:13:51] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 24 cols
[2021-05-16 12:13:51] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-16 12:13:52] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-16 12:13:52] [INFO ] Redundant transitions in 8 ms returned []
[2021-05-16 12:13:52] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 24 cols
[2021-05-16 12:13:52] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-16 12:13:52] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/147 places, 32/188 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SmartHome-PT-09-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 0}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(NEQ s9 1), p2:(AND (NEQ s6 1) (NEQ s5 1)), p1:(NEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-09-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-13 finished in 183 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(((p1&&X(p0))||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 188/188 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 132 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 132 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 132 transition count 172
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 127 transition count 167
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 127 transition count 167
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 124 transition count 164
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 124 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 123 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 123 transition count 162
Applied a total of 50 rules in 4 ms. Remains 123 /147 variables (removed 24) and now considering 162/188 (removed 26) transitions.
// Phase 1: matrix 162 rows 123 cols
[2021-05-16 12:13:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:52] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 162 rows 123 cols
[2021-05-16 12:13:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:52] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 162 rows 123 cols
[2021-05-16 12:13:52] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-16 12:13:52] [INFO ] Dead Transitions using invariants and state equation in 180 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/147 places, 162/188 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SmartHome-PT-09-14 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s22 1), p1:(EQ s13 1), p2:(AND (EQ s13 1) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 192 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-09-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-14 finished in 393 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621167233441

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-09"
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-09, 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 r254-tall-162106745700221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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