About the Execution of LTSMin+red for SmartHome-PT-18
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
375.808 | 188208.00 | 236489.00 | 683.20 | FFFFFTFFFFFFFFFF | 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.r532-smll-171683811600476.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 ltsminxred
Input is SmartHome-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683811600476
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.6K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 03:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 03:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 03:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 03:51 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 159K 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-18-LTLFireability-00
FORMULA_NAME SmartHome-PT-18-LTLFireability-01
FORMULA_NAME SmartHome-PT-18-LTLFireability-02
FORMULA_NAME SmartHome-PT-18-LTLFireability-03
FORMULA_NAME SmartHome-PT-18-LTLFireability-04
FORMULA_NAME SmartHome-PT-18-LTLFireability-05
FORMULA_NAME SmartHome-PT-18-LTLFireability-06
FORMULA_NAME SmartHome-PT-18-LTLFireability-07
FORMULA_NAME SmartHome-PT-18-LTLFireability-08
FORMULA_NAME SmartHome-PT-18-LTLFireability-09
FORMULA_NAME SmartHome-PT-18-LTLFireability-10
FORMULA_NAME SmartHome-PT-18-LTLFireability-11
FORMULA_NAME SmartHome-PT-18-LTLFireability-12
FORMULA_NAME SmartHome-PT-18-LTLFireability-13
FORMULA_NAME SmartHome-PT-18-LTLFireability-14
FORMULA_NAME SmartHome-PT-18-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717259843635
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:37:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:37:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:37:26] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2024-06-01 16:37:26] [INFO ] Transformed 653 places.
[2024-06-01 16:37:26] [INFO ] Transformed 706 transitions.
[2024-06-01 16:37:26] [INFO ] Found NUPN structural information;
[2024-06-01 16:37:26] [INFO ] Parsed PT model containing 653 places and 706 transitions and 1618 arcs in 651 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 206 places in 16 ms
Reduce places removed 206 places and 176 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SmartHome-PT-18-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 2 formulas.
FORMULA SmartHome-PT-18-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 530/530 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 430 transition count 530
Discarding 120 places :
Symmetric choice reduction at 1 with 120 rule applications. Total rules 137 place count 310 transition count 410
Iterating global reduction 1 with 120 rules applied. Total rules applied 257 place count 310 transition count 410
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 268 place count 310 transition count 399
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 291 place count 287 transition count 376
Iterating global reduction 2 with 23 rules applied. Total rules applied 314 place count 287 transition count 376
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 337 place count 264 transition count 353
Iterating global reduction 2 with 23 rules applied. Total rules applied 360 place count 264 transition count 353
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 362 place count 264 transition count 351
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 372 place count 254 transition count 341
Iterating global reduction 3 with 10 rules applied. Total rules applied 382 place count 254 transition count 341
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 384 place count 252 transition count 339
Iterating global reduction 3 with 2 rules applied. Total rules applied 386 place count 252 transition count 339
Applied a total of 386 rules in 268 ms. Remains 252 /447 variables (removed 195) and now considering 339/530 (removed 191) transitions.
// Phase 1: matrix 339 rows 252 cols
[2024-06-01 16:37:27] [INFO ] Computed 3 invariants in 48 ms
[2024-06-01 16:37:28] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-06-01 16:37:28] [INFO ] Invariant cache hit.
[2024-06-01 16:37:28] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2024-06-01 16:37:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 1/252 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 339/591 variables, 252/255 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/591 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (OVERLAPS) 0/591 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 255 constraints, problems are : Problem set: 0 solved, 338 unsolved in 25804 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 1/252 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 339/591 variables, 252/255 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/591 variables, 338/593 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/591 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 0/591 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Int declared 591/591 variables, and 593 constraints, problems are : Problem set: 0 solved, 338 unsolved in 20481 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints]
After SMT, in 46546ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 46587ms
Starting structural reductions in LTL mode, iteration 1 : 252/447 places, 339/530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47758 ms. Remains : 252/447 places, 339/530 transitions.
Support contains 19 out of 252 places after structural reductions.
[2024-06-01 16:38:15] [INFO ] Flatten gal took : 81 ms
[2024-06-01 16:38:15] [INFO ] Flatten gal took : 34 ms
[2024-06-01 16:38:15] [INFO ] Input system was already deterministic with 339 transitions.
Support contains 16 out of 252 places (down from 19) after GAL structural reductions.
RANDOM walk for 27804 steps (91 resets) in 1511 ms. (18 steps per ms) remains 0/15 properties
FORMULA SmartHome-PT-18-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 46 stabilizing places and 45 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)))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 339/339 transitions.
Graph (trivial) has 270 edges and 252 vertex of which 161 / 252 are part of one of the 14 SCC in 5 ms
Free SCC test removed 147 places
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 104 transition count 101
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 67 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 66 transition count 99
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 78 place count 66 transition count 97
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 64 transition count 97
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 87 place count 59 transition count 90
Iterating global reduction 3 with 5 rules applied. Total rules applied 92 place count 59 transition count 90
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 150 place count 30 transition count 61
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 27 transition count 49
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 27 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 170 place count 27 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 172 place count 25 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 172 place count 25 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 24 transition count 34
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 176 place count 22 transition count 30
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 22 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 179 place count 21 transition count 29
Applied a total of 179 rules in 61 ms. Remains 21 /252 variables (removed 231) and now considering 29/339 (removed 310) transitions.
[2024-06-01 16:38:16] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
// Phase 1: matrix 22 rows 21 cols
[2024-06-01 16:38:16] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 16:38:16] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 16:38:16] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
[2024-06-01 16:38:16] [INFO ] Invariant cache hit.
[2024-06-01 16:38:16] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-06-01 16:38:16] [INFO ] Redundant transitions in 38 ms returned []
Running 11 sub problems to find dead transitions.
[2024-06-01 16:38:16] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
[2024-06-01 16:38:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 3/38 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 11 unsolved in 218 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3/38 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/40 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/43 variables, and 32 constraints, problems are : Problem set: 0 solved, 11 unsolved in 313 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 540ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 541ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/252 places, 29/339 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 749 ms. Remains : 21/252 places, 29/339 transitions.
Stuttering acceptance computed with spot in 334 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-18-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLFireability-00 finished in 1184 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 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 339/339 transitions.
Graph (trivial) has 270 edges and 252 vertex of which 163 / 252 are part of one of the 14 SCC in 1 ms
Free SCC test removed 149 places
Ensure Unique test removed 203 transitions
Reduce isomorphic transitions removed 203 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 102 transition count 100
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 67 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 66 transition count 98
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 74 place count 66 transition count 95
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 63 transition count 95
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 85 place count 58 transition count 86
Iterating global reduction 3 with 5 rules applied. Total rules applied 90 place count 58 transition count 86
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 146 place count 30 transition count 58
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 27 transition count 46
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 27 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 165 place count 27 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 167 place count 25 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 167 place count 25 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 24 transition count 32
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 171 place count 22 transition count 28
Iterating global reduction 4 with 2 rules applied. Total rules applied 173 place count 22 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 21 transition count 27
Applied a total of 174 rules in 29 ms. Remains 21 /252 variables (removed 231) and now considering 27/339 (removed 312) transitions.
[2024-06-01 16:38:17] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 21 cols
[2024-06-01 16:38:17] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 16:38:17] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 16:38:17] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-06-01 16:38:17] [INFO ] Invariant cache hit.
[2024-06-01 16:38:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:38:17] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-06-01 16:38:17] [INFO ] Redundant transitions in 35 ms returned []
Running 14 sub problems to find dead transitions.
[2024-06-01 16:38:17] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-06-01 16:38:17] [INFO ] Invariant cache hit.
[2024-06-01 16:38:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 19/38 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/42 variables, and 22 constraints, problems are : Problem set: 0 solved, 14 unsolved in 293 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 19/38 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/39 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/42 variables, and 36 constraints, problems are : Problem set: 0 solved, 14 unsolved in 269 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 572ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 573ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/252 places, 27/339 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 764 ms. Remains : 21/252 places, 27/339 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-18-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLFireability-03 finished in 834 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 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 339/339 transitions.
Graph (trivial) has 269 edges and 252 vertex of which 156 / 252 are part of one of the 14 SCC in 2 ms
Free SCC test removed 142 places
Ensure Unique test removed 193 transitions
Reduce isomorphic transitions removed 193 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 109 transition count 107
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 79 place count 71 transition count 105
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 70 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 69 transition count 104
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 82 place count 69 transition count 101
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 88 place count 66 transition count 101
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 94 place count 60 transition count 91
Iterating global reduction 4 with 6 rules applied. Total rules applied 100 place count 60 transition count 91
Performed 30 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 160 place count 30 transition count 59
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 162 place count 28 transition count 51
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 28 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 179 place count 28 transition count 36
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 181 place count 26 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 181 place count 26 transition count 35
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 183 place count 25 transition count 35
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 185 place count 23 transition count 31
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 23 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 188 place count 22 transition count 30
Applied a total of 188 rules in 41 ms. Remains 22 /252 variables (removed 230) and now considering 30/339 (removed 309) transitions.
[2024-06-01 16:38:18] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
// Phase 1: matrix 23 rows 22 cols
[2024-06-01 16:38:18] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 16:38:18] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 16:38:18] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2024-06-01 16:38:18] [INFO ] Invariant cache hit.
[2024-06-01 16:38:18] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-06-01 16:38:18] [INFO ] Redundant transitions in 31 ms returned []
Running 12 sub problems to find dead transitions.
[2024-06-01 16:38:18] [INFO ] Flow matrix only has 23 transitions (discarded 7 similar events)
[2024-06-01 16:38:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 3/40 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/45 variables, and 21 constraints, problems are : Problem set: 0 solved, 12 unsolved in 144 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/22 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 3/40 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/41 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/42 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/45 variables, and 34 constraints, problems are : Problem set: 0 solved, 12 unsolved in 295 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/22 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 446ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 446ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/252 places, 30/339 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 625 ms. Remains : 22/252 places, 30/339 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-18-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLFireability-04 finished in 683 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 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 339/339 transitions.
Graph (trivial) has 269 edges and 252 vertex of which 155 / 252 are part of one of the 14 SCC in 1 ms
Free SCC test removed 141 places
Ensure Unique test removed 192 transitions
Reduce isomorphic transitions removed 192 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 110 transition count 106
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 70 transition count 104
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 69 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 68 transition count 103
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 86 place count 68 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 90 place count 66 transition count 101
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 95 place count 61 transition count 94
Iterating global reduction 4 with 5 rules applied. Total rules applied 100 place count 61 transition count 94
Performed 31 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 162 place count 30 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 30 transition count 61
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 166 place count 27 transition count 49
Iterating global reduction 5 with 3 rules applied. Total rules applied 169 place count 27 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 183 place count 27 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 185 place count 25 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 185 place count 25 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 187 place count 24 transition count 34
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 189 place count 22 transition count 30
Iterating global reduction 6 with 2 rules applied. Total rules applied 191 place count 22 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 192 place count 21 transition count 29
Applied a total of 192 rules in 26 ms. Remains 21 /252 variables (removed 231) and now considering 29/339 (removed 310) transitions.
[2024-06-01 16:38:19] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
// Phase 1: matrix 22 rows 21 cols
[2024-06-01 16:38:19] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 16:38:19] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 16:38:19] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
[2024-06-01 16:38:19] [INFO ] Invariant cache hit.
[2024-06-01 16:38:19] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-06-01 16:38:19] [INFO ] Redundant transitions in 41 ms returned []
Running 11 sub problems to find dead transitions.
[2024-06-01 16:38:19] [INFO ] Flow matrix only has 22 transitions (discarded 7 similar events)
[2024-06-01 16:38:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 3/38 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 11 unsolved in 211 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 3/38 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 1/40 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/43 variables, and 32 constraints, problems are : Problem set: 0 solved, 11 unsolved in 313 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 531ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 533ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/252 places, 29/339 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 713 ms. Remains : 21/252 places, 29/339 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-18-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLFireability-07 finished in 782 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(G((p0&&F(p1)))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 339/339 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 247 transition count 334
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 247 transition count 334
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 243 transition count 330
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 243 transition count 330
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 240 transition count 327
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 240 transition count 327
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 238 transition count 325
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 238 transition count 325
Applied a total of 28 rules in 25 ms. Remains 238 /252 variables (removed 14) and now considering 325/339 (removed 14) transitions.
// Phase 1: matrix 325 rows 238 cols
[2024-06-01 16:38:19] [INFO ] Computed 3 invariants in 4 ms
[2024-06-01 16:38:19] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 16:38:20] [INFO ] Invariant cache hit.
[2024-06-01 16:38:20] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2024-06-01 16:38:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 325/563 variables, 238/241 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/563 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 241 constraints, problems are : Problem set: 0 solved, 324 unsolved in 23123 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 325/563 variables, 238/241 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 324/565 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 0/563 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 565 constraints, problems are : Problem set: 0 solved, 324 unsolved in 20003 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
After SMT, in 43217ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 43233ms
Starting structural reductions in LTL mode, iteration 1 : 238/252 places, 325/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43696 ms. Remains : 238/252 places, 325/339 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SmartHome-PT-18-LTLFireability-08
Entered a terminal (fully accepting) state of product in 43712 steps with 164 reset in 493 ms.
FORMULA SmartHome-PT-18-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLFireability-08 finished in 44505 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((F(p0)&&X(X(G(p1))))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 339/339 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 247 transition count 334
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 247 transition count 334
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 242 transition count 329
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 242 transition count 329
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 238 transition count 325
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 238 transition count 325
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 236 transition count 323
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 236 transition count 323
Applied a total of 32 rules in 34 ms. Remains 236 /252 variables (removed 16) and now considering 323/339 (removed 16) transitions.
// Phase 1: matrix 323 rows 236 cols
[2024-06-01 16:39:04] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 16:39:04] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 16:39:04] [INFO ] Invariant cache hit.
[2024-06-01 16:39:04] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-06-01 16:39:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/559 variables, 236/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 0/559 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 239 constraints, problems are : Problem set: 0 solved, 322 unsolved in 22680 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/559 variables, 236/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 322/561 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 0/559 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 561 constraints, problems are : Problem set: 0 solved, 322 unsolved in 19541 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints]
After SMT, in 42307ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 42315ms
Starting structural reductions in LTL mode, iteration 1 : 236/252 places, 323/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42773 ms. Remains : 236/252 places, 323/339 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SmartHome-PT-18-LTLFireability-09
Product exploration explored 100000 steps with 2071 reset in 297 ms.
Stack based approach found an accepted trace after 112 steps with 2 reset with depth 25 and stack size 25 in 1 ms.
FORMULA SmartHome-PT-18-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SmartHome-PT-18-LTLFireability-09 finished in 43335 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' '!(G((F(p0)&&F((G(p1)||G(F(p2)))))))'
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 339/339 transitions.
Graph (trivial) has 263 edges and 252 vertex of which 133 / 252 are part of one of the 13 SCC in 1 ms
Free SCC test removed 120 places
Ensure Unique test removed 163 transitions
Reduce isomorphic transitions removed 163 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 131 transition count 128
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 52 rules applied. Total rules applied 100 place count 84 transition count 123
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 6 rules applied. Total rules applied 106 place count 81 transition count 120
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 109 place count 79 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 78 transition count 119
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 110 place count 78 transition count 115
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 118 place count 74 transition count 115
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 124 place count 68 transition count 105
Iterating global reduction 5 with 6 rules applied. Total rules applied 130 place count 68 transition count 105
Performed 34 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 198 place count 34 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 200 place count 34 transition count 64
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 201 place count 33 transition count 60
Iterating global reduction 6 with 1 rules applied. Total rules applied 202 place count 33 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 210 place count 33 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 211 place count 32 transition count 52
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 212 place count 31 transition count 49
Iterating global reduction 7 with 1 rules applied. Total rules applied 213 place count 31 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 214 place count 30 transition count 48
Applied a total of 214 rules in 26 ms. Remains 30 /252 variables (removed 222) and now considering 48/339 (removed 291) transitions.
[2024-06-01 16:39:47] [INFO ] Flow matrix only has 34 transitions (discarded 14 similar events)
// Phase 1: matrix 34 rows 30 cols
[2024-06-01 16:39:47] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 16:39:47] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 16:39:47] [INFO ] Flow matrix only has 34 transitions (discarded 14 similar events)
[2024-06-01 16:39:47] [INFO ] Invariant cache hit.
[2024-06-01 16:39:47] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-06-01 16:39:47] [INFO ] Redundant transitions in 50 ms returned []
Running 26 sub problems to find dead transitions.
[2024-06-01 16:39:47] [INFO ] Flow matrix only has 34 transitions (discarded 14 similar events)
[2024-06-01 16:39:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 32/60 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 1/61 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/61 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/64 variables, and 31 constraints, problems are : Problem set: 0 solved, 26 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/30 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 32/60 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 15/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 1/61 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/61 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/64 variables, and 57 constraints, problems are : Problem set: 0 solved, 26 unsolved in 659 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/30 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 1273ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 1275ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/252 places, 48/339 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1482 ms. Remains : 30/252 places, 48/339 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SmartHome-PT-18-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-18-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLFireability-10 finished in 1674 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' '!(G((X(X(p0))||G((p1||X(p1))))))'
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 339/339 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 247 transition count 334
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 247 transition count 334
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 243 transition count 330
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 243 transition count 330
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 239 transition count 326
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 239 transition count 326
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 237 transition count 324
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 237 transition count 324
Applied a total of 30 rules in 23 ms. Remains 237 /252 variables (removed 15) and now considering 324/339 (removed 15) transitions.
// Phase 1: matrix 324 rows 237 cols
[2024-06-01 16:39:49] [INFO ] Computed 3 invariants in 9 ms
[2024-06-01 16:39:49] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 16:39:49] [INFO ] Invariant cache hit.
[2024-06-01 16:39:49] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-06-01 16:39:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 324/561 variables, 237/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (OVERLAPS) 0/561 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 240 constraints, problems are : Problem set: 0 solved, 323 unsolved in 22983 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 324/561 variables, 237/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 323/563 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 0/561 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 561/561 variables, and 563 constraints, problems are : Problem set: 0 solved, 323 unsolved in 17488 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
After SMT, in 40546ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 40553ms
Starting structural reductions in LTL mode, iteration 1 : 237/252 places, 324/339 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40983 ms. Remains : 237/252 places, 324/339 transitions.
Stuttering acceptance computed with spot in 523 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SmartHome-PT-18-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-18-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLFireability-12 finished in 41536 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' '!(G(F(p0)))'
Support contains 1 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 339/339 transitions.
Graph (trivial) has 269 edges and 252 vertex of which 156 / 252 are part of one of the 14 SCC in 1 ms
Free SCC test removed 142 places
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 109 transition count 105
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 70 transition count 103
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 69 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 68 transition count 102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 84 place count 68 transition count 100
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 88 place count 66 transition count 100
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 93 place count 61 transition count 91
Iterating global reduction 4 with 5 rules applied. Total rules applied 98 place count 61 transition count 91
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 158 place count 31 transition count 60
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 162 place count 27 transition count 47
Iterating global reduction 4 with 4 rules applied. Total rules applied 166 place count 27 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 179 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 181 place count 25 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 181 place count 25 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 183 place count 24 transition count 33
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 185 place count 22 transition count 29
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 22 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 188 place count 21 transition count 28
Applied a total of 188 rules in 21 ms. Remains 21 /252 variables (removed 231) and now considering 28/339 (removed 311) transitions.
[2024-06-01 16:40:30] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
// Phase 1: matrix 22 rows 21 cols
[2024-06-01 16:40:30] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 16:40:30] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 16:40:30] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2024-06-01 16:40:30] [INFO ] Invariant cache hit.
[2024-06-01 16:40:31] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-06-01 16:40:31] [INFO ] Redundant transitions in 37 ms returned []
Running 12 sub problems to find dead transitions.
[2024-06-01 16:40:31] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2024-06-01 16:40:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 1/38 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 12 unsolved in 253 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/37 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 11/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/40 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 12 unsolved in 350 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 609ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 610ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/252 places, 28/339 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 777 ms. Remains : 21/252 places, 28/339 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-18-LTLFireability-14
Stuttering criterion allowed to conclude after 29 steps with 1 reset in 1 ms.
FORMULA SmartHome-PT-18-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-18-LTLFireability-14 finished in 898 ms.
All properties solved by simple procedures.
Total runtime 185518 ms.
ITS solved all properties within timeout
BK_STOP 1717260031843
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is SmartHome-PT-18, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r532-smll-171683811600476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-18.tgz
mv SmartHome-PT-18 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;