Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 03:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 03:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 03:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SmartHome-PT-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 1717005003424

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 17:50:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 17:50:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 17:50:05] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-29 17:50:05] [INFO ] Transformed 253 places.
[2024-05-29 17:50:05] [INFO ] Transformed 293 transitions.
[2024-05-29 17:50:05] [INFO ] Found NUPN structural information;
[2024-05-29 17:50:05] [INFO ] Parsed PT model containing 253 places and 293 transitions and 664 arcs in 309 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 29 places in 7 ms
Reduce places removed 29 places and 30 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-09-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 59 place count 165 transition count 211
Iterating global reduction 1 with 52 rules applied. Total rules applied 111 place count 165 transition count 211
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 116 place count 165 transition count 206
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 128 place count 153 transition count 194
Iterating global reduction 2 with 12 rules applied. Total rules applied 140 place count 153 transition count 194
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 151 place count 142 transition count 183
Iterating global reduction 2 with 11 rules applied. Total rules applied 162 place count 142 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 163 place count 142 transition count 182
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 167 place count 138 transition count 178
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 138 transition count 178
Applied a total of 171 rules in 137 ms. Remains 138 /224 variables (removed 86) and now considering 178/263 (removed 85) transitions.
// Phase 1: matrix 178 rows 138 cols
[2024-05-29 17:50:05] [INFO ] Computed 3 invariants in 18 ms
[2024-05-29 17:50:06] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-29 17:50:06] [INFO ] Invariant cache hit.
[2024-05-29 17:50:06] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-29 17:50:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/316 variables, 138/141 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 141 constraints, problems are : Problem set: 0 solved, 177 unsolved in 6581 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/316 variables, 138/141 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 177/318 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/316 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 318 constraints, problems are : Problem set: 0 solved, 177 unsolved in 5194 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 11887ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 11911ms
Starting structural reductions in LTL mode, iteration 1 : 138/224 places, 178/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12771 ms. Remains : 138/224 places, 178/263 transitions.
Support contains 24 out of 138 places after structural reductions.
[2024-05-29 17:50:18] [INFO ] Flatten gal took : 67 ms
[2024-05-29 17:50:18] [INFO ] Flatten gal took : 21 ms
[2024-05-29 17:50:18] [INFO ] Input system was already deterministic with 178 transitions.
RANDOM walk for 35253 steps (238 resets) in 1069 ms. (32 steps per ms) remains 0/21 properties
Computed a total of 33 stabilizing places and 33 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&((X(p1)&&F(p2))||X(G(p1)))))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 129 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 129 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 129 transition count 168
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 126 transition count 165
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 126 transition count 165
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 124 transition count 163
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 123 transition count 162
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 123 transition count 162
Applied a total of 31 rules in 15 ms. Remains 123 /138 variables (removed 15) and now considering 162/178 (removed 16) transitions.
// Phase 1: matrix 162 rows 123 cols
[2024-05-29 17:50:19] [INFO ] Computed 3 invariants in 4 ms
[2024-05-29 17:50:19] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 17:50:19] [INFO ] Invariant cache hit.
[2024-05-29 17:50:19] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-29 17:50:19] [INFO ] Invariant cache hit.
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 4720 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]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
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
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 287 constraints, problems are : Problem set: 0 solved, 161 unsolved in 4287 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]
After SMT, in 9056ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 9061ms
Starting structural reductions in LTL mode, iteration 1 : 123/138 places, 162/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9299 ms. Remains : 123/138 places, 162/178 transitions.
Stuttering acceptance computed with spot in 425 ms :[p0, true, (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-03
Stuttering criterion allowed to conclude after 2780 steps with 39 reset in 38 ms.
FORMULA SmartHome-PT-09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-03 finished in 9853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!p0 U (G(!p0)||(!p0&&G(p1))))||(X(X(G(!p1)))&&p2))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 128 transition count 168
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 128 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 128 transition count 167
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 125 transition count 164
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 125 transition count 164
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 123 transition count 162
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 123 transition count 162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 122 transition count 161
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 122 transition count 161
Applied a total of 33 rules in 17 ms. Remains 122 /138 variables (removed 16) and now considering 161/178 (removed 17) transitions.
// Phase 1: matrix 161 rows 122 cols
[2024-05-29 17:50:29] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 17:50:29] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 17:50:29] [INFO ] Invariant cache hit.
[2024-05-29 17:50:29] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-29 17:50:29] [INFO ] Invariant cache hit.
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 4508 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]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
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
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 285 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4213 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]
After SMT, in 8760ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 8764ms
Starting structural reductions in LTL mode, iteration 1 : 122/138 places, 161/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8992 ms. Remains : 122/138 places, 161/178 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR p1 (AND p0 (NOT p2))), true, p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR p1 p0), (OR p1 (AND p0 (NOT p2)))]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-05
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-05 finished in 9338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p1)))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 130 transition count 170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 130 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 130 transition count 169
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 128 transition count 167
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 128 transition count 167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 127 transition count 166
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 127 transition count 166
Applied a total of 23 rules in 12 ms. Remains 127 /138 variables (removed 11) and now considering 166/178 (removed 12) transitions.
// Phase 1: matrix 166 rows 127 cols
[2024-05-29 17:50:38] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 17:50:38] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 17:50:38] [INFO ] Invariant cache hit.
[2024-05-29 17:50:39] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-29 17:50:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/293 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/293 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 130 constraints, problems are : Problem set: 0 solved, 165 unsolved in 4852 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/293 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 165/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/293 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 295 constraints, problems are : Problem set: 0 solved, 165 unsolved in 4170 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints]
After SMT, in 9053ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 9056ms
Starting structural reductions in LTL mode, iteration 1 : 127/138 places, 166/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9273 ms. Remains : 127/138 places, 166/178 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-06
Product exploration explored 100000 steps with 33270 reset in 341 ms.
Product exploration explored 100000 steps with 33467 reset in 329 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/127 stabilizing places and 29/166 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 194 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 33259 steps (229 resets) in 244 ms. (135 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0)))), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 10 factoid took 481 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 166/166 transitions.
Graph (trivial) has 124 edges and 127 vertex of which 63 / 127 are part of one of the 6 SCC in 4 ms
Free SCC test removed 57 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 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 67
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 50 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 48 transition count 64
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 44 place count 48 transition count 59
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 54 place count 43 transition count 59
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 84 place count 28 transition count 43
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 93 place count 28 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 27 transition count 34
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 95 place count 27 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 25 transition count 32
Applied a total of 97 rules in 41 ms. Remains 25 /127 variables (removed 102) and now considering 32/166 (removed 134) transitions.
[2024-05-29 17:50:50] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 25 cols
[2024-05-29 17:50:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 17:50:50] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-29 17:50:50] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-29 17:50:50] [INFO ] Invariant cache hit.
[2024-05-29 17:50:50] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-29 17:50:50] [INFO ] Redundant transitions in 29 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-29 17:50:50] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-29 17:50:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 25/48 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 3/51 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/52 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 25/48 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 3/51 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/51 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/52 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 609ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 610ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/127 places, 32/166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 819 ms. Remains : 25/127 places, 32/166 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Detected a total of 20/25 stabilizing places and 20/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 455 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 5001 steps (419 resets) in 40 ms. (121 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 681 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-06 finished in 13777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p1&&X(p2))) U X(G(!p0))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 130 transition count 170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 130 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 130 transition count 169
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 127 transition count 166
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 127 transition count 166
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 125 transition count 164
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 125 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 124 transition count 163
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 124 transition count 163
Applied a total of 29 rules in 11 ms. Remains 124 /138 variables (removed 14) and now considering 163/178 (removed 15) transitions.
// Phase 1: matrix 163 rows 124 cols
[2024-05-29 17:50:52] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 17:50:52] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-29 17:50:52] [INFO ] Invariant cache hit.
[2024-05-29 17:50:53] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-29 17:50:53] [INFO ] Invariant cache hit.
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 4733 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]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
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
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 289 constraints, problems are : Problem set: 0 solved, 162 unsolved in 4364 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]
After SMT, in 9128ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 9133ms
Starting structural reductions in LTL mode, iteration 1 : 124/138 places, 163/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9589 ms. Remains : 124/138 places, 163/178 transitions.
Stuttering acceptance computed with spot in 131 ms :[p0, (AND p0 (NOT p2)), p0, true]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-07
Entered a terminal (fully accepting) state of product in 86 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 9738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 128 transition count 168
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 128 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 128 transition count 167
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 125 transition count 164
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 125 transition count 164
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 123 transition count 162
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 123 transition count 162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 122 transition count 161
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 122 transition count 161
Applied a total of 33 rules in 14 ms. Remains 122 /138 variables (removed 16) and now considering 161/178 (removed 17) transitions.
// Phase 1: matrix 161 rows 122 cols
[2024-05-29 17:51:02] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 17:51:02] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 17:51:02] [INFO ] Invariant cache hit.
[2024-05-29 17:51:02] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-05-29 17:51:02] [INFO ] Invariant cache hit.
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 4592 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]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
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
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 285 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4305 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]
After SMT, in 8921ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 8923ms
Starting structural reductions in LTL mode, iteration 1 : 122/138 places, 161/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9119 ms. Remains : 122/138 places, 161/178 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-10
Stuttering criterion allowed to conclude after 283 steps with 2 reset in 1 ms.
FORMULA SmartHome-PT-09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-10 finished in 9237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((F(p1)&&G(F(p0))))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 130 transition count 170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 130 transition count 170
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 128 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 128 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 126 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 126 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 125 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 125 transition count 165
Applied a total of 26 rules in 11 ms. Remains 125 /138 variables (removed 13) and now considering 165/178 (removed 13) transitions.
// Phase 1: matrix 165 rows 125 cols
[2024-05-29 17:51:11] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 17:51:11] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-29 17:51:11] [INFO ] Invariant cache hit.
[2024-05-29 17:51:11] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-29 17:51:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/290 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 128 constraints, problems are : Problem set: 0 solved, 164 unsolved in 4546 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/290 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 164/292 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 292 constraints, problems are : Problem set: 0 solved, 164 unsolved in 4168 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 8743ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 8745ms
Starting structural reductions in LTL mode, iteration 1 : 125/138 places, 165/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8945 ms. Remains : 125/138 places, 165/178 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-11
Stuttering criterion allowed to conclude after 163 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 9236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(F(p1)))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 129 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 129 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 129 transition count 168
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 127 transition count 166
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 127 transition count 166
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 125 transition count 164
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 125 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 124 transition count 163
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 124 transition count 163
Applied a total of 29 rules in 13 ms. Remains 124 /138 variables (removed 14) and now considering 163/178 (removed 15) transitions.
// Phase 1: matrix 163 rows 124 cols
[2024-05-29 17:51:20] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 17:51:20] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 17:51:20] [INFO ] Invariant cache hit.
[2024-05-29 17:51:21] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-05-29 17:51:21] [INFO ] Invariant cache hit.
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 4828 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]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
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
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 289 constraints, problems are : Problem set: 0 solved, 162 unsolved in 4282 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]
After SMT, in 9132ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 9135ms
Starting structural reductions in LTL mode, iteration 1 : 124/138 places, 163/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9326 ms. Remains : 124/138 places, 163/178 transitions.
Stuttering acceptance computed with spot in 149 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 135 ms.
Product exploration explored 100000 steps with 50000 reset in 170 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 14 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 9814 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0)) U p1) U p2))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Graph (trivial) has 130 edges and 138 vertex of which 57 / 138 are part of one of the 5 SCC in 1 ms
Free SCC test removed 52 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 85 transition count 85
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 61 transition count 83
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 60 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 59 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 54 place count 59 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 66 place count 53 transition count 76
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 70 place count 49 transition count 72
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 49 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 49 transition count 71
Performed 21 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 117 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 118 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 128 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 130 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 130 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 132 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 133 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 134 place count 24 transition count 31
Applied a total of 134 rules in 20 ms. Remains 24 /138 variables (removed 114) and now considering 31/178 (removed 147) transitions.
[2024-05-29 17:51:30] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 24 cols
[2024-05-29 17:51:30] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 17:51:30] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 17:51:30] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2024-05-29 17:51:30] [INFO ] Invariant cache hit.
[2024-05-29 17:51:30] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-29 17:51:30] [INFO ] Redundant transitions in 24 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-29 17:51:30] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2024-05-29 17:51:30] [INFO ] Invariant cache hit.
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 232 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/24 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/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 374 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 611ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 612ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/138 places, 31/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 746 ms. Remains : 24/138 places, 31/178 transitions.
Stuttering acceptance computed with spot in 114 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 1 ms.
FORMULA SmartHome-PT-09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-14 finished in 879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(G(p1))&&p0))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 129 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 129 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 129 transition count 168
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 127 transition count 166
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 127 transition count 166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 126 transition count 165
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 126 transition count 165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 125 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 125 transition count 164
Applied a total of 27 rules in 7 ms. Remains 125 /138 variables (removed 13) and now considering 164/178 (removed 14) transitions.
// Phase 1: matrix 164 rows 125 cols
[2024-05-29 17:51:31] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 17:51:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 17:51:31] [INFO ] Invariant cache hit.
[2024-05-29 17:51:31] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-29 17:51:31] [INFO ] Invariant cache hit.
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 4795 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]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
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
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/289 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 291 constraints, problems are : Problem set: 0 solved, 163 unsolved in 4267 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]
After SMT, in 9081ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 9084ms
Starting structural reductions in LTL mode, iteration 1 : 125/138 places, 164/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9266 ms. Remains : 125/138 places, 164/178 transitions.
Stuttering acceptance computed with spot in 111 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 180 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-15 finished in 9392 ms.
All properties solved by simple procedures.
Total runtime 95806 ms.
ITS solved all properties within timeout

BK_STOP 1717005100950

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SmartHome-PT-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 r377-smll-171683810400404"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;