Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 8.1K Apr 29 15:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 29 15:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 29 15:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 15:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 09:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 9 09:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 54K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SmartHome-PT-05-LTLCardinality-00
FORMULA_NAME SmartHome-PT-05-LTLCardinality-01
FORMULA_NAME SmartHome-PT-05-LTLCardinality-02
FORMULA_NAME SmartHome-PT-05-LTLCardinality-03
FORMULA_NAME SmartHome-PT-05-LTLCardinality-04
FORMULA_NAME SmartHome-PT-05-LTLCardinality-05
FORMULA_NAME SmartHome-PT-05-LTLCardinality-06
FORMULA_NAME SmartHome-PT-05-LTLCardinality-07
FORMULA_NAME SmartHome-PT-05-LTLCardinality-08
FORMULA_NAME SmartHome-PT-05-LTLCardinality-09
FORMULA_NAME SmartHome-PT-05-LTLCardinality-10
FORMULA_NAME SmartHome-PT-05-LTLCardinality-11
FORMULA_NAME SmartHome-PT-05-LTLCardinality-12
FORMULA_NAME SmartHome-PT-05-LTLCardinality-13
FORMULA_NAME SmartHome-PT-05-LTLCardinality-14
FORMULA_NAME SmartHome-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653106596200

Running Version 202205111006
[2022-05-21 04:16:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 04:16:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:16:38] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2022-05-21 04:16:38] [INFO ] Transformed 213 places.
[2022-05-21 04:16:38] [INFO ] Transformed 245 transitions.
[2022-05-21 04:16:38] [INFO ] Found NUPN structural information;
[2022-05-21 04:16:38] [INFO ] Parsed PT model containing 213 places and 245 transitions in 318 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 17 places in 15 ms
Reduce places removed 17 places and 18 transitions.
FORMULA SmartHome-PT-05-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 227/227 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 151 transition count 182
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 151 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 93 place count 151 transition count 179
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 102 place count 142 transition count 170
Iterating global reduction 1 with 9 rules applied. Total rules applied 111 place count 142 transition count 170
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 120 place count 133 transition count 161
Iterating global reduction 1 with 9 rules applied. Total rules applied 129 place count 133 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 132 place count 130 transition count 158
Iterating global reduction 1 with 3 rules applied. Total rules applied 135 place count 130 transition count 158
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 129 transition count 157
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 129 transition count 157
Applied a total of 137 rules in 82 ms. Remains 129 /196 variables (removed 67) and now considering 157/227 (removed 70) transitions.
// Phase 1: matrix 157 rows 129 cols
[2022-05-21 04:16:38] [INFO ] Computed 10 place invariants in 11 ms
[2022-05-21 04:16:38] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 157 rows 129 cols
[2022-05-21 04:16:38] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-21 04:16:39] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
// Phase 1: matrix 157 rows 129 cols
[2022-05-21 04:16:39] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-21 04:16:39] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/196 places, 157/227 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/196 places, 157/227 transitions.
Support contains 19 out of 129 places after structural reductions.
[2022-05-21 04:16:39] [INFO ] Flatten gal took : 54 ms
[2022-05-21 04:16:39] [INFO ] Flatten gal took : 29 ms
[2022-05-21 04:16:39] [INFO ] Input system was already deterministic with 157 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 543 ms. (steps per millisecond=18 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 157 rows 129 cols
[2022-05-21 04:16:40] [INFO ] Computed 10 place invariants in 6 ms
[2022-05-21 04:16:40] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-21 04:16:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-21 04:16:40] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-21 04:16:40] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-05-21 04:16:40] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 129/129 places, 157/157 transitions.
Graph (trivial) has 118 edges and 129 vertex of which 45 / 129 are part of one of the 5 SCC in 13 ms
Free SCC test removed 40 places
Drop transitions removed 57 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 59 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 89 transition count 75
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 30 rules applied. Total rules applied 54 place count 66 transition count 68
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 62 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 60 transition count 66
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 62 place count 60 transition count 62
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 70 place count 56 transition count 62
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 76 place count 50 transition count 56
Iterating global reduction 4 with 6 rules applied. Total rules applied 82 place count 50 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 50 transition count 55
Performed 17 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 117 place count 33 transition count 35
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 92 edges and 33 vertex of which 31 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 9 rules applied. Total rules applied 126 place count 31 transition count 27
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 132 place count 31 transition count 21
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 138 place count 25 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 139 place count 24 transition count 20
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 3 rules applied. Total rules applied 142 place count 23 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 144 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 144 place count 21 transition count 16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 148 place count 19 transition count 16
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 9 with 2 rules applied. Total rules applied 150 place count 18 transition count 15
Applied a total of 150 rules in 57 ms. Remains 18 /129 variables (removed 111) and now considering 15/157 (removed 142) transitions.
Finished structural reductions, in 1 iterations. Remains : 18/129 places, 15/157 transitions.
Finished random walk after 73 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=14 )
Computed a total of 9 stabilizing places and 9 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X((G(p1)||!p1))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 157/157 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 121 transition count 149
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 121 transition count 149
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 121 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 120 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 120 transition count 147
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 119 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 119 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 119 transition count 145
Applied a total of 22 rules in 16 ms. Remains 119 /129 variables (removed 10) and now considering 145/157 (removed 12) transitions.
// Phase 1: matrix 145 rows 119 cols
[2022-05-21 04:16:41] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 04:16:41] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 145 rows 119 cols
[2022-05-21 04:16:41] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:16:41] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
// Phase 1: matrix 145 rows 119 cols
[2022-05-21 04:16:41] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:16:41] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/129 places, 145/157 transitions.
Finished structural reductions, in 1 iterations. Remains : 119/129 places, 145/157 transitions.
Stuttering acceptance computed with spot in 425 ms :[p0, false, (AND p0 (NOT p1)), false, false]
Running random walk in product with property : SmartHome-PT-05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(OR (EQ s79 0) (EQ s57 1)), p1:(OR (EQ s46 0) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 564 steps with 5 reset in 13 ms.
FORMULA SmartHome-PT-05-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLCardinality-01 finished in 1005 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(!X(p0) U p0)||p1)))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 157/157 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 148
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 120 transition count 147
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 117 transition count 144
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 117 transition count 144
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 115 transition count 142
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 115 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 115 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 114 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 114 transition count 140
Applied a total of 32 rules in 22 ms. Remains 114 /129 variables (removed 15) and now considering 140/157 (removed 17) transitions.
// Phase 1: matrix 140 rows 114 cols
[2022-05-21 04:16:42] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:16:42] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 140 rows 114 cols
[2022-05-21 04:16:42] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 04:16:42] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
// Phase 1: matrix 140 rows 114 cols
[2022-05-21 04:16:42] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 04:16:42] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/129 places, 140/157 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/129 places, 140/157 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), true]
Running random walk in product with property : SmartHome-PT-05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s4 0) (EQ s44 1)), p1:(EQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLCardinality-03 finished in 549 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 157/157 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 148
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 120 transition count 146
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 118 transition count 144
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 118 transition count 144
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 117 transition count 143
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 117 transition count 143
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 116 transition count 142
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 116 transition count 142
Applied a total of 28 rules in 13 ms. Remains 116 /129 variables (removed 13) and now considering 142/157 (removed 15) transitions.
// Phase 1: matrix 142 rows 116 cols
[2022-05-21 04:16:42] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:16:42] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 142 rows 116 cols
[2022-05-21 04:16:42] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:16:42] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 116 cols
[2022-05-21 04:16:42] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 04:16:43] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/129 places, 142/157 transitions.
Finished structural reductions, in 1 iterations. Remains : 116/129 places, 142/157 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s62 0) (EQ s54 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]]
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLCardinality-05 finished in 421 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 157/157 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 148
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 120 transition count 146
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 117 transition count 143
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 117 transition count 143
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 115 transition count 141
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 115 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 115 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 114 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 114 transition count 139
Applied a total of 33 rules in 12 ms. Remains 114 /129 variables (removed 15) and now considering 139/157 (removed 18) transitions.
// Phase 1: matrix 139 rows 114 cols
[2022-05-21 04:16:43] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:16:43] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 139 rows 114 cols
[2022-05-21 04:16:43] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-21 04:16:43] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 139 rows 114 cols
[2022-05-21 04:16:43] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:16:43] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 114/129 places, 139/157 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/129 places, 139/157 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s84 0) (EQ s32 1) (EQ s18 0) (EQ s47 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 33333 reset in 383 ms.
Product exploration explored 100000 steps with 33333 reset in 248 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA SmartHome-PT-05-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-05-LTLCardinality-06 finished in 1123 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 157/157 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 118 transition count 146
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 118 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 118 transition count 144
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 116 transition count 142
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 116 transition count 142
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 114 transition count 140
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 114 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 114 transition count 139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 113 transition count 138
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 113 transition count 138
Applied a total of 35 rules in 6 ms. Remains 113 /129 variables (removed 16) and now considering 138/157 (removed 19) transitions.
// Phase 1: matrix 138 rows 113 cols
[2022-05-21 04:16:44] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:16:44] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 138 rows 113 cols
[2022-05-21 04:16:44] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-21 04:16:44] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 113 cols
[2022-05-21 04:16:44] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 04:16:44] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/129 places, 138/157 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/129 places, 138/157 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : SmartHome-PT-05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s23 0) (NEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-05-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLCardinality-12 finished in 599 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(p0)) U G(F(G(p0))))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 157/157 transitions.
Graph (trivial) has 123 edges and 129 vertex of which 63 / 129 are part of one of the 5 SCC in 0 ms
Free SCC test removed 58 places
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 70 transition count 63
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 54 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 52 transition count 59
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 39 place count 52 transition count 55
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 47 place count 48 transition count 55
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 50 place count 45 transition count 52
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 45 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 45 transition count 51
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 86 place count 29 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 87 place count 29 transition count 33
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 94 place count 29 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 95 place count 28 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 97 place count 26 transition count 24
Applied a total of 97 rules in 20 ms. Remains 26 /129 variables (removed 103) and now considering 24/157 (removed 133) transitions.
[2022-05-21 04:16:44] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
// Phase 1: matrix 20 rows 26 cols
[2022-05-21 04:16:44] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 04:16:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-21 04:16:45] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
// Phase 1: matrix 20 rows 26 cols
[2022-05-21 04:16:45] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-21 04:16:45] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-05-21 04:16:45] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-21 04:16:45] [INFO ] Flow matrix only has 20 transitions (discarded 4 similar events)
// Phase 1: matrix 20 rows 26 cols
[2022-05-21 04:16:45] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-21 04:16:45] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/129 places, 24/157 transitions.
Finished structural reductions, in 1 iterations. Remains : 26/129 places, 24/157 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s6 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 16 steps with 2 reset in 0 ms.
FORMULA SmartHome-PT-05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLCardinality-13 finished in 193 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p0))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 157/157 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 118 transition count 146
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 118 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 118 transition count 144
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 115 transition count 141
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 115 transition count 141
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 113 transition count 139
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 113 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 113 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 112 transition count 137
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 112 transition count 137
Applied a total of 37 rules in 7 ms. Remains 112 /129 variables (removed 17) and now considering 137/157 (removed 20) transitions.
// Phase 1: matrix 137 rows 112 cols
[2022-05-21 04:16:45] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:16:45] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 137 rows 112 cols
[2022-05-21 04:16:45] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:16:45] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 137 rows 112 cols
[2022-05-21 04:16:45] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-21 04:16:45] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/129 places, 137/157 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/129 places, 137/157 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLCardinality-15 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:(OR (EQ s101 0) (EQ s7 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]]
Product exploration explored 100000 steps with 812 reset in 534 ms.
Product exploration explored 100000 steps with 842 reset in 279 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 84 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1926522 steps, run timeout after 3001 ms. (steps per millisecond=641 ) properties seen :{}
Probabilistic random walk after 1926522 steps, saw 315987 distinct states, run finished after 3002 ms. (steps per millisecond=641 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 137 rows 112 cols
[2022-05-21 04:16:49] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-21 04:16:49] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 04:16:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-05-21 04:16:49] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 04:16:49] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-21 04:16:49] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 112/112 places, 137/137 transitions.
Graph (trivial) has 107 edges and 112 vertex of which 60 / 112 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 122 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 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 17 rules applied. Total rules applied 19 place count 55 transition count 38
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 32 place count 42 transition count 38
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 32 place count 42 transition count 34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 38 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 37 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 37 transition count 33
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 62 place count 27 transition count 23
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 81 edges and 27 vertex of which 26 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 67 place count 26 transition count 19
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 72 place count 26 transition count 14
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 77 place count 21 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 20 transition count 13
Reduce places removed 2 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 4 with 5 rules applied. Total rules applied 83 place count 18 transition count 10
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 86 place count 15 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 86 place count 15 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 90 place count 13 transition count 8
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 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 93 place count 11 transition count 7
Applied a total of 93 rules in 24 ms. Remains 11 /112 variables (removed 101) and now considering 7/137 (removed 130) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/112 places, 7/137 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 276 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 112 /112 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 112 cols
[2022-05-21 04:16:50] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-21 04:16:50] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 137 rows 112 cols
[2022-05-21 04:16:50] [INFO ] Computed 10 place invariants in 6 ms
[2022-05-21 04:16:50] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
// Phase 1: matrix 137 rows 112 cols
[2022-05-21 04:16:50] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-21 04:16:50] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 137/137 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 188 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 83 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1941705 steps, run timeout after 3001 ms. (steps per millisecond=647 ) properties seen :{}
Probabilistic random walk after 1941705 steps, saw 319916 distinct states, run finished after 3001 ms. (steps per millisecond=647 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 137 rows 112 cols
[2022-05-21 04:16:54] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-21 04:16:54] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 04:16:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-05-21 04:16:54] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 04:16:54] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-05-21 04:16:54] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 112/112 places, 137/137 transitions.
Graph (trivial) has 107 edges and 112 vertex of which 60 / 112 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 122 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 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 17 rules applied. Total rules applied 19 place count 55 transition count 38
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 32 place count 42 transition count 38
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 32 place count 42 transition count 34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 38 transition count 34
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 37 transition count 33
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 37 transition count 33
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 62 place count 27 transition count 23
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 81 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 5 rules applied. Total rules applied 67 place count 26 transition count 19
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 72 place count 26 transition count 14
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 77 place count 21 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 20 transition count 13
Reduce places removed 2 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 4 with 5 rules applied. Total rules applied 83 place count 18 transition count 10
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 86 place count 15 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 86 place count 15 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 90 place count 13 transition count 8
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 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 93 place count 11 transition count 7
Applied a total of 93 rules in 18 ms. Remains 11 /112 variables (removed 101) and now considering 7/137 (removed 130) transitions.
Finished structural reductions, in 1 iterations. Remains : 11/112 places, 7/137 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 83021 steps with 697 reset in 161 ms.
FORMULA SmartHome-PT-05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLCardinality-15 finished in 9819 ms.
All properties solved by simple procedures.
Total runtime 16950 ms.

BK_STOP 1653106615267

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r240-smll-165303241500227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-05.tgz
mv SmartHome-PT-05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;