Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K 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 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 12 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Apr 12 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 54K 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-05-LTLCardinality-00
FORMULA_NAME SmartHome-PT-05-LTLCardinality-01
FORMULA_NAME SmartHome-PT-05-LTLCardinality-02
FORMULA_NAME SmartHome-PT-05-LTLCardinality-03
FORMULA_NAME SmartHome-PT-05-LTLCardinality-04
FORMULA_NAME SmartHome-PT-05-LTLCardinality-05
FORMULA_NAME SmartHome-PT-05-LTLCardinality-06
FORMULA_NAME SmartHome-PT-05-LTLCardinality-07
FORMULA_NAME SmartHome-PT-05-LTLCardinality-08
FORMULA_NAME SmartHome-PT-05-LTLCardinality-09
FORMULA_NAME SmartHome-PT-05-LTLCardinality-10
FORMULA_NAME SmartHome-PT-05-LTLCardinality-11
FORMULA_NAME SmartHome-PT-05-LTLCardinality-12
FORMULA_NAME SmartHome-PT-05-LTLCardinality-13
FORMULA_NAME SmartHome-PT-05-LTLCardinality-14
FORMULA_NAME SmartHome-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716999233279

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 16:13:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 16:13:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 16:13:55] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-29 16:13:55] [INFO ] Transformed 213 places.
[2024-05-29 16:13:55] [INFO ] Transformed 245 transitions.
[2024-05-29 16:13:55] [INFO ] Found NUPN structural information;
[2024-05-29 16:13:55] [INFO ] Parsed PT model containing 213 places and 245 transitions and 557 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 104 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 18 transitions.
FORMULA SmartHome-PT-05-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-05-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 227/227 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 145 transition count 176
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 145 transition count 176
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 107 place count 145 transition count 171
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 119 place count 133 transition count 159
Iterating global reduction 1 with 12 rules applied. Total rules applied 131 place count 133 transition count 159
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 140 place count 124 transition count 150
Iterating global reduction 1 with 9 rules applied. Total rules applied 149 place count 124 transition count 150
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 153 place count 120 transition count 146
Iterating global reduction 1 with 4 rules applied. Total rules applied 157 place count 120 transition count 146
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 158 place count 119 transition count 145
Iterating global reduction 1 with 1 rules applied. Total rules applied 159 place count 119 transition count 145
Applied a total of 159 rules in 96 ms. Remains 119 /196 variables (removed 77) and now considering 145/227 (removed 82) transitions.
// Phase 1: matrix 145 rows 119 cols
[2024-05-29 16:13:55] [INFO ] Computed 10 invariants in 13 ms
[2024-05-29 16:13:56] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-29 16:13:56] [INFO ] Invariant cache hit.
[2024-05-29 16:13:56] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-29 16:13:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 16:13:57] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 24 ms to minimize.
[2024-05-29 16:13:57] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-29 16:13:58] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-05-29 16:13:58] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-29 16:13:58] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-29 16:13:58] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-29 16:13:58] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/264 variables, 119/136 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 136 constraints, problems are : Problem set: 0 solved, 144 unsolved in 5871 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 16:14:03] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 145/264 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 144/281 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-29 16:14:04] [INFO ] Deduced a trap composed of 79 places in 64 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 282 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6565 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 9/9 constraints]
After SMT, in 12546ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 12583ms
Starting structural reductions in LTL mode, iteration 1 : 119/196 places, 145/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13220 ms. Remains : 119/196 places, 145/227 transitions.
Support contains 17 out of 119 places after structural reductions.
[2024-05-29 16:14:09] [INFO ] Flatten gal took : 55 ms
[2024-05-29 16:14:09] [INFO ] Flatten gal took : 26 ms
[2024-05-29 16:14:09] [INFO ] Input system was already deterministic with 145 transitions.
RANDOM walk for 40000 steps (334 resets) in 1110 ms. (36 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (59 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
[2024-05-29 16:14:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/119 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 145/264 variables, 119/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/264 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 129 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/49 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/119 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 145/264 variables, 119/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/264 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 130 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 295ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 76 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
Parikh walk visited 1 properties in 9 ms.
Computed a total of 8 stabilizing places and 8 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' '!(X(X(G(p0))))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 145/145 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 113 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 113 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 113 transition count 138
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 112 transition count 137
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 112 transition count 137
Applied a total of 15 rules in 9 ms. Remains 112 /119 variables (removed 7) and now considering 137/145 (removed 8) transitions.
// Phase 1: matrix 137 rows 112 cols
[2024-05-29 16:14:10] [INFO ] Computed 10 invariants in 11 ms
[2024-05-29 16:14:10] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-29 16:14:10] [INFO ] Invariant cache hit.
[2024-05-29 16:14:10] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-29 16:14:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-29 16:14:11] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-29 16:14:11] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 3 ms to minimize.
[2024-05-29 16:14:11] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 2 ms to minimize.
[2024-05-29 16:14:12] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-05-29 16:14:12] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-29 16:14:12] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-29 16:14:12] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 129 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4638 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 136/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 265 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3814 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
After SMT, in 8488ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 8491ms
Starting structural reductions in LTL mode, iteration 1 : 112/119 places, 137/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8954 ms. Remains : 112/119 places, 137/145 transitions.
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1047 steps with 10 reset in 15 ms.
FORMULA SmartHome-PT-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLCardinality-00 finished in 9424 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)))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 145/145 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 114 transition count 139
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 113 transition count 138
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 113 transition count 138
Applied a total of 13 rules in 9 ms. Remains 113 /119 variables (removed 6) and now considering 138/145 (removed 7) transitions.
// Phase 1: matrix 138 rows 113 cols
[2024-05-29 16:14:19] [INFO ] Computed 10 invariants in 1 ms
[2024-05-29 16:14:19] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-29 16:14:19] [INFO ] Invariant cache hit.
[2024-05-29 16:14:19] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2024-05-29 16:14:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-29 16:14:20] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-29 16:14:20] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-29 16:14:20] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-29 16:14:20] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 2 ms to minimize.
[2024-05-29 16:14:21] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-29 16:14:21] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-29 16:14:21] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-29 16:14:21] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-29 16:14:21] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/251 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 132 constraints, problems are : Problem set: 0 solved, 137 unsolved in 4610 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/251 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 137/269 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 269 constraints, problems are : Problem set: 0 solved, 137 unsolved in 3786 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 9/9 constraints]
After SMT, in 8424ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 8428ms
Starting structural reductions in LTL mode, iteration 1 : 113/119 places, 138/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8664 ms. Remains : 113/119 places, 138/145 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-05-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLCardinality-01 finished in 8775 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)))'
Support contains 1 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 145/145 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 113 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 113 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 113 transition count 138
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 112 transition count 137
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 112 transition count 137
Applied a total of 15 rules in 9 ms. Remains 112 /119 variables (removed 7) and now considering 137/145 (removed 8) transitions.
// Phase 1: matrix 137 rows 112 cols
[2024-05-29 16:14:28] [INFO ] Computed 10 invariants in 2 ms
[2024-05-29 16:14:28] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 16:14:28] [INFO ] Invariant cache hit.
[2024-05-29 16:14:28] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-29 16:14:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-29 16:14:29] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-29 16:14:29] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-29 16:14:29] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 2 ms to minimize.
[2024-05-29 16:14:29] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2024-05-29 16:14:29] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-29 16:14:29] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 16:14:30] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 129 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4538 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 136/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 265 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3805 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
After SMT, in 8391ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 8396ms
Starting structural reductions in LTL mode, iteration 1 : 112/119 places, 137/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8595 ms. Remains : 112/119 places, 137/145 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 508 steps with 3 reset in 5 ms.
FORMULA SmartHome-PT-05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLCardinality-02 finished in 8717 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)))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 145/145 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 113 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 113 transition count 139
Applied a total of 12 rules in 14 ms. Remains 113 /119 variables (removed 6) and now considering 139/145 (removed 6) transitions.
// Phase 1: matrix 139 rows 113 cols
[2024-05-29 16:14:37] [INFO ] Computed 10 invariants in 1 ms
[2024-05-29 16:14:37] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-29 16:14:37] [INFO ] Invariant cache hit.
[2024-05-29 16:14:37] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-29 16:14:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 16:14:38] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-29 16:14:38] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 3 ms to minimize.
[2024-05-29 16:14:38] [INFO ] Deduced a trap composed of 74 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 16:14:38] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 139/252 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 127 constraints, problems are : Problem set: 0 solved, 138 unsolved in 4636 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/252 variables, 113/127 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 138/265 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 265 constraints, problems are : Problem set: 0 solved, 138 unsolved in 3845 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 4/4 constraints]
After SMT, in 8505ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 8507ms
Starting structural reductions in LTL mode, iteration 1 : 113/119 places, 139/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8749 ms. Remains : 113/119 places, 139/145 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 579 steps with 4 reset in 5 ms.
FORMULA SmartHome-PT-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLCardinality-04 finished in 8857 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)||G(p1))))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 145/145 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 114 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 114 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 114 transition count 139
Applied a total of 11 rules in 5 ms. Remains 114 /119 variables (removed 5) and now considering 139/145 (removed 6) transitions.
// Phase 1: matrix 139 rows 114 cols
[2024-05-29 16:14:45] [INFO ] Computed 10 invariants in 1 ms
[2024-05-29 16:14:46] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-29 16:14:46] [INFO ] Invariant cache hit.
[2024-05-29 16:14:46] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-29 16:14:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 16:14:47] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-29 16:14:47] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
[2024-05-29 16:14:47] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-29 16:14:47] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 3 ms to minimize.
[2024-05-29 16:14:47] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-29 16:14:47] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 16:14:47] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 139/253 variables, 114/131 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/253 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 131 constraints, problems are : Problem set: 0 solved, 138 unsolved in 4952 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 16:14:51] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 16:14:51] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 139/253 variables, 114/133 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 138/271 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-29 16:14:53] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/253 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 272 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5796 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 10/10 constraints]
After SMT, in 10774ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 10776ms
Starting structural reductions in LTL mode, iteration 1 : 114/119 places, 139/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10991 ms. Remains : 114/119 places, 139/145 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-05-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLCardinality-06 finished in 11183 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))))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 145/145 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 113 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 113 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 113 transition count 138
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 112 transition count 137
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 112 transition count 137
Applied a total of 15 rules in 11 ms. Remains 112 /119 variables (removed 7) and now considering 137/145 (removed 8) transitions.
// Phase 1: matrix 137 rows 112 cols
[2024-05-29 16:14:57] [INFO ] Computed 10 invariants in 1 ms
[2024-05-29 16:14:57] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 16:14:57] [INFO ] Invariant cache hit.
[2024-05-29 16:14:57] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-29 16:14:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-29 16:14:58] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-05-29 16:14:58] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-29 16:14:58] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 2 ms to minimize.
[2024-05-29 16:14:58] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-29 16:14:58] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 2 ms to minimize.
[2024-05-29 16:14:58] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 16:14:58] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 129 constraints, problems are : Problem set: 0 solved, 136 unsolved in 4407 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 136/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 265 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3906 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
After SMT, in 8332ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 8334ms
Starting structural reductions in LTL mode, iteration 1 : 112/119 places, 137/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8533 ms. Remains : 112/119 places, 137/145 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-05-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLCardinality-10 finished in 8666 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((F((G(!p0)||(!p0&&F(!p1)))) U p2))))'
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 145/145 transitions.
Graph (trivial) has 105 edges and 119 vertex of which 52 / 119 are part of one of the 4 SCC in 4 ms
Free SCC test removed 48 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 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 70 transition count 66
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 55 transition count 65
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 32 place count 55 transition count 62
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 52 transition count 62
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 51 transition count 61
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 51 transition count 61
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 72 place count 35 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 35 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 79 place count 35 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 34 transition count 36
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 34 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 34 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 32 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 87 place count 31 transition count 32
Applied a total of 87 rules in 40 ms. Remains 31 /119 variables (removed 88) and now considering 32/145 (removed 113) transitions.
[2024-05-29 16:15:05] [INFO ] Flow matrix only has 29 transitions (discarded 3 similar events)
// Phase 1: matrix 29 rows 31 cols
[2024-05-29 16:15:05] [INFO ] Computed 8 invariants in 0 ms
[2024-05-29 16:15:05] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 16:15:05] [INFO ] Flow matrix only has 29 transitions (discarded 3 similar events)
[2024-05-29 16:15:05] [INFO ] Invariant cache hit.
[2024-05-29 16:15:05] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-29 16:15:05] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-29 16:15:05] [INFO ] Flow matrix only has 29 transitions (discarded 3 similar events)
[2024-05-29 16:15:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 3/31 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 28/59 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/59 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/60 variables, and 39 constraints, problems are : Problem set: 0 solved, 20 unsolved in 284 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 3/31 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 28/59 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/60 variables, and 59 constraints, problems are : Problem set: 0 solved, 20 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 578ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 579ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/119 places, 32/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 724 ms. Remains : 31/119 places, 32/145 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (NOT p2), (AND (NOT p2) p0 p1), (AND p0 (NOT p2))]
Running random walk in product with property : SmartHome-PT-05-LTLCardinality-12
Stuttering criterion allowed to conclude after 259 steps with 13 reset in 2 ms.
FORMULA SmartHome-PT-05-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-05-LTLCardinality-12 finished in 934 ms.
All properties solved by simple procedures.
Total runtime 71713 ms.
ITS solved all properties within timeout

BK_STOP 1716999306744

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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