Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 12 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 56K May 18 16:43 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-LTLCardinality-00
FORMULA_NAME SmartHome-PT-06-LTLCardinality-01
FORMULA_NAME SmartHome-PT-06-LTLCardinality-02
FORMULA_NAME SmartHome-PT-06-LTLCardinality-03
FORMULA_NAME SmartHome-PT-06-LTLCardinality-04
FORMULA_NAME SmartHome-PT-06-LTLCardinality-05
FORMULA_NAME SmartHome-PT-06-LTLCardinality-06
FORMULA_NAME SmartHome-PT-06-LTLCardinality-07
FORMULA_NAME SmartHome-PT-06-LTLCardinality-08
FORMULA_NAME SmartHome-PT-06-LTLCardinality-09
FORMULA_NAME SmartHome-PT-06-LTLCardinality-10
FORMULA_NAME SmartHome-PT-06-LTLCardinality-11
FORMULA_NAME SmartHome-PT-06-LTLCardinality-12
FORMULA_NAME SmartHome-PT-06-LTLCardinality-13
FORMULA_NAME SmartHome-PT-06-LTLCardinality-14
FORMULA_NAME SmartHome-PT-06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716999610334

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 16:20:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 16:20:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 16:20:12] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-29 16:20:12] [INFO ] Transformed 219 places.
[2024-05-29 16:20:12] [INFO ] Transformed 254 transitions.
[2024-05-29 16:20:12] [INFO ] Found NUPN structural information;
[2024-05-29 16:20:12] [INFO ] Parsed PT model containing 219 places and 254 transitions and 581 arcs in 284 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 1 formulas.
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 18 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 151 transition count 185
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 151 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 106 place count 151 transition count 181
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 144 transition count 174
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 144 transition count 174
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 126 place count 138 transition count 168
Iterating global reduction 1 with 6 rules applied. Total rules applied 132 place count 138 transition count 168
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 136 transition count 166
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 136 transition count 166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 135 transition count 165
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 135 transition count 165
Applied a total of 138 rules in 115 ms. Remains 135 /202 variables (removed 67) and now considering 165/236 (removed 71) transitions.
// Phase 1: matrix 165 rows 135 cols
[2024-05-29 16:20:12] [INFO ] Computed 9 invariants in 23 ms
[2024-05-29 16:20:13] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-29 16:20:13] [INFO ] Invariant cache hit.
[2024-05-29 16:20:13] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-29 16:20:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 16:20:15] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 24 ms to minimize.
[2024-05-29 16:20:15] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 2 ms to minimize.
[2024-05-29 16:20:15] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-05-29 16:20:15] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-29 16:20:15] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 2 ms to minimize.
[2024-05-29 16:20:15] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 2 ms to minimize.
[2024-05-29 16:20:16] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 2 ms to minimize.
[2024-05-29 16:20:16] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/300 variables, 135/152 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/300 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 152 constraints, problems are : Problem set: 0 solved, 164 unsolved in 6895 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 16:20:21] [INFO ] Deduced a trap composed of 97 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 16:20:22] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 16:20:23] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-29 16:20:23] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 165/300 variables, 135/156 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 164/320 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-29 16:20:24] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-29 16:20:24] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 13 ms to minimize.
[2024-05-29 16:20:25] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 0/300 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 323 constraints, problems are : Problem set: 0 solved, 164 unsolved in 9320 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 15/15 constraints]
After SMT, in 16322ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 16346ms
Starting structural reductions in LTL mode, iteration 1 : 135/202 places, 165/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17059 ms. Remains : 135/202 places, 165/236 transitions.
Support contains 23 out of 135 places after structural reductions.
[2024-05-29 16:20:30] [INFO ] Flatten gal took : 58 ms
[2024-05-29 16:20:30] [INFO ] Flatten gal took : 23 ms
[2024-05-29 16:20:30] [INFO ] Input system was already deterministic with 165 transitions.
Support contains 21 out of 135 places (down from 23) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 37035 steps (288 resets) in 841 ms. (43 steps per ms) remains 0/12 properties
FORMULA SmartHome-PT-06-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 12 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 165/165 transitions.
Graph (trivial) has 130 edges and 135 vertex of which 54 / 135 are part of one of the 5 SCC in 4 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 (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 85 transition count 74
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 30 rules applied. Total rules applied 55 place count 61 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 58 transition count 68
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 58 place count 58 transition count 62
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 70 place count 52 transition count 62
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 75 place count 47 transition count 57
Iterating global reduction 3 with 5 rules applied. Total rules applied 80 place count 47 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 81 place count 47 transition count 56
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 113 place count 31 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 122 place count 31 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 124 place count 29 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 126 place count 27 transition count 28
Applied a total of 126 rules in 47 ms. Remains 27 /135 variables (removed 108) and now considering 28/165 (removed 137) transitions.
[2024-05-29 16:20:30] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 27 cols
[2024-05-29 16:20:30] [INFO ] Computed 7 invariants in 1 ms
[2024-05-29 16:20:30] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 16:20:30] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2024-05-29 16:20:30] [INFO ] Invariant cache hit.
[2024-05-29 16:20:30] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-29 16:20:30] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-29 16:20:30] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2024-05-29 16:20:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 23/50 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/51 variables, and 34 constraints, problems are : Problem set: 0 solved, 16 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 23/50 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/51 variables, and 50 constraints, problems are : Problem set: 0 solved, 16 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 493ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 494ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/135 places, 28/165 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 655 ms. Remains : 27/135 places, 28/165 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-06-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-06-LTLCardinality-00 finished in 1014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 165/165 transitions.
Graph (trivial) has 128 edges and 135 vertex of which 54 / 135 are part of one of the 5 SCC in 0 ms
Free SCC test removed 49 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 85 transition count 79
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 65 transition count 77
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 64 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 63 transition count 76
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 46 place count 63 transition count 68
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 62 place count 55 transition count 68
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 66 place count 51 transition count 64
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 51 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 51 transition count 63
Performed 19 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 109 place count 32 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 117 place count 32 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 118 place count 31 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 119 place count 31 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 120 place count 31 transition count 32
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 122 place count 29 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 123 place count 28 transition count 30
Applied a total of 123 rules in 26 ms. Remains 28 /135 variables (removed 107) and now considering 30/165 (removed 135) transitions.
[2024-05-29 16:20:31] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 28 cols
[2024-05-29 16:20:31] [INFO ] Computed 7 invariants in 0 ms
[2024-05-29 16:20:31] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 16:20:31] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-05-29 16:20:31] [INFO ] Invariant cache hit.
[2024-05-29 16:20:31] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-29 16:20:31] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-29 16:20:31] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-05-29 16:20:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 25/53 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/54 variables, and 35 constraints, problems are : Problem set: 0 solved, 17 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 25/53 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/54 variables, and 52 constraints, problems are : Problem set: 0 solved, 17 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 498ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 498ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/135 places, 30/165 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 622 ms. Remains : 28/135 places, 30/165 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-06-LTLCardinality-01
Stuttering criterion allowed to conclude after 14 steps with 1 reset in 0 ms.
FORMULA SmartHome-PT-06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-06-LTLCardinality-01 finished in 677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((G(X((G(p0) U G(p1)))) U p2)))))'
Support contains 2 out of 135 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 165/165 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 128 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 128 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 128 transition count 157
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 125 transition count 154
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 125 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 124 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 124 transition count 153
Applied a total of 23 rules in 11 ms. Remains 124 /135 variables (removed 11) and now considering 153/165 (removed 12) transitions.
// Phase 1: matrix 153 rows 124 cols
[2024-05-29 16:20:32] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 16:20:32] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 16:20:32] [INFO ] Invariant cache hit.
[2024-05-29 16:20:32] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-29 16:20:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-29 16:20:33] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-29 16:20:33] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-29 16:20:33] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 2 ms to minimize.
[2024-05-29 16:20:34] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-29 16:20:34] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-05-29 16:20:34] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-29 16:20:34] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-29 16:20:34] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-29 16:20:35] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-29 16:20:35] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-29 16:20:36] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/277 variables, 124/144 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 144 constraints, problems are : Problem set: 0 solved, 152 unsolved in 6701 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-29 16:20:40] [INFO ] Deduced a trap composed of 88 places in 62 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 153/277 variables, 124/145 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 152/297 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 297 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4859 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 12/12 constraints]
After SMT, in 11598ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 11601ms
Starting structural reductions in LTL mode, iteration 1 : 124/135 places, 153/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11824 ms. Remains : 124/135 places, 153/165 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : SmartHome-PT-06-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 342 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 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-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-06-LTLCardinality-08 finished in 12467 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 165/165 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 125 transition count 155
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 125 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 125 transition count 153
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 121 transition count 149
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 121 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 119 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 119 transition count 147
Applied a total of 34 rules in 6 ms. Remains 119 /135 variables (removed 16) and now considering 147/165 (removed 18) transitions.
// Phase 1: matrix 147 rows 119 cols
[2024-05-29 16:20:44] [INFO ] Computed 9 invariants in 5 ms
[2024-05-29 16:20:44] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 16:20:44] [INFO ] Invariant cache hit.
[2024-05-29 16:20:45] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-29 16:20:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-29 16:20:46] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-29 16:20:46] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2024-05-29 16:20:46] [INFO ] Deduced a trap composed of 86 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/266 variables, 119/131 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 131 constraints, problems are : Problem set: 0 solved, 146 unsolved in 4477 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/266 variables, 119/131 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 146/277 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 277 constraints, problems are : Problem set: 0 solved, 146 unsolved in 3774 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 3/3 constraints]
After SMT, in 8276ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 8279ms
Starting structural reductions in LTL mode, iteration 1 : 119/135 places, 147/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8484 ms. Remains : 119/135 places, 147/165 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-06-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 190 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 p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 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-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-06-LTLCardinality-09 finished in 8865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||X(F((X(F(p2))&&p1)))))))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 165/165 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 125 transition count 155
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 125 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 125 transition count 153
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 120 transition count 148
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 120 transition count 148
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 117 transition count 145
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 117 transition count 145
Applied a total of 38 rules in 11 ms. Remains 117 /135 variables (removed 18) and now considering 145/165 (removed 20) transitions.
// Phase 1: matrix 145 rows 117 cols
[2024-05-29 16:20:53] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 16:20:53] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-29 16:20:53] [INFO ] Invariant cache hit.
[2024-05-29 16:20:53] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-29 16:20:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 16:20:55] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-05-29 16:20:55] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 128 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4695 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 144/272 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 16:21:01] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/262 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 273 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6336 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints]
After SMT, in 11057ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 11060ms
Starting structural reductions in LTL mode, iteration 1 : 117/135 places, 145/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11295 ms. Remains : 117/135 places, 145/165 transitions.
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SmartHome-PT-06-LTLCardinality-12
Stuttering criterion allowed to conclude after 413 steps with 4 reset in 3 ms.
FORMULA SmartHome-PT-06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-06-LTLCardinality-12 finished in 11596 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0&&X(!p1))) U G((F(p1)||X(p2)))))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 165/165 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 125 transition count 155
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 125 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 125 transition count 153
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 120 transition count 148
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 120 transition count 148
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 117 transition count 145
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 117 transition count 145
Applied a total of 38 rules in 8 ms. Remains 117 /135 variables (removed 18) and now considering 145/165 (removed 20) transitions.
// Phase 1: matrix 145 rows 117 cols
[2024-05-29 16:21:05] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 16:21:05] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 16:21:05] [INFO ] Invariant cache hit.
[2024-05-29 16:21:05] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-29 16:21:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 16:21:06] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-29 16:21:06] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 2 ms to minimize.
[2024-05-29 16:21:06] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 129 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4725 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 144/273 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 16:21:12] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 274 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4553 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 4/4 constraints]
After SMT, in 9305ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 9307ms
Starting structural reductions in LTL mode, iteration 1 : 117/135 places, 145/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9535 ms. Remains : 117/135 places, 145/165 transitions.
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p1), false, (AND (NOT p1) (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : SmartHome-PT-06-LTLCardinality-13
Product exploration explored 100000 steps with 25073 reset in 83 ms.
Product exploration explored 100000 steps with 25019 reset in 169 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 : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 168 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p1), false, (AND (NOT p1) (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (314 resets) in 630 ms. (63 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40001 steps (59 resets) in 93 ms. (425 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (61 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
[2024-05-29 16:21:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/117 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 145/262 variables, 117/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 126 constraints, problems are : Problem set: 0 solved, 2 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 81/87 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/117 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 145/262 variables, 117/126 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 127 constraints, problems are : Problem set: 1 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 283ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 1800 steps, including 34 resets, run visited all 1 properties in 8 ms. (steps per millisecond=225 )
Parikh walk visited 1 properties in 13 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 17 factoid took 439 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 4 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.
[2024-05-29 16:21:17] [INFO ] Invariant cache hit.
[2024-05-29 16:21:17] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 16:21:17] [INFO ] Invariant cache hit.
[2024-05-29 16:21:17] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-29 16:21:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 16:21:18] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-29 16:21:18] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2024-05-29 16:21:18] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 129 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4715 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 144/273 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 16:21:24] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 274 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4476 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 4/4 constraints]
After SMT, in 9215ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 9217ms
Finished structural reductions in LTL mode , in 1 iterations and 9394 ms. Remains : 117/117 places, 145/145 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
RANDOM walk for 31301 steps (258 resets) in 91 ms. (340 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 1035 reset in 118 ms.
Product exploration explored 100000 steps with 1028 reset in 383 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 4 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 107 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
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 62 transition count 69
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 10 place count 62 transition count 70
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 62 transition count 70
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 57 transition count 65
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 57 transition count 65
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 40 place count 57 transition count 66
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 54 transition count 62
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 54 transition count 62
Deduced a syphon composed of 21 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 54 transition count 56
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 159 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 52 transition count 55
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 51 transition count 54
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 51 transition count 54
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 56 rules in 23 ms. Remains 51 /117 variables (removed 66) and now considering 54/145 (removed 91) transitions.
[2024-05-29 16:21:28] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-29 16:21:28] [INFO ] Flow matrix only has 50 transitions (discarded 4 similar events)
// Phase 1: matrix 50 rows 51 cols
[2024-05-29 16:21:28] [INFO ] Computed 8 invariants in 1 ms
[2024-05-29 16:21:28] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-29 16:21:28] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-29 16:21:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-29 16:21:28] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-29 16:21:28] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-29 16:21:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-29 16:21:28] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-29 16:21:28] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-29 16:21:28] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/16 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 49/100 variables, 51/67 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/87 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/87 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/101 variables, 1/88 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/88 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/88 constraints. Problems are: Problem set: 20 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 88 constraints, problems are : Problem set: 20 solved, 33 unsolved in 1203 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 20 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 20/51 variables, 8/8 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/16 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 49/100 variables, 51/67 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/87 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 33/120 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/120 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/101 variables, 1/121 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/121 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/101 variables, 0/121 constraints. Problems are: Problem set: 20 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 121 constraints, problems are : Problem set: 20 solved, 33 unsolved in 846 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 33/53 constraints, Known Traps: 8/8 constraints]
After SMT, in 2065ms problems are : Problem set: 20 solved, 33 unsolved
Search for dead transitions found 20 dead transitions in 2066ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 51/117 places, 34/145 transitions.
Graph (complete) has 113 edges and 51 vertex of which 32 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 32 /51 variables (removed 19) and now considering 34/34 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/117 places, 34/145 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2097 ms. Remains : 32/117 places, 34/145 transitions.
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 145/145 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 116 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 116 transition count 144
Applied a total of 2 rules in 3 ms. Remains 116 /117 variables (removed 1) and now considering 144/145 (removed 1) transitions.
// Phase 1: matrix 144 rows 116 cols
[2024-05-29 16:21:30] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 16:21:30] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 16:21:30] [INFO ] Invariant cache hit.
[2024-05-29 16:21:30] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-29 16:21:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-29 16:21:31] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-29 16:21:31] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 3 ms to minimize.
[2024-05-29 16:21:31] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/260 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 128 constraints, problems are : Problem set: 0 solved, 143 unsolved in 4578 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/260 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 143/271 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-29 16:21:36] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-29 16:21:36] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-29 16:21:37] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/260 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 274 constraints, problems are : Problem set: 0 solved, 143 unsolved in 5612 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 6/6 constraints]
After SMT, in 10209ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 10211ms
Starting structural reductions in LTL mode, iteration 1 : 116/117 places, 144/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10395 ms. Remains : 116/117 places, 144/145 transitions.
Treatment of property SmartHome-PT-06-LTLCardinality-13 finished in 35672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0&&X(!p1))) U G((F(p1)||X(p2)))))'
Found a Lengthening insensitive property : SmartHome-PT-06-LTLCardinality-13
Stuttering acceptance computed with spot in 402 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p1), false, (AND (NOT p1) (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 135/135 places, 165/165 transitions.
Graph (trivial) has 123 edges and 135 vertex of which 59 / 135 are part of one of the 5 SCC in 1 ms
Free SCC test removed 54 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 80 transition count 79
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 67 transition count 77
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 33 place count 66 transition count 74
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 37 place count 63 transition count 73
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 37 place count 63 transition count 65
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 53 place count 55 transition count 65
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 56 place count 52 transition count 62
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 52 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 52 transition count 61
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 90 place count 37 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 96 place count 37 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 97 place count 36 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 99 place count 34 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 100 place count 33 transition count 37
Applied a total of 100 rules in 25 ms. Remains 33 /135 variables (removed 102) and now considering 37/165 (removed 128) transitions.
[2024-05-29 16:21:41] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 33 cols
[2024-05-29 16:21:41] [INFO ] Computed 7 invariants in 0 ms
[2024-05-29 16:21:41] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 16:21:41] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
[2024-05-29 16:21:41] [INFO ] Invariant cache hit.
[2024-05-29 16:21:41] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 22 sub problems to find dead transitions.
[2024-05-29 16:21:41] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
[2024-05-29 16:21:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 32/65 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/66 variables, and 40 constraints, problems are : Problem set: 0 solved, 22 unsolved in 295 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 32/65 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/66 variables, and 62 constraints, problems are : Problem set: 0 solved, 22 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 598ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 598ms
Starting structural reductions in LI_LTL mode, iteration 1 : 33/135 places, 37/165 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 708 ms. Remains : 33/135 places, 37/165 transitions.
Running random walk in product with property : SmartHome-PT-06-LTLCardinality-13
Product exploration explored 100000 steps with 25154 reset in 216 ms.
Product exploration explored 100000 steps with 25056 reset in 217 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 p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 410 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p1), false, (AND (NOT p1) (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (2205 resets) in 307 ms. (129 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (559 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
[2024-05-29 16:21:43] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
[2024-05-29 16:21:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/59 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/65 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/66 variables, and 40 constraints, problems are : Problem set: 0 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 29/66 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p2 p0 p1))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 601 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 4 out of 33 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 37/37 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2024-05-29 16:21:44] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
[2024-05-29 16:21:44] [INFO ] Invariant cache hit.
[2024-05-29 16:21:44] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 16:21:44] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
[2024-05-29 16:21:44] [INFO ] Invariant cache hit.
[2024-05-29 16:21:44] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 22 sub problems to find dead transitions.
[2024-05-29 16:21:44] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
[2024-05-29 16:21:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 32/65 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/66 variables, and 40 constraints, problems are : Problem set: 0 solved, 22 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 32/65 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/66 variables, and 62 constraints, problems are : Problem set: 0 solved, 22 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 643ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 644ms
Finished structural reductions in LTL mode , in 1 iterations and 733 ms. Remains : 33/33 places, 37/37 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 : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
RANDOM walk for 19610 steps (1103 resets) in 34 ms. (560 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 288 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering criterion allowed to conclude after 6546 steps with 419 reset in 11 ms.
Treatment of property SmartHome-PT-06-LTLCardinality-13 finished in 5326 ms.
FORMULA SmartHome-PT-06-LTLCardinality-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-29 16:21:46] [INFO ] Flatten gal took : 13 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 94131 ms.
ITS solved all properties within timeout

BK_STOP 1716999706370

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="LTLCardinality"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is SmartHome-PT-06, 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 r377-smll-171683810300379"
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 [ "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 ;