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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 6.8K Apr 29 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 15:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 15:41 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.5K 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.1K May 9 09:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 101K 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-14-LTLFireability-00
FORMULA_NAME SmartHome-PT-14-LTLFireability-01
FORMULA_NAME SmartHome-PT-14-LTLFireability-02
FORMULA_NAME SmartHome-PT-14-LTLFireability-03
FORMULA_NAME SmartHome-PT-14-LTLFireability-04
FORMULA_NAME SmartHome-PT-14-LTLFireability-05
FORMULA_NAME SmartHome-PT-14-LTLFireability-06
FORMULA_NAME SmartHome-PT-14-LTLFireability-07
FORMULA_NAME SmartHome-PT-14-LTLFireability-08
FORMULA_NAME SmartHome-PT-14-LTLFireability-09
FORMULA_NAME SmartHome-PT-14-LTLFireability-10
FORMULA_NAME SmartHome-PT-14-LTLFireability-11
FORMULA_NAME SmartHome-PT-14-LTLFireability-12
FORMULA_NAME SmartHome-PT-14-LTLFireability-13
FORMULA_NAME SmartHome-PT-14-LTLFireability-14
FORMULA_NAME SmartHome-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653109081808

Running Version 202205111006
[2022-05-21 04:58:04] [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:58:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:58:04] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2022-05-21 04:58:04] [INFO ] Transformed 422 places.
[2022-05-21 04:58:04] [INFO ] Transformed 448 transitions.
[2022-05-21 04:58:04] [INFO ] Found NUPN structural information;
[2022-05-21 04:58:04] [INFO ] Parsed PT model containing 422 places and 448 transitions in 374 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 129 places in 6 ms
Reduce places removed 129 places and 104 transitions.
FORMULA SmartHome-PT-14-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 344/344 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 282 transition count 344
Discarding 76 places :
Symmetric choice reduction at 1 with 76 rule applications. Total rules 87 place count 206 transition count 268
Iterating global reduction 1 with 76 rules applied. Total rules applied 163 place count 206 transition count 268
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 169 place count 206 transition count 262
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 187 place count 188 transition count 244
Iterating global reduction 2 with 18 rules applied. Total rules applied 205 place count 188 transition count 244
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 222 place count 171 transition count 227
Iterating global reduction 2 with 17 rules applied. Total rules applied 239 place count 171 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 241 place count 171 transition count 225
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 247 place count 165 transition count 219
Iterating global reduction 3 with 6 rules applied. Total rules applied 253 place count 165 transition count 219
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 254 place count 164 transition count 218
Iterating global reduction 3 with 1 rules applied. Total rules applied 255 place count 164 transition count 218
Applied a total of 255 rules in 151 ms. Remains 164 /293 variables (removed 129) and now considering 218/344 (removed 126) transitions.
// Phase 1: matrix 218 rows 164 cols
[2022-05-21 04:58:05] [INFO ] Computed 3 place invariants in 22 ms
[2022-05-21 04:58:05] [INFO ] Implicit Places using invariants in 531 ms returned []
// Phase 1: matrix 218 rows 164 cols
[2022-05-21 04:58:05] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-21 04:58:05] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 164 cols
[2022-05-21 04:58:05] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-21 04:58:06] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/293 places, 218/344 transitions.
Finished structural reductions, in 1 iterations. Remains : 164/293 places, 218/344 transitions.
Support contains 16 out of 164 places after structural reductions.
[2022-05-21 04:58:06] [INFO ] Flatten gal took : 101 ms
[2022-05-21 04:58:06] [INFO ] Flatten gal took : 46 ms
[2022-05-21 04:58:06] [INFO ] Input system was already deterministic with 218 transitions.
Finished random walk after 3918 steps, including 19 resets, run visited all 15 properties in 397 ms. (steps per millisecond=9 )
Computed a total of 33 stabilizing places and 32 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((X(G(X(p0)))||p1)))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 218/218 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 159 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 159 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 159 transition count 212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 158 transition count 211
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 158 transition count 211
Applied a total of 13 rules in 14 ms. Remains 158 /164 variables (removed 6) and now considering 211/218 (removed 7) transitions.
// Phase 1: matrix 211 rows 158 cols
[2022-05-21 04:58:07] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 04:58:07] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 211 rows 158 cols
[2022-05-21 04:58:07] [INFO ] Computed 3 place invariants in 14 ms
[2022-05-21 04:58:07] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
// Phase 1: matrix 211 rows 158 cols
[2022-05-21 04:58:07] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 04:58:08] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/164 places, 211/218 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/164 places, 211/218 transitions.
Stuttering acceptance computed with spot in 330 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SmartHome-PT-14-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(EQ s4 1), p0:(EQ s30 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1449 steps with 6 reset in 31 ms.
FORMULA SmartHome-PT-14-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-14-LTLFireability-00 finished in 1050 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(((!G(p0)&&F(p1)) U p2)))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 218/218 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 159 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 159 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 159 transition count 211
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 158 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 158 transition count 210
Applied a total of 14 rules in 13 ms. Remains 158 /164 variables (removed 6) and now considering 210/218 (removed 8) transitions.
// Phase 1: matrix 210 rows 158 cols
[2022-05-21 04:58:08] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-21 04:58:08] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 210 rows 158 cols
[2022-05-21 04:58:08] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:58:08] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 158 cols
[2022-05-21 04:58:08] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 04:58:09] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/164 places, 210/218 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/164 places, 210/218 transitions.
Stuttering acceptance computed with spot in 348 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), p0, (NOT p1)]
Running random walk in product with property : SmartHome-PT-14-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s21 1) (EQ s119 1)), p0:(AND (EQ s121 1) (EQ s156 1)), p1:(EQ s119 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]]
Stuttering criterion allowed to conclude after 131 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-14-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-14-LTLFireability-02 finished in 888 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 218/218 transitions.
Graph (trivial) has 168 edges and 164 vertex of which 101 / 164 are part of one of the 8 SCC in 4 ms
Free SCC test removed 93 places
Ensure Unique test removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 70 transition count 71
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 51 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 50 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 41 place count 50 transition count 68
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 48 transition count 68
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 51 place count 42 transition count 62
Iterating global reduction 3 with 6 rules applied. Total rules applied 57 place count 42 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 42 transition count 60
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
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 93 place count 25 transition count 43
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 106 place count 25 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 108 place count 23 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 108 place count 23 transition count 29
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 110 place count 22 transition count 29
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 111 place count 21 transition count 27
Iterating global reduction 5 with 1 rules applied. Total rules applied 112 place count 21 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 20 transition count 26
Applied a total of 113 rules in 48 ms. Remains 20 /164 variables (removed 144) and now considering 26/218 (removed 192) transitions.
[2022-05-21 04:58:09] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 20 cols
[2022-05-21 04:58:09] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-21 04:58:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-21 04:58:09] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 20 cols
[2022-05-21 04:58:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 04:58:09] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-05-21 04:58:09] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-21 04:58:09] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 20 cols
[2022-05-21 04:58:09] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 04:58:09] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/164 places, 26/218 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/164 places, 26/218 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-14-LTLFireability-04 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:(NEQ s8 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 143 steps with 11 reset in 1 ms.
FORMULA SmartHome-PT-14-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-14-LTLFireability-04 finished in 281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(X((G((G(p0)&&p1)) U (X(p2) U p3)))))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 218/218 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 160 transition count 214
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 160 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 10 place count 160 transition count 212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 159 transition count 211
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 159 transition count 211
Applied a total of 12 rules in 19 ms. Remains 159 /164 variables (removed 5) and now considering 211/218 (removed 7) transitions.
// Phase 1: matrix 211 rows 159 cols
[2022-05-21 04:58:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:58:09] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 211 rows 159 cols
[2022-05-21 04:58:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:58:09] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 211 rows 159 cols
[2022-05-21 04:58:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:58:10] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 159/164 places, 211/218 transitions.
Finished structural reductions, in 1 iterations. Remains : 159/164 places, 211/218 transitions.
Stuttering acceptance computed with spot in 451 ms :[(NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : SmartHome-PT-14-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p1 p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p3) p1 p0), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p0))), acceptance={0, 1} source=0 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p1 p0), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p0))), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) p1 p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p3) p1 p0), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p0))), acceptance={0, 1} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) p1 p0), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p3) p1 p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p3) p1 p0 p2), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p0))), acceptance={0, 1} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) p1 p0), acceptance={1} source=4 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p0))), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s121 1), p1:(EQ s13 1), p0:(EQ s93 1), p2:(AND (EQ s2 1) (EQ s136 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 262 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-14-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-14-LTLFireability-08 finished in 848 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(p0) U G(!F(p1)))||X(p2))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 218/218 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 160 transition count 214
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 160 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 160 transition count 213
Applied a total of 9 rules in 6 ms. Remains 160 /164 variables (removed 4) and now considering 213/218 (removed 5) transitions.
// Phase 1: matrix 213 rows 160 cols
[2022-05-21 04:58:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:58:10] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 213 rows 160 cols
[2022-05-21 04:58:10] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 04:58:10] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
// Phase 1: matrix 213 rows 160 cols
[2022-05-21 04:58:10] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-21 04:58:11] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 160/164 places, 213/218 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/164 places, 213/218 transitions.
Stuttering acceptance computed with spot in 461 ms :[(AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), true, p1, (AND (NOT p1) (NOT p0)), p1]
Running random walk in product with property : SmartHome-PT-14-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p1 p0), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 8}, { cond=(AND p1 p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(EQ s99 1), p0:(EQ s74 1), p2:(EQ s3 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 33273 reset in 408 ms.
Product exploration explored 100000 steps with 33364 reset in 298 ms.
Computed a total of 31 stabilizing places and 30 stable transitions
Computed a total of 31 stabilizing places and 30 stable transitions
Detected a total of 31/160 stabilizing places and 30/213 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 1337 ms. Reduced automaton from 9 states, 24 edges and 3 AP to 8 states, 23 edges and 3 AP.
Stuttering acceptance computed with spot in 371 ms :[(AND p1 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p1 (NOT p2) p0), (AND (NOT p0) (NOT p1) (NOT p2)), true, p1, (AND (NOT p0) (NOT p1)), p1]
Incomplete random walk after 10000 steps, including 48 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 213 rows 160 cols
[2022-05-21 04:58:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:58:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-21 04:58:15] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 04:58:15] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2022-05-21 04:58:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-21 04:58:15] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 04:58:15] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2022-05-21 04:58:15] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 59 ms.
[2022-05-21 04:58:15] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 213/213 transitions.
Graph (trivial) has 162 edges and 160 vertex of which 100 / 160 are part of one of the 8 SCC in 1 ms
Free SCC test removed 92 places
Drop transitions removed 136 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 142 transitions.
Graph (complete) has 106 edges and 68 vertex of which 44 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 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 35 rules applied. Total rules applied 37 place count 44 transition count 24
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 57 place count 24 transition count 24
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 57 place count 24 transition count 23
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 23 transition count 23
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 79 place count 13 transition count 13
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 15 edges and 13 vertex of which 7 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 7 rules applied. Total rules applied 86 place count 7 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 7 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 6 transition count 5
Applied a total of 88 rules in 12 ms. Remains 6 /160 variables (removed 154) and now considering 5/213 (removed 208) transitions.
Finished structural reductions, in 1 iterations. Remains : 6/160 places, 5/213 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Probably explored full state space saw : 5 states, properties seen :0
Probabilistic random walk after 10 steps, saw 5 distinct states, run finished after 6 ms. (steps per millisecond=1 ) properties seen :0
Explored full state space saw : 5 states, properties seen :0
Exhaustive walk after 10 steps, saw 5 distinct states, run finished after 2 ms. (steps per millisecond=5 ) properties seen :0
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) p0))), (G (NOT (AND (NOT p2) p0 (NOT p1)))), (G (NOT (AND (NOT p2) (NOT p0) p1))), (G (NOT (AND p0 p1))), (G (NOT (AND p2 p0 p1))), (G (NOT (AND (NOT p2) p0 p1)))]
False Knowledge obtained : [(F (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F (AND p2 (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 23 factoid took 1292 ms. Reduced automaton from 8 states, 23 edges and 3 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[true, false, p1, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[true, false, p1, (AND (NOT p1) (NOT p2))]
Support contains 2 out of 160 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 213/213 transitions.
Graph (trivial) has 162 edges and 160 vertex of which 100 / 160 are part of one of the 8 SCC in 1 ms
Free SCC test removed 92 places
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 67 transition count 67
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 48 transition count 67
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 39 place count 48 transition count 65
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 46 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 45 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 45 transition count 64
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 79 place count 28 transition count 47
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 92 place count 28 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 93 place count 27 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 93 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 3 with 2 rules applied. Total rules applied 95 place count 26 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 25 transition count 32
Applied a total of 96 rules in 13 ms. Remains 25 /160 variables (removed 135) and now considering 32/213 (removed 181) transitions.
[2022-05-21 04:58:18] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 04:58:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 04:58:18] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-21 04:58:18] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 04:58:18] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-21 04:58:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-21 04:58:18] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2022-05-21 04:58:18] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-21 04:58:18] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 25 cols
[2022-05-21 04:58:18] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-21 04:58:18] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/160 places, 32/213 transitions.
Finished structural reductions, in 1 iterations. Remains : 25/160 places, 32/213 transitions.
Computed a total of 23 stabilizing places and 22 stable transitions
Computed a total of 23 stabilizing places and 22 stable transitions
Detected a total of 23/25 stabilizing places and 22/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 474 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 171 ms :[true, false, p1, (AND (NOT p2) (NOT p1))]
Finished random walk after 37 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p2 (NOT p1)))), (F p1), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 7 factoid took 577 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 163 ms :[true, false, p1, (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[true, false, p1, (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 165 ms :[true, false, p1, (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 5597 reset in 676 ms.
Product exploration explored 100000 steps with 5570 reset in 453 ms.
Built C files in :
/tmp/ltsmin11742645088198436712
[2022-05-21 04:58:21] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2022-05-21 04:58:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 04:58:21] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2022-05-21 04:58:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 04:58:21] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2022-05-21 04:58:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 04:58:21] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11742645088198436712
Running compilation step : cd /tmp/ltsmin11742645088198436712;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 342 ms.
Running link step : cd /tmp/ltsmin11742645088198436712;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin11742645088198436712;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8982835021239489898.hoa' '--buchi-type=spotba'
LTSmin run took 279 ms.
FORMULA SmartHome-PT-14-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-14-LTLFireability-09 finished in 11662 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(p1))))'
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 218/218 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 158 transition count 212
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 158 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 158 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 157 transition count 209
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 157 transition count 209
Applied a total of 16 rules in 9 ms. Remains 157 /164 variables (removed 7) and now considering 209/218 (removed 9) transitions.
// Phase 1: matrix 209 rows 157 cols
[2022-05-21 04:58:22] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 04:58:22] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 209 rows 157 cols
[2022-05-21 04:58:22] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 04:58:22] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
// Phase 1: matrix 209 rows 157 cols
[2022-05-21 04:58:22] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 04:58:22] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/164 places, 209/218 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/164 places, 209/218 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SmartHome-PT-14-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s53 0), p1:(EQ s53 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 240 ms.
Product exploration explored 100000 steps with 50000 reset in 257 ms.
Computed a total of 29 stabilizing places and 28 stable transitions
Computed a total of 29 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SmartHome-PT-14-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-14-LTLFireability-10 finished in 1325 ms.
All properties solved by simple procedures.
Total runtime 19330 ms.

BK_STOP 1653109103724

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

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