About the Execution of ITS-Tools for SmartHome-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 435.088 | 191725.00 | 247198.00 | 837.10 | FFTFTFTTFTTTFFFF | normal |
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.r378-smll-171683811400395.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 itstools
Input is SmartHome-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683811400395
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.5K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 03:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 03:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 03:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 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 64K 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-08-LTLCardinality-00
FORMULA_NAME SmartHome-PT-08-LTLCardinality-01
FORMULA_NAME SmartHome-PT-08-LTLCardinality-02
FORMULA_NAME SmartHome-PT-08-LTLCardinality-03
FORMULA_NAME SmartHome-PT-08-LTLCardinality-04
FORMULA_NAME SmartHome-PT-08-LTLCardinality-05
FORMULA_NAME SmartHome-PT-08-LTLCardinality-06
FORMULA_NAME SmartHome-PT-08-LTLCardinality-07
FORMULA_NAME SmartHome-PT-08-LTLCardinality-08
FORMULA_NAME SmartHome-PT-08-LTLCardinality-09
FORMULA_NAME SmartHome-PT-08-LTLCardinality-10
FORMULA_NAME SmartHome-PT-08-LTLCardinality-11
FORMULA_NAME SmartHome-PT-08-LTLCardinality-12
FORMULA_NAME SmartHome-PT-08-LTLCardinality-13
FORMULA_NAME SmartHome-PT-08-LTLCardinality-14
FORMULA_NAME SmartHome-PT-08-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717031533228
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 01:12:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 01:12:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:12:16] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2024-05-30 01:12:16] [INFO ] Transformed 252 places.
[2024-05-30 01:12:16] [INFO ] Transformed 291 transitions.
[2024-05-30 01:12:16] [INFO ] Found NUPN structural information;
[2024-05-30 01:12:16] [INFO ] Parsed PT model containing 252 places and 291 transitions and 664 arcs in 450 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 21 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SmartHome-PT-08-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 270/270 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 181 transition count 219
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 181 transition count 219
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 107 place count 181 transition count 214
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 115 place count 173 transition count 206
Iterating global reduction 1 with 8 rules applied. Total rules applied 123 place count 173 transition count 206
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 129 place count 167 transition count 200
Iterating global reduction 1 with 6 rules applied. Total rules applied 135 place count 167 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 136 place count 166 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 137 place count 166 transition count 199
Applied a total of 137 rules in 158 ms. Remains 166 /232 variables (removed 66) and now considering 199/270 (removed 71) transitions.
// Phase 1: matrix 199 rows 166 cols
[2024-05-30 01:12:16] [INFO ] Computed 11 invariants in 44 ms
[2024-05-30 01:12:17] [INFO ] Implicit Places using invariants in 446 ms returned []
[2024-05-30 01:12:17] [INFO ] Invariant cache hit.
[2024-05-30 01:12:17] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-05-30 01:12:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 01:12:20] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 37 ms to minimize.
[2024-05-30 01:12:21] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 4 ms to minimize.
[2024-05-30 01:12:21] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 3 ms to minimize.
[2024-05-30 01:12:21] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 3 ms to minimize.
[2024-05-30 01:12:21] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 2 ms to minimize.
[2024-05-30 01:12:21] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 3 ms to minimize.
[2024-05-30 01:12:21] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-30 01:12:21] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 2 ms to minimize.
[2024-05-30 01:12:22] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 01:12:23] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/365 variables, 166/187 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/365 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 187 constraints, problems are : Problem set: 0 solved, 198 unsolved in 14124 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/166 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/365 variables, 166/187 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 198/385 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-05-30 01:12:35] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:12:35] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 387 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12748 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 12/12 constraints]
After SMT, in 27047ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 27092ms
Starting structural reductions in LTL mode, iteration 1 : 166/232 places, 199/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28158 ms. Remains : 166/232 places, 199/270 transitions.
Support contains 37 out of 166 places after structural reductions.
[2024-05-30 01:12:45] [INFO ] Flatten gal took : 88 ms
[2024-05-30 01:12:45] [INFO ] Flatten gal took : 35 ms
[2024-05-30 01:12:45] [INFO ] Input system was already deterministic with 199 transitions.
Support contains 36 out of 166 places (down from 37) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 6351 steps (39 resets) in 574 ms. (11 steps per ms) remains 0/19 properties
FORMULA SmartHome-PT-08-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 18 stabilizing places and 18 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' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 199/199 transitions.
Graph (trivial) has 155 edges and 166 vertex of which 58 / 166 are part of one of the 6 SCC in 3 ms
Free SCC test removed 52 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 113 transition count 98
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 44 rules applied. Total rules applied 79 place count 79 transition count 88
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 84 place count 74 transition count 88
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 84 place count 74 transition count 80
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 100 place count 66 transition count 80
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 105 place count 61 transition count 75
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 3 rules applied. Total rules applied 113 place count 61 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 60 transition count 72
Performed 23 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 5 with 46 rules applied. Total rules applied 160 place count 37 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 170 place count 37 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 171 place count 36 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 173 place count 34 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 174 place count 33 transition count 34
Applied a total of 174 rules in 50 ms. Remains 33 /166 variables (removed 133) and now considering 34/199 (removed 165) transitions.
[2024-05-30 01:12:45] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
// Phase 1: matrix 29 rows 33 cols
[2024-05-30 01:12:45] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:12:45] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-30 01:12:45] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
[2024-05-30 01:12:45] [INFO ] Invariant cache hit.
[2024-05-30 01:12:45] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-30 01:12:45] [INFO ] Redundant transitions in 1 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-30 01:12:45] [INFO ] Flow matrix only has 29 transitions (discarded 5 similar events)
[2024-05-30 01:12:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 28/61 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/61 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/62 variables, and 42 constraints, problems are : Problem set: 0 solved, 18 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 2/33 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 28/61 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 18/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/61 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/62 variables, and 60 constraints, problems are : Problem set: 0 solved, 18 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 720ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 721ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/166 places, 34/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 937 ms. Remains : 33/166 places, 34/199 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-08-LTLCardinality-00
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLCardinality-00 finished in 1381 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)||G(p1))))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 199/199 transitions.
Graph (trivial) has 155 edges and 166 vertex of which 77 / 166 are part of one of the 6 SCC in 0 ms
Free SCC test removed 71 places
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 94 transition count 85
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 28 rules applied. Total rules applied 52 place count 71 transition count 80
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 55 place count 69 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 68 transition count 79
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 56 place count 68 transition count 73
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 68 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 70 place count 60 transition count 71
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 60 transition count 71
Performed 22 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 116 place count 38 transition count 47
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 125 place count 38 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 37 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 128 place count 35 transition count 36
Applied a total of 128 rules in 43 ms. Remains 35 /166 variables (removed 131) and now considering 36/199 (removed 163) transitions.
[2024-05-30 01:12:47] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 35 cols
[2024-05-30 01:12:47] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 01:12:47] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 01:12:47] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-30 01:12:47] [INFO ] Invariant cache hit.
[2024-05-30 01:12:47] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-30 01:12:47] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-30 01:12:47] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-30 01:12:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 3/35 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 30/65 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/66 variables, and 45 constraints, problems are : Problem set: 0 solved, 19 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 3/35 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 30/65 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/66 variables, and 64 constraints, problems are : Problem set: 0 solved, 19 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 884ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 885ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/166 places, 36/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1087 ms. Remains : 35/166 places, 36/199 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-08-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-08-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLCardinality-01 finished in 1173 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||G(F(p1)))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 199/199 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 182
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 149 transition count 181
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 141 transition count 173
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 141 transition count 173
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 136 transition count 168
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 136 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 136 transition count 167
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 134 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 134 transition count 165
Applied a total of 66 rules in 24 ms. Remains 134 /166 variables (removed 32) and now considering 165/199 (removed 34) transitions.
// Phase 1: matrix 165 rows 134 cols
[2024-05-30 01:12:48] [INFO ] Computed 11 invariants in 4 ms
[2024-05-30 01:12:48] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-30 01:12:48] [INFO ] Invariant cache hit.
[2024-05-30 01:12:48] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-30 01:12:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 01:12:50] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 4 ms to minimize.
[2024-05-30 01:12:50] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 3 ms to minimize.
[2024-05-30 01:12:50] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 3 ms to minimize.
[2024-05-30 01:12:50] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-30 01:12:51] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-30 01:12:51] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 01:12:52] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 165/299 variables, 134/152 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/299 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 152 constraints, problems are : Problem set: 0 solved, 164 unsolved in 9346 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/299 variables, 134/152 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 164/316 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/299 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 316 constraints, problems are : Problem set: 0 solved, 164 unsolved in 6262 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 7/7 constraints]
After SMT, in 15667ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 15676ms
Starting structural reductions in LTL mode, iteration 1 : 134/166 places, 165/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16004 ms. Remains : 134/166 places, 165/199 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SmartHome-PT-08-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 393 ms.
Product exploration explored 100000 steps with 50000 reset in 191 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 26 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-08-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-08-LTLCardinality-02 finished in 16886 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(X(G(p0))))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 199/199 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 148 transition count 181
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 148 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 148 transition count 180
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 45 place count 140 transition count 172
Iterating global reduction 1 with 8 rules applied. Total rules applied 53 place count 140 transition count 172
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 135 transition count 167
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 135 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 135 transition count 166
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 133 transition count 164
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 133 transition count 164
Applied a total of 68 rules in 37 ms. Remains 133 /166 variables (removed 33) and now considering 164/199 (removed 35) transitions.
// Phase 1: matrix 164 rows 133 cols
[2024-05-30 01:13:05] [INFO ] Computed 11 invariants in 2 ms
[2024-05-30 01:13:05] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-30 01:13:05] [INFO ] Invariant cache hit.
[2024-05-30 01:13:05] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-30 01:13:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-30 01:13:07] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-05-30 01:13:07] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/297 variables, 133/146 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 146 constraints, problems are : Problem set: 0 solved, 163 unsolved in 8261 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/297 variables, 133/146 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 163/309 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-30 01:13:17] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 4 ms to minimize.
[2024-05-30 01:13:17] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 2/311 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 0/297 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 311 constraints, problems are : Problem set: 0 solved, 163 unsolved in 10174 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 4/4 constraints]
After SMT, in 18483ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 18488ms
Starting structural reductions in LTL mode, iteration 1 : 133/166 places, 164/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18813 ms. Remains : 133/166 places, 164/199 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-08-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 97 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-08-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLCardinality-05 finished in 19075 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(p0))'
Support contains 4 out of 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 199/199 transitions.
Graph (trivial) has 157 edges and 166 vertex of which 70 / 166 are part of one of the 6 SCC in 1 ms
Free SCC test removed 64 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 101 transition count 87
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 36 rules applied. Total rules applied 66 place count 72 transition count 80
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 70 place count 69 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 68 transition count 79
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 71 place count 68 transition count 72
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 85 place count 61 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 87 place count 59 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 59 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 59 transition count 69
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 130 place count 39 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 140 place count 39 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 141 place count 38 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 143 place count 36 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 144 place count 35 transition count 35
Applied a total of 144 rules in 28 ms. Remains 35 /166 variables (removed 131) and now considering 35/199 (removed 164) transitions.
[2024-05-30 01:13:24] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
// Phase 1: matrix 30 rows 35 cols
[2024-05-30 01:13:24] [INFO ] Computed 9 invariants in 0 ms
[2024-05-30 01:13:24] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 01:13:24] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
[2024-05-30 01:13:24] [INFO ] Invariant cache hit.
[2024-05-30 01:13:24] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-30 01:13:24] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-30 01:13:24] [INFO ] Redundant transitions in 1 ms returned []
Running 28 sub problems to find dead transitions.
[2024-05-30 01:13:24] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
[2024-05-30 01:13:24] [INFO ] Invariant cache hit.
[2024-05-30 01:13:24] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 3/35 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 29/64 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/64 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/65 variables, and 51 constraints, problems are : Problem set: 0 solved, 28 unsolved in 612 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 3/35 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 29/64 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 28/79 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/64 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/65 variables, and 79 constraints, problems are : Problem set: 0 solved, 28 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1298ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1299ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/166 places, 35/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1534 ms. Remains : 35/166 places, 35/199 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-08-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-08-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLCardinality-08 finished in 1600 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(F(p0))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 199/199 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 147 transition count 180
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 147 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 147 transition count 179
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 139 transition count 171
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 139 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 134 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 134 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 134 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 132 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 132 transition count 163
Applied a total of 70 rules in 18 ms. Remains 132 /166 variables (removed 34) and now considering 163/199 (removed 36) transitions.
// Phase 1: matrix 163 rows 132 cols
[2024-05-30 01:13:25] [INFO ] Computed 11 invariants in 2 ms
[2024-05-30 01:13:25] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-30 01:13:25] [INFO ] Invariant cache hit.
[2024-05-30 01:13:26] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-30 01:13:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-30 01:13:27] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 2 ms to minimize.
[2024-05-30 01:13:28] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2024-05-30 01:13:28] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 3 ms to minimize.
[2024-05-30 01:13:28] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 3 ms to minimize.
[2024-05-30 01:13:28] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-05-30 01:13:28] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-30 01:13:28] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-30 01:13:28] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/295 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 162 unsolved in 8943 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/295 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 162/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 313 constraints, problems are : Problem set: 0 solved, 162 unsolved in 7098 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
After SMT, in 16072ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 16075ms
Starting structural reductions in LTL mode, iteration 1 : 132/166 places, 163/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16375 ms. Remains : 132/166 places, 163/199 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-08-LTLCardinality-09
Product exploration explored 100000 steps with 33333 reset in 118 ms.
Product exploration explored 100000 steps with 33333 reset in 452 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-08-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-08-LTLCardinality-09 finished in 17132 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(F(p0))))'
Support contains 1 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 199/199 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 147 transition count 180
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 147 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 147 transition count 179
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 139 transition count 171
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 139 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 134 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 134 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 134 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 132 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 132 transition count 163
Applied a total of 70 rules in 17 ms. Remains 132 /166 variables (removed 34) and now considering 163/199 (removed 36) transitions.
[2024-05-30 01:13:42] [INFO ] Invariant cache hit.
[2024-05-30 01:13:43] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-30 01:13:43] [INFO ] Invariant cache hit.
[2024-05-30 01:13:43] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-30 01:13:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-30 01:13:45] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 3 ms to minimize.
[2024-05-30 01:13:45] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 3 ms to minimize.
[2024-05-30 01:13:45] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 3 ms to minimize.
[2024-05-30 01:13:45] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 3 ms to minimize.
[2024-05-30 01:13:45] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-30 01:13:45] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 3 ms to minimize.
[2024-05-30 01:13:45] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-30 01:13:46] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/295 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 162 unsolved in 9328 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/295 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 162/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 313 constraints, problems are : Problem set: 0 solved, 162 unsolved in 7351 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
After SMT, in 16716ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 16719ms
Starting structural reductions in LTL mode, iteration 1 : 132/166 places, 163/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17010 ms. Remains : 132/166 places, 163/199 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-08-LTLCardinality-10
Product exploration explored 100000 steps with 28532 reset in 235 ms.
Product exploration explored 100000 steps with 28606 reset in 367 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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 10 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 01:14:01] [INFO ] Invariant cache hit.
[2024-05-30 01:14:01] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-30 01:14:01] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2024-05-30 01:14:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 01:14:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-30 01:14:01] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-30 01:14:02] [INFO ] Computed and/alt/rep : 162/272/162 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-30 01:14:02] [INFO ] Added : 162 causal constraints over 33 iterations in 860 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 163/163 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-05-30 01:14:02] [INFO ] Invariant cache hit.
[2024-05-30 01:14:02] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-30 01:14:02] [INFO ] Invariant cache hit.
[2024-05-30 01:14:03] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-30 01:14:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
[2024-05-30 01:14:05] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 3 ms to minimize.
[2024-05-30 01:14:05] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-05-30 01:14:05] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 3 ms to minimize.
[2024-05-30 01:14:05] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 3 ms to minimize.
[2024-05-30 01:14:05] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-30 01:14:05] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-30 01:14:05] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 3 ms to minimize.
[2024-05-30 01:14:06] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/295 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 151 constraints, problems are : Problem set: 0 solved, 162 unsolved in 9198 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/295 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 162/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 313 constraints, problems are : Problem set: 0 solved, 162 unsolved in 6547 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 8/8 constraints]
After SMT, in 15785ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 15790ms
Finished structural reductions in LTL mode , in 1 iterations and 16103 ms. Remains : 132/132 places, 163/163 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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 178 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-30 01:14:19] [INFO ] Invariant cache hit.
[2024-05-30 01:14:19] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-30 01:14:20] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-30 01:14:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 01:14:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-30 01:14:20] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-30 01:14:20] [INFO ] Computed and/alt/rep : 162/272/162 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-30 01:14:21] [INFO ] Added : 162 causal constraints over 33 iterations in 836 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 28601 reset in 115 ms.
Product exploration explored 100000 steps with 28589 reset in 134 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 163/163 transitions.
Graph (trivial) has 126 edges and 132 vertex of which 70 / 132 are part of one of the 6 SCC in 1 ms
Free SCC test removed 64 places
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 68 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 17 place count 68 transition count 74
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 68 transition count 74
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 31 place count 58 transition count 64
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 41 place count 58 transition count 64
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 56 place count 58 transition count 64
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 52 transition count 58
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 52 transition count 58
Deduced a syphon composed of 19 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 73 place count 52 transition count 53
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 174 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 75 place count 50 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 49 transition count 51
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 49 transition count 51
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 77 rules in 42 ms. Remains 49 /132 variables (removed 83) and now considering 51/163 (removed 112) transitions.
[2024-05-30 01:14:22] [INFO ] Redundant transitions in 1 ms returned []
Running 50 sub problems to find dead transitions.
[2024-05-30 01:14:22] [INFO ] Flow matrix only has 42 transitions (discarded 9 similar events)
// Phase 1: matrix 42 rows 49 cols
[2024-05-30 01:14:22] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 01:14:22] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-30 01:14:22] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-30 01:14:22] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-30 01:14:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-30 01:14:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-30 01:14:22] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-30 01:14:22] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-30 01:14:22] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-30 01:14:22] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
[2024-05-30 01:14:22] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
[2024-05-30 01:14:22] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 10/20 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/20 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 41/90 variables, 49/69 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 17/86 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/86 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/91 variables, 1/87 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/87 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/91 variables, 0/87 constraints. Problems are: Problem set: 17 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 87 constraints, problems are : Problem set: 17 solved, 33 unsolved in 1605 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 49/49 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 17 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 18/49 variables, 10/10 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 10/20 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/20 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 41/90 variables, 49/69 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 17/86 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 33/119 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/119 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/91 variables, 1/120 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/120 constraints. Problems are: Problem set: 17 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/91 variables, 0/120 constraints. Problems are: Problem set: 17 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 120 constraints, problems are : Problem set: 17 solved, 33 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 49/49 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 33/50 constraints, Known Traps: 10/10 constraints]
After SMT, in 2548ms problems are : Problem set: 17 solved, 33 unsolved
Search for dead transitions found 17 dead transitions in 2551ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 49/132 places, 34/163 transitions.
Graph (complete) has 129 edges and 49 vertex of which 32 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 32 /49 variables (removed 17) and now considering 34/34 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/132 places, 34/163 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2608 ms. Remains : 32/132 places, 34/163 transitions.
Built C files in :
/tmp/ltsmin14532783363540246052
[2024-05-30 01:14:24] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14532783363540246052
Running compilation step : cd /tmp/ltsmin14532783363540246052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1021 ms.
Running link step : cd /tmp/ltsmin14532783363540246052;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin14532783363540246052;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1571496557543783199.hoa' '--buchi-type=spotba'
LTSmin run took 528 ms.
FORMULA SmartHome-PT-08-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-08-LTLCardinality-10 finished in 43543 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(p0)||F(p1))))'
Support contains 3 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 199/199 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 182
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 149 transition count 181
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 142 transition count 174
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 142 transition count 174
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 137 transition count 169
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 137 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 137 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 136 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 136 transition count 167
Applied a total of 62 rules in 25 ms. Remains 136 /166 variables (removed 30) and now considering 167/199 (removed 32) transitions.
// Phase 1: matrix 167 rows 136 cols
[2024-05-30 01:14:26] [INFO ] Computed 11 invariants in 2 ms
[2024-05-30 01:14:26] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-30 01:14:26] [INFO ] Invariant cache hit.
[2024-05-30 01:14:26] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-30 01:14:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-30 01:14:29] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 3 ms to minimize.
[2024-05-30 01:14:29] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 3 ms to minimize.
[2024-05-30 01:14:29] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 2 ms to minimize.
[2024-05-30 01:14:29] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 2 ms to minimize.
[2024-05-30 01:14:29] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-30 01:14:29] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-30 01:14:29] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/303 variables, 136/154 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/303 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 154 constraints, problems are : Problem set: 0 solved, 166 unsolved in 9585 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-30 01:14:37] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-05-30 01:14:38] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/303 variables, 136/156 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 166/322 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 322 constraints, problems are : Problem set: 0 solved, 166 unsolved in 8903 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 9/9 constraints]
After SMT, in 18531ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 18537ms
Starting structural reductions in LTL mode, iteration 1 : 136/166 places, 167/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18895 ms. Remains : 136/166 places, 167/199 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SmartHome-PT-08-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 65 ms.
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-08-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-08-LTLCardinality-11 finished in 19223 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' '!(((p0&&G((F(p2)||p1))) U X(G(!p3))))'
Support contains 5 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 199/199 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 149 transition count 182
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 149 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 149 transition count 181
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 143 transition count 175
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 143 transition count 175
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 139 transition count 171
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 139 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 139 transition count 170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 137 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 137 transition count 168
Applied a total of 60 rules in 20 ms. Remains 137 /166 variables (removed 29) and now considering 168/199 (removed 31) transitions.
// Phase 1: matrix 168 rows 137 cols
[2024-05-30 01:14:45] [INFO ] Computed 11 invariants in 2 ms
[2024-05-30 01:14:45] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-30 01:14:45] [INFO ] Invariant cache hit.
[2024-05-30 01:14:46] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2024-05-30 01:14:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-30 01:14:47] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 3 ms to minimize.
[2024-05-30 01:14:48] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/305 variables, 137/150 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (OVERLAPS) 0/305 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 150 constraints, problems are : Problem set: 0 solved, 167 unsolved in 8744 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/305 variables, 137/150 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 167/317 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-30 01:14:57] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
[2024-05-30 01:14:57] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:14:58] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-30 01:14:59] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/305 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 321 constraints, problems are : Problem set: 0 solved, 167 unsolved in 10659 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 6/6 constraints]
After SMT, in 19444ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 19449ms
Starting structural reductions in LTL mode, iteration 1 : 137/166 places, 168/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19773 ms. Remains : 137/166 places, 168/199 transitions.
Stuttering acceptance computed with spot in 361 ms :[p3, (AND (NOT p2) p3 p1), (AND p3 (NOT p1) (NOT p2)), p3, true, (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SmartHome-PT-08-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-08-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLCardinality-12 finished in 20159 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(G(p0))))'
Support contains 2 out of 166 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 166/166 places, 199/199 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 147 transition count 180
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 147 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 147 transition count 179
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 139 transition count 171
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 139 transition count 171
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 60 place count 134 transition count 166
Iterating global reduction 1 with 5 rules applied. Total rules applied 65 place count 134 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 134 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 133 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 133 transition count 164
Applied a total of 68 rules in 34 ms. Remains 133 /166 variables (removed 33) and now considering 164/199 (removed 35) transitions.
// Phase 1: matrix 164 rows 133 cols
[2024-05-30 01:15:05] [INFO ] Computed 11 invariants in 2 ms
[2024-05-30 01:15:06] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-30 01:15:06] [INFO ] Invariant cache hit.
[2024-05-30 01:15:06] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-30 01:15:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-30 01:15:08] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-05-30 01:15:08] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 3 ms to minimize.
[2024-05-30 01:15:08] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2024-05-30 01:15:08] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 3 ms to minimize.
[2024-05-30 01:15:08] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
[2024-05-30 01:15:08] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 3 ms to minimize.
[2024-05-30 01:15:09] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-05-30 01:15:09] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:15:09] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-30 01:15:09] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-30 01:15:09] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/297 variables, 133/155 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 155 constraints, problems are : Problem set: 0 solved, 163 unsolved in 9413 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/297 variables, 133/155 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 163/318 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 318 constraints, problems are : Problem set: 0 solved, 163 unsolved in 7262 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 11/11 constraints]
After SMT, in 16711ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 16715ms
Starting structural reductions in LTL mode, iteration 1 : 133/166 places, 164/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17064 ms. Remains : 133/166 places, 164/199 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-08-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLCardinality-13 finished in 17209 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 166 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 166/166 places, 199/199 transitions.
Graph (trivial) has 160 edges and 166 vertex of which 77 / 166 are part of one of the 6 SCC in 0 ms
Free SCC test removed 71 places
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 95 transition count 82
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 34 rules applied. Total rules applied 62 place count 68 transition count 75
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 65 transition count 75
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 65 place count 65 transition count 69
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 77 place count 59 transition count 69
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 81 place count 55 transition count 65
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 55 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 55 transition count 64
Performed 23 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 132 place count 32 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 142 place count 32 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 144 place count 30 transition count 29
Applied a total of 144 rules in 23 ms. Remains 30 /166 variables (removed 136) and now considering 29/199 (removed 170) transitions.
[2024-05-30 01:15:23] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
// Phase 1: matrix 24 rows 30 cols
[2024-05-30 01:15:23] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:15:23] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 01:15:23] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2024-05-30 01:15:23] [INFO ] Invariant cache hit.
[2024-05-30 01:15:23] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-30 01:15:23] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-30 01:15:23] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
[2024-05-30 01:15:23] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2024-05-30 01:15:23] [INFO ] Invariant cache hit.
[2024-05-30 01:15:23] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 23/53 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (OVERLAPS) 1/54 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 53 constraints, problems are : Problem set: 0 solved, 28 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 1/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 23/53 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 28/80 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 1/54 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 81 constraints, problems are : Problem set: 0 solved, 28 unsolved in 841 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1588ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1589ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/166 places, 29/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1733 ms. Remains : 30/166 places, 29/199 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-08-LTLCardinality-14
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-08-LTLCardinality-14 finished in 1810 ms.
All properties solved by simple procedures.
Total runtime 189200 ms.
BK_STOP 1717031724953
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-08, 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 r378-smll-171683811400395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-08.tgz
mv SmartHome-PT-08 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 '
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 ;