Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901995000756.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SmartHome-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901995000756
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 64K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749248368915

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 22:19:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 22:19:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 22:19:30] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2025-06-06 22:19:30] [INFO ] Transformed 253 places.
[2025-06-06 22:19:30] [INFO ] Transformed 293 transitions.
[2025-06-06 22:19:30] [INFO ] Found NUPN structural information;
[2025-06-06 22:19:30] [INFO ] Parsed PT model containing 253 places and 293 transitions and 664 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 30 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-09-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 263/263 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 217 transition count 263
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 62 place count 162 transition count 208
Iterating global reduction 1 with 55 rules applied. Total rules applied 117 place count 162 transition count 208
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 123 place count 162 transition count 202
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 137 place count 148 transition count 188
Iterating global reduction 2 with 14 rules applied. Total rules applied 151 place count 148 transition count 188
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 161 place count 138 transition count 178
Iterating global reduction 2 with 10 rules applied. Total rules applied 171 place count 138 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 138 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 175 place count 135 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 178 place count 135 transition count 174
Applied a total of 178 rules in 67 ms. Remains 135 /224 variables (removed 89) and now considering 174/263 (removed 89) transitions.
// Phase 1: matrix 174 rows 135 cols
[2025-06-06 22:19:30] [INFO ] Computed 3 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:19:30] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-06-06 22:19:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:19:30] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2025-06-06 22:19:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/309 variables, 135/138 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 0/309 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 138 constraints, problems are : Problem set: 0 solved, 173 unsolved in 6810 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/309 variables, 135/138 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 173/311 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:19:40] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 312 constraints, problems are : Problem set: 0 solved, 173 unsolved in 10396 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 17264ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 17285ms
Starting structural reductions in LTL mode, iteration 1 : 135/224 places, 174/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17729 ms. Remains : 135/224 places, 174/263 transitions.
Support contains 28 out of 135 places after structural reductions.
[2025-06-06 22:19:48] [INFO ] Flatten gal took : 36 ms
[2025-06-06 22:19:48] [INFO ] Flatten gal took : 16 ms
[2025-06-06 22:19:48] [INFO ] Input system was already deterministic with 174 transitions.
RANDOM walk for 40000 steps (271 resets) in 994 ms. (40 steps per ms) remains 3/26 properties
BEST_FIRST walk for 40003 steps (45 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (46 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (46 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
[2025-06-06 22:19:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 39/49 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 68/117 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/120 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/123 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 74/197 variables, 36/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/197 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 51/248 variables, 25/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 37/285 variables, 18/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 21/306 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/306 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 3/309 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/309 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/309 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 138 constraints, problems are : Problem set: 0 solved, 3 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 39/49 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 68/117 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/120 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/123 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 74/197 variables, 36/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/197 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 51/248 variables, 25/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 37/285 variables, 18/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 21/306 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/306 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 3/309 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/309 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/309 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 141 constraints, problems are : Problem set: 0 solved, 3 unsolved in 406 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 761ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 174/174 transitions.
Graph (trivial) has 131 edges and 135 vertex of which 65 / 135 are part of one of the 6 SCC in 2 ms
Free SCC test removed 59 places
Drop transitions (Empty/Sink Transition effects.) removed 89 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 91 transitions.
Graph (complete) has 121 edges and 76 vertex of which 73 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 73 transition count 60
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 24 rules applied. Total rules applied 48 place count 53 transition count 56
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 51 place count 51 transition count 55
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 53 place count 50 transition count 54
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 53 place count 50 transition count 50
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 61 place count 46 transition count 50
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 65 place count 42 transition count 46
Iterating global reduction 4 with 4 rules applied. Total rules applied 69 place count 42 transition count 46
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 105 place count 24 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 37 edges and 24 vertex of which 22 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 11 rules applied. Total rules applied 116 place count 22 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 116 place count 22 transition count 16
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 118 place count 21 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 119 place count 20 transition count 15
Reduce places removed 5 places and 0 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 5 with 8 rules applied. Total rules applied 127 place count 15 transition count 12
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 130 place count 12 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 130 place count 12 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 139 place count 7 transition count 8
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 141 place count 7 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 143 place count 5 transition count 6
Applied a total of 143 rules in 20 ms. Remains 5 /135 variables (removed 130) and now considering 6/174 (removed 168) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 5/135 places, 6/174 transitions.
RANDOM walk for 20007 steps (6 resets) in 27 ms. (714 steps per ms) remains 0/3 properties
Computed a total of 35 stabilizing places and 35 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 174/174 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 125 transition count 164
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 125 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 124 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 123 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 123 transition count 162
Applied a total of 24 rules in 7 ms. Remains 123 /135 variables (removed 12) and now considering 162/174 (removed 12) transitions.
// Phase 1: matrix 162 rows 123 cols
[2025-06-06 22:19:50] [INFO ] Computed 3 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:19:50] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-06 22:19:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:19:50] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-06 22:19:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 126 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5430 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 161/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:19:58] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 288 constraints, problems are : Problem set: 0 solved, 161 unsolved in 9182 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 14641ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 14642ms
Starting structural reductions in LTL mode, iteration 1 : 123/135 places, 162/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14846 ms. Remains : 123/135 places, 162/174 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-00
Entered a terminal (fully accepting) state of product in 115 steps with 0 reset in 3 ms.
FORMULA SmartHome-PT-09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-00 finished in 15131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 174/174 transitions.
Graph (trivial) has 133 edges and 135 vertex of which 71 / 135 are part of one of the 6 SCC in 0 ms
Free SCC test removed 65 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 69 transition count 68
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 25 rules applied. Total rules applied 45 place count 50 transition count 62
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 47 transition count 62
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 48 place count 47 transition count 58
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 56 place count 43 transition count 58
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 61 place count 38 transition count 53
Iterating global reduction 3 with 5 rules applied. Total rules applied 66 place count 38 transition count 53
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 90 place count 26 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 100 place count 26 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 24 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 102 place count 24 transition count 30
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 104 place count 23 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 22 transition count 29
Applied a total of 105 rules in 11 ms. Remains 22 /135 variables (removed 113) and now considering 29/174 (removed 145) transitions.
[2025-06-06 22:20:05] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
// Phase 1: matrix 24 rows 22 cols
[2025-06-06 22:20:05] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:20:05] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-06 22:20:05] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2025-06-06 22:20:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:20:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-06 22:20:05] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:20:05] [INFO ] Redundant transitions in 50 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-06 22:20:05] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2025-06-06 22:20:05] [INFO ] Invariant cache hit.
[2025-06-06 22:20:05] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 22/41 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/43 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/46 variables, and 26 constraints, problems are : Problem set: 0 solved, 18 unsolved in 348 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/22 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 22/41 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 17/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 2/43 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/44 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 1/45 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/46 variables, and 45 constraints, problems are : Problem set: 0 solved, 18 unsolved in 419 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 791ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 792ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/135 places, 29/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 967 ms. Remains : 22/135 places, 29/174 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-01 finished in 1091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&X((p0 U (G(p0)||(p1&&X((F(p2)||G(p1))))))))) U X(p3)))'
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 174/174 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 125 transition count 164
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 125 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 124 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 123 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 123 transition count 162
Applied a total of 24 rules in 7 ms. Remains 123 /135 variables (removed 12) and now considering 162/174 (removed 12) transitions.
// Phase 1: matrix 162 rows 123 cols
[2025-06-06 22:20:06] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:20:06] [INFO ] Implicit Places using invariants in 370 ms returned []
[2025-06-06 22:20:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:20:06] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-06 22:20:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 126 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5618 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 161/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:20:14] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 288 constraints, problems are : Problem set: 0 solved, 161 unsolved in 8124 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13762ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 13763ms
Starting structural reductions in LTL mode, iteration 1 : 123/135 places, 162/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14239 ms. Remains : 123/135 places, 162/174 transitions.
Stuttering acceptance computed with spot in 415 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-02
Product exploration explored 100000 steps with 780 reset in 217 ms.
Product exploration explored 100000 steps with 757 reset in 233 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Detected a total of 29/123 stabilizing places and 29/162 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (AND p0 (NOT p3) p1)), (X (AND p0 (NOT p3))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 229 ms. Reduced automaton from 10 states, 32 edges and 4 AP (stutter sensitive) to 10 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 425 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (279 resets) in 349 ms. (114 steps per ms) remains 3/20 properties
BEST_FIRST walk for 8587 steps (10 resets) in 54 ms. (156 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p3) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (AND p0 (NOT p3) p1)), (X (AND p0 (NOT p3))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT (AND p0 (NOT p3) p1))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p3 p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) p1 p2))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 29 factoid took 1050 ms. Reduced automaton from 10 states, 31 edges and 4 AP (stutter sensitive) to 10 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 341 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2025-06-06 22:20:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 22:20:24] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-06 22:20:24] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-06 22:20:24] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-06-06 22:20:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 22:20:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-06 22:20:24] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 22:20:24] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-06 22:20:24] [INFO ] Computed and/alt/rep : 161/256/161 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-06 22:20:24] [INFO ] Added : 155 causal constraints over 31 iterations in 475 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2025-06-06 22:20:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:20:25] [INFO ] Implicit Places using invariants in 307 ms returned []
[2025-06-06 22:20:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:20:25] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-06 22:20:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 126 constraints, problems are : Problem set: 0 solved, 161 unsolved in 6004 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 161/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:20:33] [INFO ] Deduced a trap along path composed of 2 places in 36 ms of which 22 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 288 constraints, problems are : Problem set: 0 solved, 161 unsolved in 8232 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 14249ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 14249ms
Finished structural reductions in LTL mode , in 1 iterations and 14702 ms. Remains : 123/123 places, 162/162 transitions.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Detected a total of 29/123 stabilizing places and 29/162 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (AND p0 (NOT p3) p1)), (X (AND p0 (NOT p3))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 153 ms. Reduced automaton from 10 states, 31 edges and 4 AP (stutter sensitive) to 10 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (282 resets) in 274 ms. (145 steps per ms) remains 3/20 properties
BEST_FIRST walk for 3677 steps (3 resets) in 22 ms. (159 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p3) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (AND p0 (NOT p3) p1)), (X (AND p0 (NOT p3))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p2))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT (AND p0 (NOT p3) p1))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p3 p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p3)))), (F p3), (F (NOT (OR (NOT p0) p1 p2))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 29 factoid took 946 ms. Reduced automaton from 10 states, 31 edges and 4 AP (stutter sensitive) to 10 states, 31 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 354 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 343 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2025-06-06 22:20:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 22:20:41] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2025-06-06 22:20:41] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 22:20:41] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-06-06 22:20:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 22:20:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-06 22:20:41] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 22:20:42] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-06 22:20:42] [INFO ] Computed and/alt/rep : 161/256/161 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-06 22:20:42] [INFO ] Added : 155 causal constraints over 31 iterations in 409 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 371 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 755 reset in 123 ms.
Product exploration explored 100000 steps with 758 reset in 155 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 356 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 162/162 transitions.
Graph (trivial) has 114 edges and 123 vertex of which 33 / 123 are part of one of the 4 SCC in 0 ms
Free SCC test removed 29 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 94 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 94 transition count 119
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 33 place count 94 transition count 120
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 38 place count 94 transition count 120
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 52 place count 80 transition count 106
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 66 place count 80 transition count 106
Performed 27 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 93 place count 80 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 99 place count 80 transition count 98
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 125 place count 54 transition count 71
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 151 place count 54 transition count 71
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 152 place count 53 transition count 70
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 153 place count 53 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 53 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 53 transition count 69
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 160 place count 49 transition count 65
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 164 place count 49 transition count 65
Deduced a syphon composed of 21 places in 0 ms
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 174 place count 49 transition count 55
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 95 edges and 47 vertex of which 45 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 177 place count 45 transition count 53
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 178 place count 44 transition count 52
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 44 transition count 52
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 179 rules in 23 ms. Remains 44 /123 variables (removed 79) and now considering 52/162 (removed 110) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:20:44] [INFO ] Redundant transitions in 327 ms returned []
Running 51 sub problems to find dead transitions.
[2025-06-06 22:20:44] [INFO ] Flow matrix only has 49 transitions (discarded 3 similar events)
// Phase 1: matrix 49 rows 44 cols
[2025-06-06 22:20:44] [INFO ] Computed 1 invariants in 1 ms
[2025-06-06 22:20:44] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
At refinement iteration 2 (OVERLAPS) 48/91 variables, 43/44 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 7/51 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/51 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/92 variables, 1/52 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/52 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/53 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/53 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/93 variables, 0/53 constraints. Problems are: Problem set: 19 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 53 constraints, problems are : Problem set: 19 solved, 32 unsolved in 1045 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 1/1 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 48/74 variables, 26/27 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 7/34 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 32/66 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/66 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 18/92 variables, 18/84 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 0/84 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 1/93 variables, 1/85 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/85 constraints. Problems are: Problem set: 19 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 0/93 variables, 0/85 constraints. Problems are: Problem set: 19 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 85 constraints, problems are : Problem set: 19 solved, 32 unsolved in 878 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 32/51 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1953ms problems are : Problem set: 19 solved, 32 unsolved
Search for dead transitions found 19 dead transitions in 1953ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 44/123 places, 33/162 transitions.
Graph (complete) has 60 edges and 44 vertex of which 26 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 26 /44 variables (removed 18) and now considering 33/33 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/123 places, 33/162 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2321 ms. Remains : 26/123 places, 33/162 transitions.
Built C files in :
/tmp/ltsmin8995884220988533222
[2025-06-06 22:20:46] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8995884220988533222
Running compilation step : cd /tmp/ltsmin8995884220988533222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 361 ms.
Running link step : cd /tmp/ltsmin8995884220988533222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin8995884220988533222;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5076815131381856314.hoa' '--buchi-type=spotba'
LTSmin run took 216 ms.
FORMULA SmartHome-PT-09-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-09-LTLFireability-02 finished in 40541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 174/174 transitions.
Graph (trivial) has 134 edges and 135 vertex of which 72 / 135 are part of one of the 6 SCC in 0 ms
Free SCC test removed 66 places
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 68 transition count 67
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 22 rules applied. Total rules applied 41 place count 50 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 48 transition count 63
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 43 place count 48 transition count 58
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 53 place count 43 transition count 58
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 59 place count 37 transition count 52
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 37 transition count 52
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 89 place count 25 transition count 40
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 98 place count 25 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 24 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 99 place count 24 transition count 30
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 101 place count 23 transition count 30
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 23 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 23 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 22 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 105 place count 21 transition count 28
Applied a total of 105 rules in 18 ms. Remains 21 /135 variables (removed 114) and now considering 28/174 (removed 146) transitions.
[2025-06-06 22:20:46] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
// Phase 1: matrix 23 rows 21 cols
[2025-06-06 22:20:46] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:20:46] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-06 22:20:46] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
[2025-06-06 22:20:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:20:46] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:20:46] [INFO ] Redundant transitions in 23 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-06 22:20:46] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
[2025-06-06 22:20:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 3/43 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/44 variables, and 22 constraints, problems are : Problem set: 0 solved, 14 unsolved in 184 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 3/43 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/44 variables, and 36 constraints, problems are : Problem set: 0 solved, 14 unsolved in 156 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 345ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 345ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/135 places, 28/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 500 ms. Remains : 21/135 places, 28/174 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-04 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((G(p0)||(p0&&G(F(p1))))))||(p2&&X(F((G(p0)||(p0&&G(F(p1))))))))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 174/174 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 125 transition count 164
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 125 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 124 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 123 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 123 transition count 162
Applied a total of 24 rules in 11 ms. Remains 123 /135 variables (removed 12) and now considering 162/174 (removed 12) transitions.
// Phase 1: matrix 162 rows 123 cols
[2025-06-06 22:20:47] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:20:47] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-06 22:20:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:20:47] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-06 22:20:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 126 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5454 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 161/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:20:55] [INFO ] Deduced a trap along path composed of 2 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 288 constraints, problems are : Problem set: 0 solved, 161 unsolved in 8550 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 14014ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 14014ms
Starting structural reductions in LTL mode, iteration 1 : 123/135 places, 162/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14133 ms. Remains : 123/135 places, 162/174 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-05
Product exploration explored 100000 steps with 693 reset in 102 ms.
Product exploration explored 100000 steps with 700 reset in 137 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Detected a total of 29/123 stabilizing places and 29/162 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 119 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 25000 steps (170 resets) in 50 ms. (490 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p2))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 18 factoid took 253 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 123 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 162/162 transitions.
Graph (trivial) has 117 edges and 123 vertex of which 62 / 123 are part of one of the 6 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 66 transition count 66
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 49 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 48 transition count 65
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 37 place count 48 transition count 60
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 47 place count 43 transition count 60
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 79 place count 27 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 27 transition count 42
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 89 place count 27 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 26 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 90 place count 26 transition count 32
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 92 place count 25 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 93 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 94 place count 23 transition count 31
Applied a total of 94 rules in 13 ms. Remains 23 /123 variables (removed 100) and now considering 31/162 (removed 131) transitions.
[2025-06-06 22:21:02] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
// Phase 1: matrix 26 rows 23 cols
[2025-06-06 22:21:02] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:02] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 22:21:02] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
[2025-06-06 22:21:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:02] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:21:02] [INFO ] Redundant transitions in 23 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-06 22:21:02] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
[2025-06-06 22:21:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 24/45 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/49 variables, and 23 constraints, problems are : Problem set: 0 solved, 16 unsolved in 191 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 24/45 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/46 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 1/47 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 1/48 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/49 variables, and 40 constraints, problems are : Problem set: 0 solved, 16 unsolved in 316 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 511ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 511ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/123 places, 31/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 617 ms. Remains : 23/123 places, 31/162 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Detected a total of 18/23 stabilizing places and 18/31 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 321 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2631 steps (198 resets) in 29 ms. (87 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 440 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 29 steps with 1 reset in 1 ms.
FORMULA SmartHome-PT-09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-05 finished in 17059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G((p1&&X((p1 U (p2||G(p1))))))))'
Support contains 2 out of 135 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 174/174 transitions.
Graph (trivial) has 129 edges and 135 vertex of which 72 / 135 are part of one of the 6 SCC in 0 ms
Free SCC test removed 66 places
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 68 transition count 70
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 19 rules applied. Total rules applied 35 place count 53 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 51 transition count 66
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 37 place count 51 transition count 60
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 49 place count 45 transition count 60
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 53 place count 41 transition count 56
Iterating global reduction 3 with 4 rules applied. Total rules applied 57 place count 41 transition count 56
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 83 place count 28 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 91 place count 28 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 27 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 92 place count 27 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 94 place count 26 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 96 place count 24 transition count 33
Applied a total of 96 rules in 13 ms. Remains 24 /135 variables (removed 111) and now considering 33/174 (removed 141) transitions.
[2025-06-06 22:21:04] [INFO ] Flow matrix only has 28 transitions (discarded 5 similar events)
// Phase 1: matrix 28 rows 24 cols
[2025-06-06 22:21:04] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:04] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-06 22:21:04] [INFO ] Flow matrix only has 28 transitions (discarded 5 similar events)
[2025-06-06 22:21:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:04] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:21:04] [INFO ] Redundant transitions in 22 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-06 22:21:04] [INFO ] Flow matrix only has 28 transitions (discarded 5 similar events)
[2025-06-06 22:21:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 26/48 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/49 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/49 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/52 variables, and 24 constraints, problems are : Problem set: 0 solved, 18 unsolved in 208 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/24 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 26/48 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/49 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/50 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1/51 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 0/51 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/52 variables, and 43 constraints, problems are : Problem set: 0 solved, 18 unsolved in 325 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 537ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 537ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/135 places, 33/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 630 ms. Remains : 24/135 places, 33/174 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-07 finished in 723 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&((p1 U (p2 U X(p2)))||X(p3))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 174/174 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 125 transition count 164
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 125 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 124 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 123 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 123 transition count 162
Applied a total of 24 rules in 7 ms. Remains 123 /135 variables (removed 12) and now considering 162/174 (removed 12) transitions.
// Phase 1: matrix 162 rows 123 cols
[2025-06-06 22:21:05] [INFO ] Computed 3 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:05] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-06 22:21:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:05] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2025-06-06 22:21:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 126 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5456 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/285 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 161/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:15] [INFO ] Deduced a trap along path composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/285 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (OVERLAPS) 0/285 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 288 constraints, problems are : Problem set: 0 solved, 161 unsolved in 10632 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 16099ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 16099ms
Starting structural reductions in LTL mode, iteration 1 : 123/135 places, 162/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16224 ms. Remains : 123/135 places, 162/174 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-09
Stuttering criterion allowed to conclude after 164 steps with 1 reset in 1 ms.
FORMULA SmartHome-PT-09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-09 finished in 16554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p0&&F(p1)))))))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 174/174 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 124 transition count 163
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 123 transition count 162
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 123 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 122 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 122 transition count 161
Applied a total of 26 rules in 10 ms. Remains 122 /135 variables (removed 13) and now considering 161/174 (removed 13) transitions.
// Phase 1: matrix 161 rows 122 cols
[2025-06-06 22:21:21] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:21] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-06 22:21:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:21] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-06-06 22:21:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/283 variables, 122/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 125 constraints, problems are : Problem set: 0 solved, 160 unsolved in 5267 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/283 variables, 122/125 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 160/285 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:29] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/283 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 286 constraints, problems are : Problem set: 0 solved, 160 unsolved in 8277 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13553ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 13553ms
Starting structural reductions in LTL mode, iteration 1 : 122/135 places, 161/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13671 ms. Remains : 122/135 places, 161/174 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-10
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-10 finished in 13831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 174/174 transitions.
Graph (trivial) has 133 edges and 135 vertex of which 72 / 135 are part of one of the 6 SCC in 0 ms
Free SCC test removed 66 places
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 68 transition count 68
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 21 rules applied. Total rules applied 39 place count 51 transition count 64
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 42 place count 49 transition count 63
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 44 place count 48 transition count 62
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 44 place count 48 transition count 57
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 54 place count 43 transition count 57
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 59 place count 38 transition count 52
Iterating global reduction 4 with 5 rules applied. Total rules applied 64 place count 38 transition count 52
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 90 place count 25 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 99 place count 25 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 100 place count 24 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 100 place count 24 transition count 29
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 102 place count 23 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 22 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 104 place count 21 transition count 28
Applied a total of 104 rules in 13 ms. Remains 21 /135 variables (removed 114) and now considering 28/174 (removed 146) transitions.
[2025-06-06 22:21:35] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
// Phase 1: matrix 23 rows 21 cols
[2025-06-06 22:21:35] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:35] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-06 22:21:35] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
[2025-06-06 22:21:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:35] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:21:35] [INFO ] Redundant transitions in 24 ms returned []
Running 14 sub problems to find dead transitions.
[2025-06-06 22:21:35] [INFO ] Flow matrix only has 23 transitions (discarded 5 similar events)
[2025-06-06 22:21:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/41 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/44 variables, and 21 constraints, problems are : Problem set: 0 solved, 14 unsolved in 174 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/41 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 1/43 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/44 variables, and 36 constraints, problems are : Problem set: 0 solved, 14 unsolved in 240 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 417ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 417ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/135 places, 28/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 516 ms. Remains : 21/135 places, 28/174 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-11 finished in 560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 174/174 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 126 transition count 165
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 126 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 125 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 125 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 124 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 124 transition count 163
Applied a total of 22 rules in 4 ms. Remains 124 /135 variables (removed 11) and now considering 163/174 (removed 11) transitions.
// Phase 1: matrix 163 rows 124 cols
[2025-06-06 22:21:36] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:36] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-06 22:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:36] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2025-06-06 22:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/287 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 127 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5546 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 163/287 variables, 124/127 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 162/289 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:44] [INFO ] Deduced a trap along path composed of 2 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 0/287 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 290 constraints, problems are : Problem set: 0 solved, 162 unsolved in 8212 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13785ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 13785ms
Starting structural reductions in LTL mode, iteration 1 : 124/135 places, 163/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13901 ms. Remains : 124/135 places, 163/174 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 12 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-09-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-09-LTLFireability-13 finished in 14305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0)) U p1) U p2))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 174/174 transitions.
Graph (trivial) has 128 edges and 135 vertex of which 55 / 135 are part of one of the 5 SCC in 0 ms
Free SCC test removed 50 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 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 84 transition count 82
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 31 rules applied. Total rules applied 57 place count 59 transition count 76
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 61 place count 56 transition count 75
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 55 transition count 74
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 63 place count 55 transition count 69
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 73 place count 50 transition count 69
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 77 place count 46 transition count 64
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 46 transition count 64
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 115 place count 29 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 116 place count 29 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 28 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 119 place count 28 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 129 place count 28 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 131 place count 26 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 131 place count 26 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 133 place count 25 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 134 place count 25 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 135 place count 24 transition count 31
Applied a total of 135 rules in 6 ms. Remains 24 /135 variables (removed 111) and now considering 31/174 (removed 143) transitions.
[2025-06-06 22:21:50] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 24 cols
[2025-06-06 22:21:50] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-06 22:21:50] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2025-06-06 22:21:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:50] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 22:21:50] [INFO ] Redundant transitions in 23 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-06 22:21:50] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2025-06-06 22:21:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 25/46 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 2/48 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/51 variables, and 24 constraints, problems are : Problem set: 0 solved, 18 unsolved in 193 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/24 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 25/46 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/48 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/49 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 1/50 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/50 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/50 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/51 variables, and 43 constraints, problems are : Problem set: 0 solved, 18 unsolved in 357 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 586ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 586ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/135 places, 31/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 726 ms. Remains : 24/135 places, 31/174 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-14 finished in 834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(G(p1))&&p0))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 174/174 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 125 transition count 164
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 125 transition count 164
Applied a total of 20 rules in 3 ms. Remains 125 /135 variables (removed 10) and now considering 164/174 (removed 10) transitions.
// Phase 1: matrix 164 rows 125 cols
[2025-06-06 22:21:51] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 22:21:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 22:21:51] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-06-06 22:21:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/289 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 128 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5404 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/289 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 163/291 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 22:21:59] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 292 constraints, problems are : Problem set: 0 solved, 163 unsolved in 8429 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 13865ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 13867ms
Starting structural reductions in LTL mode, iteration 1 : 125/135 places, 164/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13983 ms. Remains : 125/135 places, 164/174 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-15
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-15 finished in 14096 ms.
All properties solved by simple procedures.
Total runtime 155290 ms.

BK_STOP 1749248525381

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-09"
export BK_EXAMINATION="LTLFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-09, 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 r212-tall-174901995000756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-09.tgz
mv SmartHome-PT-09 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.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;