About the Execution of ITS-Tools for SmartHome-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1646.796 | 144234.00 | 277830.00 | 561.30 | FFFTFFFTTTFTFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r378-smll-171683811400379.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is SmartHome-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683811400379
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 12 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 56K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SmartHome-PT-06-LTLCardinality-00
FORMULA_NAME SmartHome-PT-06-LTLCardinality-01
FORMULA_NAME SmartHome-PT-06-LTLCardinality-02
FORMULA_NAME SmartHome-PT-06-LTLCardinality-03
FORMULA_NAME SmartHome-PT-06-LTLCardinality-04
FORMULA_NAME SmartHome-PT-06-LTLCardinality-05
FORMULA_NAME SmartHome-PT-06-LTLCardinality-06
FORMULA_NAME SmartHome-PT-06-LTLCardinality-07
FORMULA_NAME SmartHome-PT-06-LTLCardinality-08
FORMULA_NAME SmartHome-PT-06-LTLCardinality-09
FORMULA_NAME SmartHome-PT-06-LTLCardinality-10
FORMULA_NAME SmartHome-PT-06-LTLCardinality-11
FORMULA_NAME SmartHome-PT-06-LTLCardinality-12
FORMULA_NAME SmartHome-PT-06-LTLCardinality-13
FORMULA_NAME SmartHome-PT-06-LTLCardinality-14
FORMULA_NAME SmartHome-PT-06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717030682169
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 00:58:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 00:58:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 00:58:05] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2024-05-30 00:58:05] [INFO ] Transformed 219 places.
[2024-05-30 00:58:05] [INFO ] Transformed 254 transitions.
[2024-05-30 00:58:05] [INFO ] Found NUPN structural information;
[2024-05-30 00:58:05] [INFO ] Parsed PT model containing 219 places and 254 transitions and 581 arcs in 649 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 18 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-06-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 151 transition count 185
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 151 transition count 185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 106 place count 151 transition count 181
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 144 transition count 174
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 144 transition count 174
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 126 place count 138 transition count 168
Iterating global reduction 1 with 6 rules applied. Total rules applied 132 place count 138 transition count 168
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 136 transition count 166
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 136 transition count 166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 135 transition count 165
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 135 transition count 165
Applied a total of 138 rules in 166 ms. Remains 135 /202 variables (removed 67) and now considering 165/236 (removed 71) transitions.
// Phase 1: matrix 165 rows 135 cols
[2024-05-30 00:58:05] [INFO ] Computed 9 invariants in 42 ms
[2024-05-30 00:58:06] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-30 00:58:06] [INFO ] Invariant cache hit.
[2024-05-30 00:58:06] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-30 00:58:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 00:58:09] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 31 ms to minimize.
[2024-05-30 00:58:09] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-05-30 00:58:09] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-30 00:58:09] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 3 ms to minimize.
[2024-05-30 00:58:09] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-30 00:58:09] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 2 ms to minimize.
[2024-05-30 00:58:10] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-30 00:58:10] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 165/300 variables, 135/152 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/300 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 152 constraints, problems are : Problem set: 0 solved, 164 unsolved in 7678 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 00:58:15] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 00:58:16] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 00:58:17] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
[2024-05-30 00:58:17] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 165/300 variables, 135/156 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 164/320 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-05-30 00:58:19] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 5 ms to minimize.
[2024-05-30 00:58:20] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-30 00:58:21] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 0/300 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 323 constraints, problems are : Problem set: 0 solved, 164 unsolved in 12863 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 15/15 constraints]
After SMT, in 20701ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 20736ms
Starting structural reductions in LTL mode, iteration 1 : 135/202 places, 165/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21815 ms. Remains : 135/202 places, 165/236 transitions.
Support contains 23 out of 135 places after structural reductions.
[2024-05-30 00:58:27] [INFO ] Flatten gal took : 57 ms
[2024-05-30 00:58:27] [INFO ] Flatten gal took : 25 ms
[2024-05-30 00:58:27] [INFO ] Input system was already deterministic with 165 transitions.
Support contains 21 out of 135 places (down from 23) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 35167 steps (270 resets) in 1190 ms. (29 steps per ms) remains 0/12 properties
FORMULA SmartHome-PT-06-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 12 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 165/165 transitions.
Graph (trivial) has 130 edges and 135 vertex of which 54 / 135 are part of one of the 5 SCC in 4 ms
Free SCC test removed 49 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 85 transition count 74
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 30 rules applied. Total rules applied 55 place count 61 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 58 transition count 68
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 58 place count 58 transition count 62
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 70 place count 52 transition count 62
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 75 place count 47 transition count 57
Iterating global reduction 3 with 5 rules applied. Total rules applied 80 place count 47 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 47 transition count 56
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 113 place count 31 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 122 place count 31 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 124 place count 29 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 126 place count 27 transition count 28
Applied a total of 126 rules in 44 ms. Remains 27 /135 variables (removed 108) and now considering 28/165 (removed 137) transitions.
[2024-05-30 00:58:28] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 27 cols
[2024-05-30 00:58:28] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 00:58:28] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 00:58:28] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2024-05-30 00:58:28] [INFO ] Invariant cache hit.
[2024-05-30 00:58:28] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-30 00:58:28] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-30 00:58:28] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2024-05-30 00:58:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 23/50 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/51 variables, and 34 constraints, problems are : Problem set: 0 solved, 16 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 23/50 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/51 variables, and 50 constraints, problems are : Problem set: 0 solved, 16 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 536ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 537ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/135 places, 28/165 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 711 ms. Remains : 27/135 places, 28/165 transitions.
Stuttering acceptance computed with spot in 289 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-06-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-06-LTLCardinality-00 finished in 1080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 165/165 transitions.
Graph (trivial) has 128 edges and 135 vertex of which 54 / 135 are part of one of the 5 SCC in 0 ms
Free SCC test removed 49 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 85 transition count 79
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 65 transition count 77
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 64 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 63 transition count 76
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 46 place count 63 transition count 68
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 62 place count 55 transition count 68
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 66 place count 51 transition count 64
Iterating global reduction 4 with 4 rules applied. Total rules applied 70 place count 51 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 51 transition count 63
Performed 19 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 109 place count 32 transition count 41
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 117 place count 32 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 118 place count 31 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 119 place count 31 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 120 place count 31 transition count 32
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 122 place count 29 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 123 place count 28 transition count 30
Applied a total of 123 rules in 37 ms. Remains 28 /135 variables (removed 107) and now considering 30/165 (removed 135) transitions.
[2024-05-30 00:58:29] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 28 cols
[2024-05-30 00:58:29] [INFO ] Computed 7 invariants in 2 ms
[2024-05-30 00:58:29] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 00:58:29] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-05-30 00:58:29] [INFO ] Invariant cache hit.
[2024-05-30 00:58:29] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-30 00:58:29] [INFO ] Redundant transitions in 1 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-30 00:58:29] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
[2024-05-30 00:58:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 25/53 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/53 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/54 variables, and 35 constraints, problems are : Problem set: 0 solved, 17 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/28 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 25/53 variables, 28/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/54 variables, and 52 constraints, problems are : Problem set: 0 solved, 17 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 740ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 742ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/135 places, 30/165 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 910 ms. Remains : 28/135 places, 30/165 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-06-LTLCardinality-01
Stuttering criterion allowed to conclude after 50 steps with 3 reset in 5 ms.
FORMULA SmartHome-PT-06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-06-LTLCardinality-01 finished in 982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((G(X((G(p0) U G(p1)))) U p2)))))'
Support contains 2 out of 135 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 165/165 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 128 transition count 158
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 128 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 128 transition count 157
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 125 transition count 154
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 125 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 124 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 124 transition count 153
Applied a total of 23 rules in 15 ms. Remains 124 /135 variables (removed 11) and now considering 153/165 (removed 12) transitions.
// Phase 1: matrix 153 rows 124 cols
[2024-05-30 00:58:30] [INFO ] Computed 9 invariants in 3 ms
[2024-05-30 00:58:30] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-30 00:58:30] [INFO ] Invariant cache hit.
[2024-05-30 00:58:30] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-30 00:58:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-30 00:58:32] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-05-30 00:58:32] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 3 ms to minimize.
[2024-05-30 00:58:32] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 3 ms to minimize.
[2024-05-30 00:58:32] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-30 00:58:33] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 2 ms to minimize.
[2024-05-30 00:58:33] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-30 00:58:33] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-30 00:58:33] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-30 00:58:35] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 3 ms to minimize.
[2024-05-30 00:58:35] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 2 ms to minimize.
[2024-05-30 00:58:35] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/277 variables, 124/144 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 144 constraints, problems are : Problem set: 0 solved, 152 unsolved in 7903 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-30 00:58:39] [INFO ] Deduced a trap composed of 88 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 153/277 variables, 124/145 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 152/297 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 297 constraints, problems are : Problem set: 0 solved, 152 unsolved in 4971 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 12/12 constraints]
After SMT, in 12935ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 12940ms
Starting structural reductions in LTL mode, iteration 1 : 124/135 places, 153/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13267 ms. Remains : 124/135 places, 153/165 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (NOT p2)]
Running random walk in product with property : SmartHome-PT-06-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 427 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-06-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-06-LTLCardinality-08 finished in 14056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 165/165 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 125 transition count 155
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 125 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 125 transition count 153
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 121 transition count 149
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 121 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 119 transition count 147
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 119 transition count 147
Applied a total of 34 rules in 11 ms. Remains 119 /135 variables (removed 16) and now considering 147/165 (removed 18) transitions.
// Phase 1: matrix 147 rows 119 cols
[2024-05-30 00:58:44] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 00:58:44] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-30 00:58:44] [INFO ] Invariant cache hit.
[2024-05-30 00:58:44] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-30 00:58:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-30 00:58:46] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 2 ms to minimize.
[2024-05-30 00:58:46] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 3 ms to minimize.
[2024-05-30 00:58:46] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/266 variables, 119/131 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 131 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/266 variables, 119/131 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 146/277 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 277 constraints, problems are : Problem set: 0 solved, 146 unsolved in 5356 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 3/3 constraints]
After SMT, in 12436ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 12440ms
Starting structural reductions in LTL mode, iteration 1 : 119/135 places, 147/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12725 ms. Remains : 119/135 places, 147/165 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-06-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-06-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-06-LTLCardinality-09 finished in 13017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||X(F((X(F(p2))&&p1)))))))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 165/165 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 125 transition count 155
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 125 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 125 transition count 153
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 120 transition count 148
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 120 transition count 148
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 117 transition count 145
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 117 transition count 145
Applied a total of 38 rules in 10 ms. Remains 117 /135 variables (removed 18) and now considering 145/165 (removed 20) transitions.
// Phase 1: matrix 145 rows 117 cols
[2024-05-30 00:58:57] [INFO ] Computed 9 invariants in 3 ms
[2024-05-30 00:58:57] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-30 00:58:57] [INFO ] Invariant cache hit.
[2024-05-30 00:58:58] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-30 00:58:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 00:58:59] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 3 ms to minimize.
[2024-05-30 00:58:59] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 128 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4713 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 144/272 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 00:59:05] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/262 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 273 constraints, problems are : Problem set: 0 solved, 144 unsolved in 5884 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints]
After SMT, in 10650ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 10652ms
Starting structural reductions in LTL mode, iteration 1 : 117/135 places, 145/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11074 ms. Remains : 117/135 places, 145/165 transitions.
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SmartHome-PT-06-LTLCardinality-12
Stuttering criterion allowed to conclude after 349 steps with 2 reset in 2 ms.
FORMULA SmartHome-PT-06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-06-LTLCardinality-12 finished in 11471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0&&X(!p1))) U G((F(p1)||X(p2)))))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 165/165 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 125 transition count 155
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 125 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 125 transition count 153
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 27 place count 120 transition count 148
Iterating global reduction 1 with 5 rules applied. Total rules applied 32 place count 120 transition count 148
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 117 transition count 145
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 117 transition count 145
Applied a total of 38 rules in 9 ms. Remains 117 /135 variables (removed 18) and now considering 145/165 (removed 20) transitions.
// Phase 1: matrix 145 rows 117 cols
[2024-05-30 00:59:09] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 00:59:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 00:59:09] [INFO ] Invariant cache hit.
[2024-05-30 00:59:09] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-30 00:59:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 00:59:10] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 3 ms to minimize.
[2024-05-30 00:59:10] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 5 ms to minimize.
[2024-05-30 00:59:10] [INFO ] Deduced a trap composed of 84 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 129 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4629 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 144/273 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 00:59:16] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 274 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4719 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 4/4 constraints]
After SMT, in 9374ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 9376ms
Starting structural reductions in LTL mode, iteration 1 : 117/135 places, 145/165 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9550 ms. Remains : 117/135 places, 145/165 transitions.
Stuttering acceptance computed with spot in 429 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p1), false, (AND (NOT p1) (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : SmartHome-PT-06-LTLCardinality-13
Product exploration explored 100000 steps with 25009 reset in 91 ms.
Product exploration explored 100000 steps with 24936 reset in 144 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 180 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 9 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, (NOT p1), false, (AND (NOT p1) (NOT p0) (NOT p2)), false, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (325 resets) in 681 ms. (58 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (66 resets) in 193 ms. (206 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (63 resets) in 251 ms. (158 steps per ms) remains 2/2 properties
[2024-05-30 00:59:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 81/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/117 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 145/262 variables, 117/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 126 constraints, problems are : Problem set: 0 solved, 2 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 81/87 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/117 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 145/262 variables, 117/126 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 127 constraints, problems are : Problem set: 1 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 314ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 145/145 transitions.
Graph (trivial) has 105 edges and 117 vertex of which 58 / 117 are part of one of the 5 SCC in 0 ms
Free SCC test removed 53 places
Drop transitions (Empty/Sink Transition effects.) removed 74 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 78 transitions.
Graph (complete) has 134 edges and 64 vertex of which 62 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 62 transition count 55
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 21 place count 56 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 54 transition count 53
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 23 place count 54 transition count 45
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 39 place count 46 transition count 45
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 45 transition count 44
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 45 transition count 44
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 61 place count 35 transition count 34
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 35 transition count 33
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 68 place count 35 transition count 27
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 74 place count 29 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 75 place count 28 transition count 26
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 79 place count 25 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 80 place count 24 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 80 place count 24 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 84 place count 22 transition count 23
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 86 place count 22 transition count 21
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 88 place count 20 transition count 21
Applied a total of 88 rules in 54 ms. Remains 20 /117 variables (removed 97) and now considering 21/145 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 20/117 places, 21/145 transitions.
RANDOM walk for 1157 steps (0 resets) in 8 ms. (128 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p2 p0 p1))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 17 factoid took 485 ms. Reduced automaton from 9 states, 20 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 4 out of 117 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 145/145 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2024-05-30 00:59:21] [INFO ] Invariant cache hit.
[2024-05-30 00:59:21] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 00:59:21] [INFO ] Invariant cache hit.
[2024-05-30 00:59:21] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-30 00:59:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 00:59:22] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-30 00:59:22] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 2 ms to minimize.
[2024-05-30 00:59:22] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 129 constraints, problems are : Problem set: 0 solved, 144 unsolved in 4843 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 144/273 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 00:59:28] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 274 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6046 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 4/4 constraints]
After SMT, in 10912ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 10915ms
Finished structural reductions in LTL mode , in 1 iterations and 11124 ms. Remains : 117/117 places, 145/145 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 124 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
RANDOM walk for 40000 steps (320 resets) in 350 ms. (113 steps per ms) remains 1/3 properties
BEST_FIRST walk for 35339 steps (59 resets) in 44 ms. (785 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Product exploration explored 100000 steps with 1014 reset in 197 ms.
Product exploration explored 100000 steps with 987 reset in 382 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 145/145 transitions.
Graph (trivial) has 107 edges and 117 vertex of which 60 / 117 are part of one of the 5 SCC in 1 ms
Free SCC test removed 55 places
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 62 transition count 69
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 10 place count 62 transition count 70
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 62 transition count 70
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 57 transition count 65
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 57 transition count 65
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 40 place count 57 transition count 66
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 54 transition count 62
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 54 transition count 62
Deduced a syphon composed of 21 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 54 transition count 56
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 159 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 52 transition count 55
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 51 transition count 54
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 51 transition count 54
Deduced a syphon composed of 19 places in 0 ms
Applied a total of 56 rules in 56 ms. Remains 51 /117 variables (removed 66) and now considering 54/145 (removed 91) transitions.
[2024-05-30 00:59:34] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-05-30 00:59:34] [INFO ] Flow matrix only has 50 transitions (discarded 4 similar events)
// Phase 1: matrix 50 rows 51 cols
[2024-05-30 00:59:34] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 00:59:34] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-30 00:59:35] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-05-30 00:59:35] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-30 00:59:35] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-05-30 00:59:35] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 2 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-05-30 00:59:35] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
[2024-05-30 00:59:35] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-30 00:59:35] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD35 is UNSAT
[2024-05-30 00:59:35] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/16 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 49/100 variables, 51/67 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/87 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/87 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/101 variables, 1/88 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/88 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/88 constraints. Problems are: Problem set: 20 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 88 constraints, problems are : Problem set: 20 solved, 33 unsolved in 1859 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 20 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 20/51 variables, 8/8 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/16 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 49/100 variables, 51/67 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/87 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 33/120 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/120 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 1/101 variables, 1/121 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/121 constraints. Problems are: Problem set: 20 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/101 variables, 0/121 constraints. Problems are: Problem set: 20 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 121 constraints, problems are : Problem set: 20 solved, 33 unsolved in 1327 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 33/53 constraints, Known Traps: 8/8 constraints]
After SMT, in 3207ms problems are : Problem set: 20 solved, 33 unsolved
Search for dead transitions found 20 dead transitions in 3209ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 51/117 places, 34/145 transitions.
Graph (complete) has 113 edges and 51 vertex of which 32 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 32 /51 variables (removed 19) and now considering 34/34 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/117 places, 34/145 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3279 ms. Remains : 32/117 places, 34/145 transitions.
Built C files in :
/tmp/ltsmin7132618963037475772
[2024-05-30 00:59:38] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7132618963037475772
Running compilation step : cd /tmp/ltsmin7132618963037475772;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 785 ms.
Running link step : cd /tmp/ltsmin7132618963037475772;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin7132618963037475772;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8003707201381236925.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 145/145 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 116 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 116 transition count 144
Applied a total of 2 rules in 4 ms. Remains 116 /117 variables (removed 1) and now considering 144/145 (removed 1) transitions.
// Phase 1: matrix 144 rows 116 cols
[2024-05-30 00:59:53] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 00:59:53] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-30 00:59:53] [INFO ] Invariant cache hit.
[2024-05-30 00:59:53] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-30 00:59:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-30 00:59:55] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-30 00:59:55] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 4 ms to minimize.
[2024-05-30 00:59:55] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/260 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 128 constraints, problems are : Problem set: 0 solved, 143 unsolved in 6861 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/260 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 143/271 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-30 01:00:03] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-05-30 01:00:03] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-30 01:00:04] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/260 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 274 constraints, problems are : Problem set: 0 solved, 143 unsolved in 8796 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 6/6 constraints]
After SMT, in 15677ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 15679ms
Starting structural reductions in LTL mode, iteration 1 : 116/117 places, 144/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15871 ms. Remains : 116/117 places, 144/145 transitions.
Built C files in :
/tmp/ltsmin7827712465696444893
[2024-05-30 01:00:09] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7827712465696444893
Running compilation step : cd /tmp/ltsmin7827712465696444893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 630 ms.
Running link step : cd /tmp/ltsmin7827712465696444893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin7827712465696444893;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15120179580624815837.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 01:00:24] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:00:24] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:00:24] [INFO ] Time to serialize gal into /tmp/LTL9135069789496900987.gal : 4 ms
[2024-05-30 01:00:24] [INFO ] Time to serialize properties into /tmp/LTL2449949649593831454.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9135069789496900987.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3157406398478040319.hoa' '-atoms' '/tmp/LTL2449949649593831454.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2449949649593831454.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3157406398478040319.hoa
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t38, t76, t99, t140, Intersection with reachable at each step enabled. (de...200
Computing Next relation with stutter on 14 deadlock states
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 items max in DFS search stack
158 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.61666,54096,1,0,225,169337,323,169,3643,195933,441
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-06-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SmartHome-PT-06-LTLCardinality-13 finished in 77185 ms.
All properties solved by simple procedures.
Total runtime 141726 ms.
BK_STOP 1717030826403
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683811400379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-06.tgz
mv SmartHome-PT-06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;