Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r457-smll-167912649000196.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is SmartHome-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649000196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.1K Feb 26 05:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 05:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 05:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 05:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 26 05:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Feb 26 05:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 56K Mar 5 18:23 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-06-LTLFireability-00
FORMULA_NAME SmartHome-PT-06-LTLFireability-01
FORMULA_NAME SmartHome-PT-06-LTLFireability-02
FORMULA_NAME SmartHome-PT-06-LTLFireability-03
FORMULA_NAME SmartHome-PT-06-LTLFireability-04
FORMULA_NAME SmartHome-PT-06-LTLFireability-05
FORMULA_NAME SmartHome-PT-06-LTLFireability-06
FORMULA_NAME SmartHome-PT-06-LTLFireability-07
FORMULA_NAME SmartHome-PT-06-LTLFireability-08
FORMULA_NAME SmartHome-PT-06-LTLFireability-09
FORMULA_NAME SmartHome-PT-06-LTLFireability-10
FORMULA_NAME SmartHome-PT-06-LTLFireability-11
FORMULA_NAME SmartHome-PT-06-LTLFireability-12
FORMULA_NAME SmartHome-PT-06-LTLFireability-13
FORMULA_NAME SmartHome-PT-06-LTLFireability-14
FORMULA_NAME SmartHome-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679320316729

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 13:52:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 13:52:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:52:01] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-20 13:52:01] [INFO ] Transformed 219 places.
[2023-03-20 13:52:01] [INFO ] Transformed 254 transitions.
[2023-03-20 13:52:01] [INFO ] Found NUPN structural information;
[2023-03-20 13:52:01] [INFO ] Parsed PT model containing 219 places and 254 transitions and 581 arcs in 323 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 18 transitions.
FORMULA SmartHome-PT-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 157 transition count 191
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 157 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 94 place count 157 transition count 187
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 102 place count 149 transition count 179
Iterating global reduction 1 with 8 rules applied. Total rules applied 110 place count 149 transition count 179
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 118 place count 141 transition count 171
Iterating global reduction 1 with 8 rules applied. Total rules applied 126 place count 141 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 127 place count 141 transition count 170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 139 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 139 transition count 168
Applied a total of 131 rules in 114 ms. Remains 139 /202 variables (removed 63) and now considering 168/236 (removed 68) transitions.
// Phase 1: matrix 168 rows 139 cols
[2023-03-20 13:52:01] [INFO ] Computed 9 place invariants in 15 ms
[2023-03-20 13:52:01] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-20 13:52:01] [INFO ] Invariant cache hit.
[2023-03-20 13:52:02] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2023-03-20 13:52:02] [INFO ] Invariant cache hit.
[2023-03-20 13:52:02] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 139/202 places, 168/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1329 ms. Remains : 139/202 places, 168/236 transitions.
Support contains 28 out of 139 places after structural reductions.
[2023-03-20 13:52:03] [INFO ] Flatten gal took : 107 ms
[2023-03-20 13:52:03] [INFO ] Flatten gal took : 45 ms
[2023-03-20 13:52:03] [INFO ] Input system was already deterministic with 168 transitions.
Incomplete random walk after 10000 steps, including 72 resets, run finished after 835 ms. (steps per millisecond=11 ) properties (out of 29) seen :25
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 13:52:04] [INFO ] Invariant cache hit.
[2023-03-20 13:52:04] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-03-20 13:52:04] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 13:52:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-20 13:52:04] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 13:52:05] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 7 ms to minimize.
[2023-03-20 13:52:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-20 13:52:05] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-20 13:52:05] [INFO ] After 470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 6 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 168/168 transitions.
Graph (trivial) has 123 edges and 139 vertex of which 53 / 139 are part of one of the 4 SCC in 6 ms
Free SCC test removed 49 places
Drop transitions removed 67 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 90 transition count 75
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 26 rules applied. Total rules applied 50 place count 67 transition count 72
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 54 place count 65 transition count 70
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 64 transition count 69
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 56 place count 64 transition count 63
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 68 place count 58 transition count 63
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 74 place count 52 transition count 57
Iterating global reduction 4 with 6 rules applied. Total rules applied 80 place count 52 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 81 place count 52 transition count 56
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 113 place count 36 transition count 40
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 121 place count 36 transition count 32
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 122 place count 36 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 123 place count 35 transition count 31
Free-agglomeration rule applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 127 place count 35 transition count 27
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 131 place count 31 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 132 place count 30 transition count 26
Reduce places removed 3 places and 0 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 8 with 6 rules applied. Total rules applied 138 place count 27 transition count 23
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 141 place count 24 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 141 place count 24 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 147 place count 21 transition count 20
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 148 place count 20 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 152 place count 18 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 153 place count 18 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 154 place count 17 transition count 17
Applied a total of 154 rules in 62 ms. Remains 17 /139 variables (removed 122) and now considering 17/168 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 17/139 places, 17/168 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 17 rows 17 cols
[2023-03-20 13:52:05] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 13:52:05] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-20 13:52:05] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 13:52:05] [INFO ] After 32ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 13:52:05] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 8 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 1 properties in 0 ms.
FORMULA SmartHome-PT-06-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 14 stabilizing places and 14 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p0 U (p1&&F(p2))))))'
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 168/168 transitions.
Graph (trivial) has 130 edges and 139 vertex of which 60 / 139 are part of one of the 5 SCC in 1 ms
Free SCC test removed 55 places
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 71
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 61 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 60 transition count 69
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 48 place count 60 transition count 64
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 58 place count 55 transition count 64
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 65 place count 48 transition count 57
Iterating global reduction 3 with 7 rules applied. Total rules applied 72 place count 48 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 48 transition count 56
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 101 place count 34 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 110 place count 34 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 112 place count 32 transition count 33
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 114 place count 30 transition count 31
Applied a total of 114 rules in 41 ms. Remains 30 /139 variables (removed 109) and now considering 31/168 (removed 137) transitions.
[2023-03-20 13:52:06] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 30 cols
[2023-03-20 13:52:06] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-20 13:52:06] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-20 13:52:06] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2023-03-20 13:52:06] [INFO ] Invariant cache hit.
[2023-03-20 13:52:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-20 13:52:06] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-20 13:52:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:52:06] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2023-03-20 13:52:06] [INFO ] Invariant cache hit.
[2023-03-20 13:52:06] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/139 places, 31/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 30/139 places, 31/168 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SmartHome-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s9 1), p1:(EQ s0 1), p2:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA SmartHome-PT-06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-06-LTLFireability-00 finished in 775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 168/168 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 125 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 125 transition count 154
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 125 transition count 153
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 119 transition count 147
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 119 transition count 147
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 117 transition count 145
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 117 transition count 145
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 116 transition count 144
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 116 transition count 144
Applied a total of 47 rules in 25 ms. Remains 116 /139 variables (removed 23) and now considering 144/168 (removed 24) transitions.
// Phase 1: matrix 144 rows 116 cols
[2023-03-20 13:52:07] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-20 13:52:07] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-20 13:52:07] [INFO ] Invariant cache hit.
[2023-03-20 13:52:07] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-20 13:52:07] [INFO ] Invariant cache hit.
[2023-03-20 13:52:07] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/139 places, 144/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 525 ms. Remains : 116/139 places, 144/168 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 595 ms.
Product exploration explored 100000 steps with 50000 reset in 408 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-06-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-06-LTLFireability-01 finished in 1753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(F(p1))))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 168/168 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 125 transition count 154
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 125 transition count 154
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 125 transition count 153
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 119 transition count 147
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 119 transition count 147
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 117 transition count 145
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 117 transition count 145
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 116 transition count 144
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 116 transition count 144
Applied a total of 47 rules in 21 ms. Remains 116 /139 variables (removed 23) and now considering 144/168 (removed 24) transitions.
[2023-03-20 13:52:08] [INFO ] Invariant cache hit.
[2023-03-20 13:52:08] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-20 13:52:08] [INFO ] Invariant cache hit.
[2023-03-20 13:52:09] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-20 13:52:09] [INFO ] Invariant cache hit.
[2023-03-20 13:52:09] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/139 places, 144/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 116/139 places, 144/168 transitions.
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s54 0), p1:(EQ s66 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 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 89 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-06-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-06-LTLFireability-02 finished in 1248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||F(p1)) U X(p2))||(G(!p2) U p3)))'
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 168/168 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 127 transition count 156
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 127 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 127 transition count 155
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 121 transition count 149
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 121 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 119 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 119 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 118 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 118 transition count 146
Applied a total of 43 rules in 17 ms. Remains 118 /139 variables (removed 21) and now considering 146/168 (removed 22) transitions.
// Phase 1: matrix 146 rows 118 cols
[2023-03-20 13:52:10] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-20 13:52:10] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-20 13:52:10] [INFO ] Invariant cache hit.
[2023-03-20 13:52:10] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2023-03-20 13:52:10] [INFO ] Invariant cache hit.
[2023-03-20 13:52:10] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/139 places, 146/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 118/139 places, 146/168 transitions.
Stuttering acceptance computed with spot in 594 ms :[(AND (NOT p2) (NOT p3)), false, (AND (NOT p1) (NOT p3) (NOT p2)), false, (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) p2), (AND (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : SmartHome-PT-06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=8 dest: 9}], [{ cond=(NOT p1), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s109 1), p1:(EQ s78 1), p3:(OR (EQ s32 1) (EQ s62 1)), p2:(NEQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 449 ms.
Product exploration explored 100000 steps with 50000 reset in 375 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p3) p2))), (X (X p2)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 16 factoid took 359 ms. Reduced automaton from 10 states, 23 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-06-LTLFireability-04 finished in 2282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(X(G((G(p0)||X(p1)))))) U (p0&&(p0 U X(X(G((G(p0)||X(p1))))))))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 168/168 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 126 transition count 155
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 126 transition count 155
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 126 transition count 154
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 121 transition count 149
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 121 transition count 149
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 120 transition count 148
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 120 transition count 148
Applied a total of 39 rules in 10 ms. Remains 120 /139 variables (removed 19) and now considering 148/168 (removed 20) transitions.
// Phase 1: matrix 148 rows 120 cols
[2023-03-20 13:52:12] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 13:52:12] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-20 13:52:12] [INFO ] Invariant cache hit.
[2023-03-20 13:52:12] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-20 13:52:12] [INFO ] Invariant cache hit.
[2023-03-20 13:52:12] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/139 places, 148/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 120/139 places, 148/168 transitions.
Stuttering acceptance computed with spot in 440 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
Running random walk in product with property : SmartHome-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s77 1), p1:(NEQ s20 1)], 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]]
Entered a terminal (fully accepting) state of product in 22600 steps with 3216 reset in 24 ms.
FORMULA SmartHome-PT-06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-06-LTLFireability-05 finished in 981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 168/168 transitions.
Graph (trivial) has 134 edges and 139 vertex of which 63 / 139 are part of one of the 5 SCC in 0 ms
Free SCC test removed 58 places
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 80 transition count 67
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 58 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 57 transition count 65
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 48 place count 57 transition count 60
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 58 place count 52 transition count 60
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 66 place count 44 transition count 52
Iterating global reduction 3 with 8 rules applied. Total rules applied 74 place count 44 transition count 52
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 102 place count 30 transition count 38
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 111 place count 30 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 29 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 27 transition count 27
Applied a total of 114 rules in 33 ms. Remains 27 /139 variables (removed 112) and now considering 27/168 (removed 141) transitions.
[2023-03-20 13:52:13] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 27 cols
[2023-03-20 13:52:13] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-20 13:52:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-20 13:52:13] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2023-03-20 13:52:13] [INFO ] Invariant cache hit.
[2023-03-20 13:52:13] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-20 13:52:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:52:13] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2023-03-20 13:52:13] [INFO ] Invariant cache hit.
[2023-03-20 13:52:13] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/139 places, 27/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 27/139 places, 27/168 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-06-LTLFireability-07 finished in 247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&F(G(p1)))))))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 168/168 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 126 transition count 155
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 126 transition count 155
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 126 transition count 154
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 121 transition count 149
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 121 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 119 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 119 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 118 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 118 transition count 146
Applied a total of 43 rules in 10 ms. Remains 118 /139 variables (removed 21) and now considering 146/168 (removed 22) transitions.
// Phase 1: matrix 146 rows 118 cols
[2023-03-20 13:52:13] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 13:52:13] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 13:52:13] [INFO ] Invariant cache hit.
[2023-03-20 13:52:13] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-20 13:52:13] [INFO ] Invariant cache hit.
[2023-03-20 13:52:13] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/139 places, 146/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 442 ms. Remains : 118/139 places, 146/168 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : SmartHome-PT-06-LTLFireability-08 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 p0), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s83 1), p1:(EQ s83 0)], nbAcceptance=1, 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 387 steps with 3 reset in 5 ms.
FORMULA SmartHome-PT-06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-06-LTLFireability-08 finished in 731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 168/168 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 127 transition count 156
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 127 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 127 transition count 155
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 123 transition count 151
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 123 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 122 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 122 transition count 150
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 121 transition count 149
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 121 transition count 149
Applied a total of 37 rules in 13 ms. Remains 121 /139 variables (removed 18) and now considering 149/168 (removed 19) transitions.
// Phase 1: matrix 149 rows 121 cols
[2023-03-20 13:52:14] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-20 13:52:14] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-20 13:52:14] [INFO ] Invariant cache hit.
[2023-03-20 13:52:14] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-20 13:52:14] [INFO ] Invariant cache hit.
[2023-03-20 13:52:14] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/139 places, 149/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 121/139 places, 149/168 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s18 1) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-06-LTLFireability-09 finished in 552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 168/168 transitions.
Graph (trivial) has 128 edges and 139 vertex of which 53 / 139 are part of one of the 4 SCC in 1 ms
Free SCC test removed 49 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 89 transition count 75
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 31 rules applied. Total rules applied 58 place count 63 transition count 70
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 63 place count 60 transition count 68
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 59 transition count 67
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 65 place count 59 transition count 62
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 75 place count 54 transition count 62
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 84 place count 45 transition count 53
Iterating global reduction 4 with 9 rules applied. Total rules applied 93 place count 45 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 45 transition count 52
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 122 place count 31 transition count 38
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 131 place count 31 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 133 place count 29 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 135 place count 27 transition count 27
Applied a total of 135 rules in 23 ms. Remains 27 /139 variables (removed 112) and now considering 27/168 (removed 141) transitions.
[2023-03-20 13:52:14] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
// Phase 1: matrix 24 rows 27 cols
[2023-03-20 13:52:14] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-20 13:52:14] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-20 13:52:14] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
[2023-03-20 13:52:14] [INFO ] Invariant cache hit.
[2023-03-20 13:52:14] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-20 13:52:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:52:14] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
[2023-03-20 13:52:14] [INFO ] Invariant cache hit.
[2023-03-20 13:52:15] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/139 places, 27/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 27/139 places, 27/168 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-06-LTLFireability-12 finished in 264 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (p1||G(p0)))||(F(p2)&&G(p3)))))'
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 168/168 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 126 transition count 155
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 126 transition count 155
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 126 transition count 154
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 120 transition count 148
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 120 transition count 148
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 118 transition count 146
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 118 transition count 146
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 117 transition count 145
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 117 transition count 145
Applied a total of 45 rules in 10 ms. Remains 117 /139 variables (removed 22) and now considering 145/168 (removed 23) transitions.
// Phase 1: matrix 145 rows 117 cols
[2023-03-20 13:52:15] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 13:52:15] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 13:52:15] [INFO ] Invariant cache hit.
[2023-03-20 13:52:15] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-20 13:52:15] [INFO ] Invariant cache hit.
[2023-03-20 13:52:15] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/139 places, 145/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 117/139 places, 145/168 transitions.
Stuttering acceptance computed with spot in 434 ms :[true, (OR (NOT p3) (NOT p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Running random walk in product with property : SmartHome-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p2 p3 (NOT p1) p0), acceptance={} source=6 dest: 3}, { cond=(AND p2 p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={} source=6 dest: 6}]], initial=2, aps=[p3:(EQ s92 0), p2:(EQ s13 0), p1:(AND (NEQ s61 1) (NEQ s13 1)), p0:(NEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p3 p2 p1 p0), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) p3 (NOT p1) p0))), (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0)))), (X (NOT (AND p2 p3 (NOT p1) p0))), (X (NOT (AND p2 p3 (NOT p1) (NOT p0)))), (X (X p3)), (X (X (AND p2 p3))), (X (X (NOT (AND (NOT p2) p3)))), true, (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND p3 (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p3 (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 p3 (NOT p1) p0)))), (X (X (NOT (AND p2 p3 (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p3 p2 p1 p0)
Knowledge based reduction with 21 factoid took 812 ms. Reduced automaton from 7 states, 19 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-06-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-06-LTLFireability-13 finished in 2073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 168/168 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 126 transition count 155
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 126 transition count 155
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 126 transition count 154
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 120 transition count 148
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 120 transition count 148
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 118 transition count 146
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 118 transition count 146
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 117 transition count 145
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 117 transition count 145
Applied a total of 45 rules in 10 ms. Remains 117 /139 variables (removed 22) and now considering 145/168 (removed 23) transitions.
// Phase 1: matrix 145 rows 117 cols
[2023-03-20 13:52:17] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 13:52:17] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-20 13:52:17] [INFO ] Invariant cache hit.
[2023-03-20 13:52:17] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-20 13:52:17] [INFO ] Invariant cache hit.
[2023-03-20 13:52:17] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/139 places, 145/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 117/139 places, 145/168 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SmartHome-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s36 0), p1:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 809 reset in 277 ms.
Product exploration explored 100000 steps with 801 reset in 327 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 742 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 85 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2098183 steps, run timeout after 3001 ms. (steps per millisecond=699 ) properties seen :{}
Probabilistic random walk after 2098183 steps, saw 346312 distinct states, run finished after 3006 ms. (steps per millisecond=697 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 13:52:22] [INFO ] Invariant cache hit.
[2023-03-20 13:52:22] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:52:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-20 13:52:22] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:52:22] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-20 13:52:22] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 145/145 transitions.
Graph (trivial) has 112 edges and 117 vertex of which 60 / 117 are part of one of the 5 SCC in 0 ms
Free SCC test removed 55 places
Drop transitions removed 77 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 131 edges and 62 vertex of which 60 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 60 transition count 45
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 33 place count 47 transition count 45
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 33 place count 47 transition count 39
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 45 place count 41 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 40 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 40 transition count 38
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 71 place count 28 transition count 26
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 80 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 5 rules applied. Total rules applied 76 place count 27 transition count 22
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 81 place count 27 transition count 17
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 86 place count 22 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 21 transition count 16
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 4 with 11 rules applied. Total rules applied 98 place count 17 transition count 9
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 105 place count 10 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 105 place count 10 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 111 place count 7 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 112 place count 6 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 114 place count 5 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 115 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 116 place count 4 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 117 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 117 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 120 place count 2 transition count 2
Applied a total of 120 rules in 28 ms. Remains 2 /117 variables (removed 115) and now considering 2/145 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 2/117 places, 2/145 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 13 factoid took 628 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 117 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 145/145 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2023-03-20 13:52:23] [INFO ] Invariant cache hit.
[2023-03-20 13:52:23] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-20 13:52:23] [INFO ] Invariant cache hit.
[2023-03-20 13:52:23] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-20 13:52:23] [INFO ] Invariant cache hit.
[2023-03-20 13:52:23] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 530 ms. Remains : 117/117 places, 145/145 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 80 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2174944 steps, run timeout after 3001 ms. (steps per millisecond=724 ) properties seen :{}
Probabilistic random walk after 2174944 steps, saw 351719 distinct states, run finished after 3001 ms. (steps per millisecond=724 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 13:52:27] [INFO ] Invariant cache hit.
[2023-03-20 13:52:27] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 13:52:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-20 13:52:27] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 13:52:27] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-20 13:52:27] [INFO ] After 166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 145/145 transitions.
Graph (trivial) has 112 edges and 117 vertex of which 60 / 117 are part of one of the 5 SCC in 1 ms
Free SCC test removed 55 places
Drop transitions removed 77 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 131 edges and 62 vertex of which 60 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 60 transition count 45
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 33 place count 47 transition count 45
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 33 place count 47 transition count 39
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 45 place count 41 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 40 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 40 transition count 38
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 71 place count 28 transition count 26
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 80 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 5 rules applied. Total rules applied 76 place count 27 transition count 22
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 81 place count 27 transition count 17
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 86 place count 22 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 21 transition count 16
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 4 with 11 rules applied. Total rules applied 98 place count 17 transition count 9
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 105 place count 10 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 105 place count 10 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 111 place count 7 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 112 place count 6 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 114 place count 5 transition count 5
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 115 place count 5 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 116 place count 4 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 117 place count 4 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 117 place count 4 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 120 place count 2 transition count 2
Applied a total of 120 rules in 25 ms. Remains 2 /117 variables (removed 115) and now considering 2/145 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 2/117 places, 2/145 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 831 reset in 236 ms.
Product exploration explored 100000 steps with 820 reset in 471 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 145/145 transitions.
Graph (trivial) has 112 edges and 117 vertex of which 60 / 117 are part of one of the 5 SCC in 1 ms
Free SCC test removed 55 places
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 62 transition count 69
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 14 place count 62 transition count 70
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 62 transition count 70
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 27 place count 54 transition count 62
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 35 place count 54 transition count 62
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 50 place count 54 transition count 63
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 55 place count 49 transition count 57
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 49 transition count 57
Deduced a syphon composed of 20 places in 0 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 49 transition count 48
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 141 edges and 47 vertex of which 45 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 1 with 3 rules applied. Total rules applied 72 place count 45 transition count 46
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 43 transition count 44
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 43 transition count 44
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 76 rules in 22 ms. Remains 43 /117 variables (removed 74) and now considering 44/145 (removed 101) transitions.
[2023-03-20 13:52:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:52:29] [INFO ] Flow matrix only has 40 transitions (discarded 4 similar events)
// Phase 1: matrix 40 rows 43 cols
[2023-03-20 13:52:29] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-20 13:52:29] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/117 places, 44/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 43/117 places, 44/145 transitions.
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 145/145 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 145/145 (removed 0) transitions.
// Phase 1: matrix 145 rows 117 cols
[2023-03-20 13:52:29] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 13:52:29] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-20 13:52:29] [INFO ] Invariant cache hit.
[2023-03-20 13:52:29] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-20 13:52:29] [INFO ] Invariant cache hit.
[2023-03-20 13:52:29] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 117/117 places, 145/145 transitions.
Treatment of property SmartHome-PT-06-LTLFireability-14 finished in 12573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&G(p1))))'
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 168/168 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 126 transition count 155
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 126 transition count 155
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 126 transition count 154
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 121 transition count 149
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 121 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 119 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 119 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 118 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 118 transition count 146
Applied a total of 43 rules in 12 ms. Remains 118 /139 variables (removed 21) and now considering 146/168 (removed 22) transitions.
// Phase 1: matrix 146 rows 118 cols
[2023-03-20 13:52:29] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 13:52:29] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-20 13:52:29] [INFO ] Invariant cache hit.
[2023-03-20 13:52:29] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-20 13:52:29] [INFO ] Invariant cache hit.
[2023-03-20 13:52:30] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/139 places, 146/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 118/139 places, 146/168 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : SmartHome-PT-06-LTLFireability-15 automaton TGBA Formula[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=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s60 1), p0:(EQ s60 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 527 steps with 4 reset in 3 ms.
FORMULA SmartHome-PT-06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-06-LTLFireability-15 finished in 644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Found a Lengthening insensitive property : SmartHome-PT-06-LTLFireability-14
Stuttering acceptance computed with spot in 189 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 139/139 places, 168/168 transitions.
Graph (trivial) has 132 edges and 139 vertex of which 63 / 139 are part of one of the 5 SCC in 0 ms
Free SCC test removed 58 places
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 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 80 transition count 69
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 60 transition count 67
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 59 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 58 transition count 66
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 46 place count 58 transition count 61
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 56 place count 53 transition count 61
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 64 place count 45 transition count 53
Iterating global reduction 4 with 8 rules applied. Total rules applied 72 place count 45 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 45 transition count 52
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 99 place count 32 transition count 39
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 107 place count 32 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 108 place count 31 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 110 place count 29 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 111 place count 28 transition count 29
Applied a total of 111 rules in 22 ms. Remains 28 /139 variables (removed 111) and now considering 29/168 (removed 139) transitions.
[2023-03-20 13:52:30] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 28 cols
[2023-03-20 13:52:30] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-20 13:52:30] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 13:52:30] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2023-03-20 13:52:30] [INFO ] Invariant cache hit.
[2023-03-20 13:52:30] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-20 13:52:30] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2023-03-20 13:52:30] [INFO ] Invariant cache hit.
[2023-03-20 13:52:30] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 28/139 places, 29/168 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 158 ms. Remains : 28/139 places, 29/168 transitions.
Running random walk in product with property : SmartHome-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s4 0), p1:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 8092 reset in 318 ms.
Product exploration explored 100000 steps with 8067 reset in 100 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 746 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1016 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 254 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 118 steps, run visited all 1 properties in 7 ms. (steps per millisecond=16 )
Probabilistic random walk after 118 steps, saw 85 distinct states, run finished after 7 ms. (steps per millisecond=16 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 741 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 29/29 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 29/29 (removed 0) transitions.
[2023-03-20 13:52:33] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2023-03-20 13:52:33] [INFO ] Invariant cache hit.
[2023-03-20 13:52:33] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-20 13:52:33] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2023-03-20 13:52:33] [INFO ] Invariant cache hit.
[2023-03-20 13:52:33] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-20 13:52:33] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
[2023-03-20 13:52:33] [INFO ] Invariant cache hit.
[2023-03-20 13:52:33] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 28/28 places, 29/29 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1011 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 253 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 118 steps, run visited all 1 properties in 7 ms. (steps per millisecond=16 )
Probabilistic random walk after 118 steps, saw 85 distinct states, run finished after 7 ms. (steps per millisecond=16 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 42563 steps with 3440 reset in 37 ms.
Treatment of property SmartHome-PT-06-LTLFireability-14 finished in 3693 ms.
FORMULA SmartHome-PT-06-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-20 13:52:34] [INFO ] Flatten gal took : 13 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 33383 ms.
ITS solved all properties within timeout

BK_STOP 1679320355795

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is SmartHome-PT-06, 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 r457-smll-167912649000196"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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