fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r378-smll-171683811400412
Last Updated
July 7, 2024

About the Execution of ITS-Tools for SmartHome-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
438.319 120512.00 166854.00 487.70 TFTTFTFFFFFFFTFF 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-171683811400412.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-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683811400412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 12 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 12 03:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 68K 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-10-LTLFireability-00
FORMULA_NAME SmartHome-PT-10-LTLFireability-01
FORMULA_NAME SmartHome-PT-10-LTLFireability-02
FORMULA_NAME SmartHome-PT-10-LTLFireability-03
FORMULA_NAME SmartHome-PT-10-LTLFireability-04
FORMULA_NAME SmartHome-PT-10-LTLFireability-05
FORMULA_NAME SmartHome-PT-10-LTLFireability-06
FORMULA_NAME SmartHome-PT-10-LTLFireability-07
FORMULA_NAME SmartHome-PT-10-LTLFireability-08
FORMULA_NAME SmartHome-PT-10-LTLFireability-09
FORMULA_NAME SmartHome-PT-10-LTLFireability-10
FORMULA_NAME SmartHome-PT-10-LTLFireability-11
FORMULA_NAME SmartHome-PT-10-LTLFireability-12
FORMULA_NAME SmartHome-PT-10-LTLFireability-13
FORMULA_NAME SmartHome-PT-10-LTLFireability-14
FORMULA_NAME SmartHome-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717032582994

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-30 01:29:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 01:29:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:29:45] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-05-30 01:29:45] [INFO ] Transformed 273 places.
[2024-05-30 01:29:45] [INFO ] Transformed 308 transitions.
[2024-05-30 01:29:45] [INFO ] Found NUPN structural information;
[2024-05-30 01:29:45] [INFO ] Parsed PT model containing 273 places and 308 transitions and 699 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 45 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-10-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 263/263 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 178 transition count 208
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 178 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 113 place count 178 transition count 205
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 124 place count 167 transition count 194
Iterating global reduction 1 with 11 rules applied. Total rules applied 135 place count 167 transition count 194
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 146 place count 156 transition count 183
Iterating global reduction 1 with 11 rules applied. Total rules applied 157 place count 156 transition count 183
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 160 place count 153 transition count 180
Iterating global reduction 1 with 3 rules applied. Total rules applied 163 place count 153 transition count 180
Applied a total of 163 rules in 117 ms. Remains 153 /233 variables (removed 80) and now considering 180/263 (removed 83) transitions.
// Phase 1: matrix 180 rows 153 cols
[2024-05-30 01:29:46] [INFO ] Computed 12 invariants in 32 ms
[2024-05-30 01:29:46] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-30 01:29:46] [INFO ] Invariant cache hit.
[2024-05-30 01:29:47] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2024-05-30 01:29:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-30 01:29:50] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 37 ms to minimize.
[2024-05-30 01:29:50] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 3 ms to minimize.
[2024-05-30 01:29:50] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/333 variables, 153/168 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/333 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 168 constraints, problems are : Problem set: 0 solved, 179 unsolved in 11112 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/153 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 180/333 variables, 153/168 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 179/347 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-30 01:30:03] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 3 ms to minimize.
[2024-05-30 01:30:03] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-30 01:30:04] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 0/333 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 350 constraints, problems are : Problem set: 0 solved, 179 unsolved in 14280 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 6/6 constraints]
After SMT, in 25554ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 25599ms
Starting structural reductions in LTL mode, iteration 1 : 153/233 places, 180/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26548 ms. Remains : 153/233 places, 180/263 transitions.
Support contains 18 out of 153 places after structural reductions.
[2024-05-30 01:30:13] [INFO ] Flatten gal took : 103 ms
[2024-05-30 01:30:13] [INFO ] Flatten gal took : 28 ms
[2024-05-30 01:30:13] [INFO ] Input system was already deterministic with 180 transitions.
RANDOM walk for 40000 steps (296 resets) in 1231 ms. (32 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40003 steps (44 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (42 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (43 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (40 resets) in 81 ms. (487 steps per ms) remains 3/4 properties
[2024-05-30 01:30:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/143 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/153 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 180/333 variables, 153/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/333 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 165 constraints, problems are : Problem set: 0 solved, 3 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 73/77 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 66/143 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 10/153 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 180/333 variables, 153/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/333 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 168 constraints, problems are : Problem set: 0 solved, 3 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 681ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 378 ms.
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 180/180 transitions.
Graph (trivial) has 133 edges and 153 vertex of which 42 / 153 are part of one of the 4 SCC in 3 ms
Free SCC test removed 38 places
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 225 edges and 115 vertex of which 113 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 113 transition count 82
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 47 rules applied. Total rules applied 89 place count 76 transition count 72
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 99 place count 70 transition count 68
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 68 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 105 place count 66 transition count 66
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 105 place count 66 transition count 61
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 115 place count 61 transition count 61
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 118 place count 58 transition count 58
Iterating global reduction 5 with 3 rules applied. Total rules applied 121 place count 58 transition count 58
Performed 18 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 157 place count 40 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 141 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 6 rules applied. Total rules applied 163 place count 39 transition count 33
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 167 place count 39 transition count 29
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 171 place count 35 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 34 transition count 28
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 7 rules applied. Total rules applied 179 place count 30 transition count 25
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 182 place count 27 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 182 place count 27 transition count 21
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 190 place count 23 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 192 place count 22 transition count 20
Applied a total of 192 rules in 51 ms. Remains 22 /153 variables (removed 131) and now considering 20/180 (removed 160) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 22/153 places, 20/180 transitions.
RANDOM walk for 26978 steps (2429 resets) in 471 ms. (57 steps per ms) remains 0/3 properties
Computed a total of 15 stabilizing places and 15 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 180/180 transitions.
Graph (trivial) has 139 edges and 153 vertex of which 82 / 153 are part of one of the 6 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 76 transition count 65
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 62 transition count 65
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 29 place count 62 transition count 61
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 37 place count 58 transition count 61
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 57 transition count 60
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 57 transition count 60
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 73 place count 40 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 40 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 38 transition count 37
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 36 transition count 35
Applied a total of 83 rules in 23 ms. Remains 36 /153 variables (removed 117) and now considering 35/180 (removed 145) transitions.
[2024-05-30 01:30:15] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
// Phase 1: matrix 30 rows 36 cols
[2024-05-30 01:30:15] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 01:30:15] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 01:30:15] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
[2024-05-30 01:30:15] [INFO ] Invariant cache hit.
[2024-05-30 01:30:15] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-30 01:30:15] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-05-30 01:30:15] [INFO ] Flow matrix only has 30 transitions (discarded 5 similar events)
[2024-05-30 01:30:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 29/65 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/66 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 29/65 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/66 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 36/36 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 773ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 774ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/153 places, 35/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 949 ms. Remains : 36/153 places, 35/180 transitions.
Stuttering acceptance computed with spot in 282 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-01 finished in 1306 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||F(p1))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 180/180 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 149 transition count 176
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 149 transition count 176
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 147 transition count 174
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 147 transition count 174
Applied a total of 12 rules in 14 ms. Remains 147 /153 variables (removed 6) and now considering 174/180 (removed 6) transitions.
// Phase 1: matrix 174 rows 147 cols
[2024-05-30 01:30:16] [INFO ] Computed 12 invariants in 4 ms
[2024-05-30 01:30:17] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-30 01:30:17] [INFO ] Invariant cache hit.
[2024-05-30 01:30:17] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-30 01:30:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-30 01:30:19] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 3 ms to minimize.
[2024-05-30 01:30:19] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-30 01:30:19] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 3 ms to minimize.
[2024-05-30 01:30:19] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 3 ms to minimize.
[2024-05-30 01:30:19] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/321 variables, 147/164 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 164 constraints, problems are : Problem set: 0 solved, 173 unsolved in 8867 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/321 variables, 147/164 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 173/337 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 337 constraints, problems are : Problem set: 0 solved, 173 unsolved in 7744 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 5/5 constraints]
After SMT, in 16689ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 16695ms
Starting structural reductions in LTL mode, iteration 1 : 147/153 places, 174/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17033 ms. Remains : 147/153 places, 174/180 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 459 ms.
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-10-LTLFireability-02 finished in 17938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U (p1&&G(p0)))||(p2&&G(p3)))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 180/180 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 149 transition count 176
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 149 transition count 176
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 147 transition count 174
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 147 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 146 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 146 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 145 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 145 transition count 172
Applied a total of 16 rules in 17 ms. Remains 145 /153 variables (removed 8) and now considering 172/180 (removed 8) transitions.
// Phase 1: matrix 172 rows 145 cols
[2024-05-30 01:30:34] [INFO ] Computed 12 invariants in 7 ms
[2024-05-30 01:30:34] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-30 01:30:35] [INFO ] Invariant cache hit.
[2024-05-30 01:30:35] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-30 01:30:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-30 01:30:37] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 3 ms to minimize.
[2024-05-30 01:30:37] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 3 ms to minimize.
[2024-05-30 01:30:37] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 3 ms to minimize.
[2024-05-30 01:30:37] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 3 ms to minimize.
[2024-05-30 01:30:37] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/317 variables, 145/162 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 162 constraints, problems are : Problem set: 0 solved, 171 unsolved in 10042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/145 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/317 variables, 145/162 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 171/333 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/317 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 333 constraints, problems are : Problem set: 0 solved, 171 unsolved in 7209 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 5/5 constraints]
After SMT, in 17284ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 17287ms
Starting structural reductions in LTL mode, iteration 1 : 145/153 places, 172/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17554 ms. Remains : 145/153 places, 172/180 transitions.
Stuttering acceptance computed with spot in 363 ms :[true, (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p3), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-04 finished in 17958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1||X(G(p2)))))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 180/180 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 148 transition count 175
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 148 transition count 175
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 145 transition count 172
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 145 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 144 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 144 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 143 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 143 transition count 170
Applied a total of 20 rules in 25 ms. Remains 143 /153 variables (removed 10) and now considering 170/180 (removed 10) transitions.
// Phase 1: matrix 170 rows 143 cols
[2024-05-30 01:30:52] [INFO ] Computed 12 invariants in 2 ms
[2024-05-30 01:30:52] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-30 01:30:52] [INFO ] Invariant cache hit.
[2024-05-30 01:30:53] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-30 01:30:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 3 ms to minimize.
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 3 ms to minimize.
[2024-05-30 01:30:55] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/313 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 159 constraints, problems are : Problem set: 0 solved, 169 unsolved in 8667 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/313 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 169/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 328 constraints, problems are : Problem set: 0 solved, 169 unsolved in 5466 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 4/4 constraints]
After SMT, in 14183ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 14187ms
Starting structural reductions in LTL mode, iteration 1 : 143/153 places, 170/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14534 ms. Remains : 143/153 places, 170/180 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-08
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-10-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-08 finished in 14689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 180/180 transitions.
Graph (trivial) has 139 edges and 153 vertex of which 76 / 153 are part of one of the 6 SCC in 0 ms
Free SCC test removed 70 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 82 transition count 72
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 67 transition count 72
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 31 place count 67 transition count 67
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 41 place count 62 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 61 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 61 transition count 66
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 83 place count 41 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 89 place count 41 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 39 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 37 transition count 36
Applied a total of 93 rules in 19 ms. Remains 37 /153 variables (removed 116) and now considering 36/180 (removed 144) transitions.
[2024-05-30 01:31:07] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 37 cols
[2024-05-30 01:31:07] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 01:31:07] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 01:31:07] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-30 01:31:07] [INFO ] Invariant cache hit.
[2024-05-30 01:31:07] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2024-05-30 01:31:07] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2024-05-30 01:31:07] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-30 01:31:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 30/67 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/67 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/68 variables, and 47 constraints, problems are : Problem set: 0 solved, 22 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 30/67 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 22/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/67 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/68 variables, and 69 constraints, problems are : Problem set: 0 solved, 22 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 777ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 777ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/153 places, 36/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 922 ms. Remains : 37/153 places, 36/180 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-10
Stuttering criterion allowed to conclude after 49 steps with 4 reset in 1 ms.
FORMULA SmartHome-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-10 finished in 1005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(p1))))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 180/180 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 149 transition count 176
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 149 transition count 176
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 146 transition count 173
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 146 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 145 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 145 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 144 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 144 transition count 171
Applied a total of 18 rules in 13 ms. Remains 144 /153 variables (removed 9) and now considering 171/180 (removed 9) transitions.
// Phase 1: matrix 171 rows 144 cols
[2024-05-30 01:31:08] [INFO ] Computed 12 invariants in 1 ms
[2024-05-30 01:31:08] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-30 01:31:08] [INFO ] Invariant cache hit.
[2024-05-30 01:31:08] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-30 01:31:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-30 01:31:10] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-30 01:31:10] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/315 variables, 144/158 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-30 01:31:12] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-30 01:31:12] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 160 constraints, problems are : Problem set: 0 solved, 170 unsolved in 7166 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/315 variables, 144/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 170/330 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 330 constraints, problems are : Problem set: 0 solved, 170 unsolved in 7711 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 4/4 constraints]
After SMT, in 14903ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 14905ms
Starting structural reductions in LTL mode, iteration 1 : 144/153 places, 171/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15123 ms. Remains : 144/153 places, 171/180 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-11
Entered a terminal (fully accepting) state of product in 148 steps with 1 reset in 2 ms.
FORMULA SmartHome-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-11 finished in 15397 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)&&F((p1&&X(p2))))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 180/180 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 149 transition count 176
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 149 transition count 176
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 146 transition count 173
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 146 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 145 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 145 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 144 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 144 transition count 171
Applied a total of 18 rules in 15 ms. Remains 144 /153 variables (removed 9) and now considering 171/180 (removed 9) transitions.
[2024-05-30 01:31:23] [INFO ] Invariant cache hit.
[2024-05-30 01:31:24] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-30 01:31:24] [INFO ] Invariant cache hit.
[2024-05-30 01:31:24] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-30 01:31:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-30 01:31:26] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 3 ms to minimize.
[2024-05-30 01:31:26] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/315 variables, 144/158 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-30 01:31:29] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2024-05-30 01:31:29] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 160 constraints, problems are : Problem set: 0 solved, 170 unsolved in 11114 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/315 variables, 144/160 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 170/330 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 330 constraints, problems are : Problem set: 0 solved, 170 unsolved in 5732 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 4/4 constraints]
After SMT, in 16877ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 16880ms
Starting structural reductions in LTL mode, iteration 1 : 144/153 places, 171/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17265 ms. Remains : 144/153 places, 171/180 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-12
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-12 finished in 17491 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||X(F((p0&&F(p1))))))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 180/180 transitions.
Graph (trivial) has 135 edges and 153 vertex of which 63 / 153 are part of one of the 5 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 94 transition count 78
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 71 transition count 75
Reduce places removed 2 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 2 with 4 rules applied. Total rules applied 54 place count 69 transition count 73
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 68 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 67 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 57 place count 67 transition count 68
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 65 place count 63 transition count 68
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 66 place count 62 transition count 67
Iterating global reduction 5 with 1 rules applied. Total rules applied 67 place count 62 transition count 67
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 107 place count 42 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 108 place count 42 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 114 place count 42 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 116 place count 40 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 118 place count 38 transition count 37
Applied a total of 118 rules in 19 ms. Remains 38 /153 variables (removed 115) and now considering 37/180 (removed 143) transitions.
[2024-05-30 01:31:41] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 38 cols
[2024-05-30 01:31:41] [INFO ] Computed 10 invariants in 0 ms
[2024-05-30 01:31:41] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 01:31:41] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
[2024-05-30 01:31:41] [INFO ] Invariant cache hit.
[2024-05-30 01:31:41] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-30 01:31:41] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-30 01:31:41] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
[2024-05-30 01:31:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 3/38 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 32/70 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/70 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/71 variables, and 48 constraints, problems are : Problem set: 0 solved, 25 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 3/38 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 32/70 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 25/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/70 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/71 variables, and 73 constraints, problems are : Problem set: 0 solved, 25 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 838ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 839ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/153 places, 37/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 976 ms. Remains : 38/153 places, 37/180 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-10-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-14 finished in 1106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 180/180 transitions.
Graph (trivial) has 139 edges and 153 vertex of which 80 / 153 are part of one of the 6 SCC in 0 ms
Free SCC test removed 74 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 78 transition count 66
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 63 transition count 66
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 31 place count 63 transition count 62
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 39 place count 59 transition count 62
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 58 transition count 61
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 58 transition count 61
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 75 place count 41 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 41 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 39 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 37 transition count 36
Applied a total of 85 rules in 20 ms. Remains 37 /153 variables (removed 116) and now considering 36/180 (removed 144) transitions.
[2024-05-30 01:31:42] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 37 cols
[2024-05-30 01:31:42] [INFO ] Computed 10 invariants in 0 ms
[2024-05-30 01:31:42] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 01:31:42] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-30 01:31:42] [INFO ] Invariant cache hit.
[2024-05-30 01:31:42] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-30 01:31:42] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2024-05-30 01:31:42] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-30 01:31:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 30/67 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/67 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/68 variables, and 47 constraints, problems are : Problem set: 0 solved, 22 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 30/67 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 22/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/67 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/68 variables, and 69 constraints, problems are : Problem set: 0 solved, 22 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 765ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 766ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/153 places, 36/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 914 ms. Remains : 37/153 places, 36/180 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-10-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLFireability-15 finished in 963 ms.
All properties solved by simple procedures.
Total runtime 117991 ms.

BK_STOP 1717032703506

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683811400412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-10.tgz
mv SmartHome-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;