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.r532-smll-171683811600483.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 ltsminxred
Input is SmartHome-PT-19, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683811600483
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K 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.4K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 03:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 03:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 03:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 03:41 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 181K 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-19-LTLCardinality-00
FORMULA_NAME SmartHome-PT-19-LTLCardinality-01
FORMULA_NAME SmartHome-PT-19-LTLCardinality-02
FORMULA_NAME SmartHome-PT-19-LTLCardinality-03
FORMULA_NAME SmartHome-PT-19-LTLCardinality-04
FORMULA_NAME SmartHome-PT-19-LTLCardinality-05
FORMULA_NAME SmartHome-PT-19-LTLCardinality-06
FORMULA_NAME SmartHome-PT-19-LTLCardinality-07
FORMULA_NAME SmartHome-PT-19-LTLCardinality-08
FORMULA_NAME SmartHome-PT-19-LTLCardinality-09
FORMULA_NAME SmartHome-PT-19-LTLCardinality-10
FORMULA_NAME SmartHome-PT-19-LTLCardinality-11
FORMULA_NAME SmartHome-PT-19-LTLCardinality-12
FORMULA_NAME SmartHome-PT-19-LTLCardinality-13
FORMULA_NAME SmartHome-PT-19-LTLCardinality-14
FORMULA_NAME SmartHome-PT-19-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717260150031

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:42:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:42:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:42:32] [INFO ] Load time of PNML (sax parser for PT used): 279 ms
[2024-06-01 16:42:32] [INFO ] Transformed 741 places.
[2024-06-01 16:42:32] [INFO ] Transformed 809 transitions.
[2024-06-01 16:42:32] [INFO ] Found NUPN structural information;
[2024-06-01 16:42:32] [INFO ] Parsed PT model containing 741 places and 809 transitions and 1844 arcs in 508 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 227 places in 16 ms
Reduce places removed 227 places and 198 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-19-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 611/611 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 496 transition count 611
Discarding 139 places :
Symmetric choice reduction at 1 with 139 rule applications. Total rules 157 place count 357 transition count 472
Iterating global reduction 1 with 139 rules applied. Total rules applied 296 place count 357 transition count 472
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 309 place count 357 transition count 459
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 335 place count 331 transition count 433
Iterating global reduction 2 with 26 rules applied. Total rules applied 361 place count 331 transition count 433
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 387 place count 305 transition count 407
Iterating global reduction 2 with 26 rules applied. Total rules applied 413 place count 305 transition count 407
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 415 place count 305 transition count 405
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 428 place count 292 transition count 392
Iterating global reduction 3 with 13 rules applied. Total rules applied 441 place count 292 transition count 392
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 444 place count 289 transition count 389
Iterating global reduction 3 with 3 rules applied. Total rules applied 447 place count 289 transition count 389
Applied a total of 447 rules in 219 ms. Remains 289 /514 variables (removed 225) and now considering 389/611 (removed 222) transitions.
// Phase 1: matrix 389 rows 289 cols
[2024-06-01 16:42:33] [INFO ] Computed 4 invariants in 28 ms
[2024-06-01 16:42:33] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-06-01 16:42:33] [INFO ] Invariant cache hit.
[2024-06-01 16:42:34] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
Running 388 sub problems to find dead transitions.
[2024-06-01 16:42:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 2/289 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (OVERLAPS) 389/678 variables, 289/293 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-01 16:42:49] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 22 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/678 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/678 variables, and 294 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 2/289 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (OVERLAPS) 389/678 variables, 289/294 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 388/682 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/678 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 8 (OVERLAPS) 0/678 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 388 unsolved
No progress, stopping.
After SMT solving in domain Int declared 678/678 variables, and 682 constraints, problems are : Problem set: 0 solved, 388 unsolved in 28525 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 1/1 constraints]
After SMT, in 58828ms problems are : Problem set: 0 solved, 388 unsolved
Search for dead transitions found 0 dead transitions in 58874ms
Starting structural reductions in LTL mode, iteration 1 : 289/514 places, 389/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60033 ms. Remains : 289/514 places, 389/611 transitions.
Support contains 16 out of 289 places after structural reductions.
[2024-06-01 16:43:33] [INFO ] Flatten gal took : 114 ms
[2024-06-01 16:43:33] [INFO ] Flatten gal took : 47 ms
[2024-06-01 16:43:33] [INFO ] Input system was already deterministic with 389 transitions.
Support contains 15 out of 289 places (down from 16) after GAL structural reductions.
RANDOM walk for 40000 steps (115 resets) in 1375 ms. (29 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 411 ms. (97 steps per ms) remains 1/1 properties
[2024-06-01 16:43:34] [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) 18/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/25 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/77 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 146/223 variables, 38/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 140/363 variables, 66/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/363 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 115/478 variables, 56/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/478 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 100/578 variables, 48/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/578 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 42/620 variables, 29/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/620 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/636 variables, 9/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/636 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 10/646 variables, 4/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/646 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/654 variables, 4/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/654 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 12/666 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/666 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 12/678 variables, 6/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/678 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/678 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 678/678 variables, and 293 constraints, problems are : Problem set: 0 solved, 1 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 289/289 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) 18/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/25 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/77 variables, 25/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 146/223 variables, 38/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 140/363 variables, 66/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 115/478 variables, 56/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 16:43:35] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/478 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 100/578 variables, 48/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/578 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 42/620 variables, 29/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/620 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 16/636 variables, 9/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/636 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 10/646 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/646 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 8/654 variables, 4/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/654 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 12/666 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/666 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 12/678 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/678 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/678 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 678/678 variables, and 295 constraints, problems are : Problem set: 0 solved, 1 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1055ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 389/389 transitions.
Graph (trivial) has 316 edges and 289 vertex of which 191 / 289 are part of one of the 16 SCC in 6 ms
Free SCC test removed 175 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 268 transitions.
Graph (complete) has 171 edges and 114 vertex of which 94 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 94 transition count 52
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 49 rules applied. Total rules applied 106 place count 51 transition count 46
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 109 place count 48 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 109 place count 48 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 119 place count 43 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 42 transition count 40
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 42 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 41 transition count 39
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 41 transition count 39
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 163 place count 21 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 29 edges and 21 vertex of which 13 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 3 with 10 rules applied. Total rules applied 173 place count 13 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 174 place count 12 transition count 8
Reduce places removed 2 places and 0 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 4 with 3 rules applied. Total rules applied 177 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 178 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 178 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 183 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 183 place count 6 transition count 4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 185 place count 5 transition count 4
Applied a total of 185 rules in 71 ms. Remains 5 /289 variables (removed 284) and now considering 4/389 (removed 385) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 5/289 places, 4/389 transitions.
RANDOM walk for 32 steps (6 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
Computed a total of 47 stabilizing places and 46 stable transitions
Graph (complete) has 452 edges and 289 vertex of which 288 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 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 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 389/389 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 288 transition count 389
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 282 transition count 383
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 282 transition count 383
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 278 transition count 379
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 278 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 275 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 275 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 275 transition count 375
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 274 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 274 transition count 374
Applied a total of 30 rules in 72 ms. Remains 274 /289 variables (removed 15) and now considering 374/389 (removed 15) transitions.
// Phase 1: matrix 374 rows 274 cols
[2024-06-01 16:43:35] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 16:43:35] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 16:43:36] [INFO ] Invariant cache hit.
[2024-06-01 16:43:36] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2024-06-01 16:43:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 374/648 variables, 274/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (OVERLAPS) 0/648 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 277 constraints, problems are : Problem set: 0 solved, 373 unsolved in 27877 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 374/648 variables, 274/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 373/650 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 7 (OVERLAPS) 0/648 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 650 constraints, problems are : Problem set: 0 solved, 373 unsolved in 25021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
After SMT, in 53021ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 53036ms
Starting structural reductions in LTL mode, iteration 1 : 274/289 places, 374/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53489 ms. Remains : 274/289 places, 374/389 transitions.
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 177 steps with 0 reset in 7 ms.
FORMULA SmartHome-PT-19-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLCardinality-00 finished in 53914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0&&X(p0))||X(G(p0)))))'
Support contains 1 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 389/389 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 288 transition count 389
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 281 transition count 382
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 281 transition count 382
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 276 transition count 377
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 276 transition count 377
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 272 transition count 373
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 272 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 272 transition count 372
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 271 transition count 371
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 271 transition count 371
Applied a total of 36 rules in 32 ms. Remains 271 /289 variables (removed 18) and now considering 371/389 (removed 18) transitions.
// Phase 1: matrix 371 rows 271 cols
[2024-06-01 16:44:29] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 16:44:29] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 16:44:29] [INFO ] Invariant cache hit.
[2024-06-01 16:44:30] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-06-01 16:44:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 29417 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 644 constraints, problems are : Problem set: 0 solved, 370 unsolved in 25850 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 55361ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 55369ms
Starting structural reductions in LTL mode, iteration 1 : 271/289 places, 371/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55841 ms. Remains : 271/289 places, 371/389 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-19-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLCardinality-01 finished in 56026 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 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 389/389 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 288 transition count 389
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 282 transition count 383
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 282 transition count 383
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 278 transition count 379
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 278 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 275 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 275 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 275 transition count 375
Applied a total of 28 rules in 19 ms. Remains 275 /289 variables (removed 14) and now considering 375/389 (removed 14) transitions.
// Phase 1: matrix 375 rows 275 cols
[2024-06-01 16:45:25] [INFO ] Computed 3 invariants in 4 ms
[2024-06-01 16:45:25] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 16:45:25] [INFO ] Invariant cache hit.
[2024-06-01 16:45:26] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2024-06-01 16:45:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (OVERLAPS) 375/650 variables, 275/278 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 374 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 278 constraints, problems are : Problem set: 0 solved, 374 unsolved in 28869 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/275 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/275 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (OVERLAPS) 375/650 variables, 275/278 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 374/652 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (OVERLAPS) 0/650 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 374 unsolved
No progress, stopping.
After SMT solving in domain Int declared 650/650 variables, and 652 constraints, problems are : Problem set: 0 solved, 374 unsolved in 26330 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints]
After SMT, in 55284ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 55290ms
Starting structural reductions in LTL mode, iteration 1 : 275/289 places, 375/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55703 ms. Remains : 275/289 places, 375/389 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-19-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLCardinality-03 finished in 55821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(G(p1)))) U G(p1)))'
Support contains 4 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 389/389 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 283 transition count 383
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 283 transition count 383
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 279 transition count 379
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 279 transition count 379
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 275 transition count 375
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 275 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 275 transition count 374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 274 transition count 373
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 274 transition count 373
Applied a total of 31 rules in 18 ms. Remains 274 /289 variables (removed 15) and now considering 373/389 (removed 16) transitions.
// Phase 1: matrix 373 rows 274 cols
[2024-06-01 16:46:21] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 16:46:21] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 16:46:21] [INFO ] Invariant cache hit.
[2024-06-01 16:46:21] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-06-01 16:46:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 2/274 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 373/647 variables, 274/278 constraints. Problems are: Problem set: 0 solved, 372 unsolved
[2024-06-01 16:46:34] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/647 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/647 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 372 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 647/647 variables, and 279 constraints, problems are : Problem set: 0 solved, 372 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 2/274 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (OVERLAPS) 373/647 variables, 274/279 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/647 variables, 372/651 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/647 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 8 (OVERLAPS) 0/647 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 372 unsolved
No progress, stopping.
After SMT solving in domain Int declared 647/647 variables, and 651 constraints, problems are : Problem set: 0 solved, 372 unsolved in 28310 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 1/1 constraints]
After SMT, in 58393ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 58398ms
Starting structural reductions in LTL mode, iteration 1 : 274/289 places, 373/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58736 ms. Remains : 274/289 places, 373/389 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : SmartHome-PT-19-LTLCardinality-04
Product exploration explored 100000 steps with 286 reset in 304 ms.
Stack based approach found an accepted trace after 134 steps with 0 reset with depth 135 and stack size 130 in 2 ms.
FORMULA SmartHome-PT-19-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SmartHome-PT-19-LTLCardinality-04 finished in 59215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 389/389 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 288 transition count 389
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 282 transition count 383
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 282 transition count 383
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 278 transition count 379
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 278 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 275 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 275 transition count 376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 274 transition count 375
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 274 transition count 375
Applied a total of 29 rules in 20 ms. Remains 274 /289 variables (removed 15) and now considering 375/389 (removed 14) transitions.
// Phase 1: matrix 375 rows 274 cols
[2024-06-01 16:47:20] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 16:47:20] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 16:47:20] [INFO ] Invariant cache hit.
[2024-06-01 16:47:21] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 374 sub problems to find dead transitions.
[2024-06-01 16:47:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (OVERLAPS) 375/649 variables, 274/277 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (OVERLAPS) 0/649 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 374 unsolved
No progress, stopping.
After SMT solving in domain Real declared 649/649 variables, and 277 constraints, problems are : Problem set: 0 solved, 374 unsolved in 29677 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 4 (OVERLAPS) 375/649 variables, 274/277 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 374/651 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 374 unsolved
At refinement iteration 7 (OVERLAPS) 0/649 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 374 unsolved
No progress, stopping.
After SMT solving in domain Int declared 649/649 variables, and 651 constraints, problems are : Problem set: 0 solved, 374 unsolved in 26258 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 374/374 constraints, Known Traps: 0/0 constraints]
After SMT, in 55995ms problems are : Problem set: 0 solved, 374 unsolved
Search for dead transitions found 0 dead transitions in 56000ms
Starting structural reductions in LTL mode, iteration 1 : 274/289 places, 375/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56351 ms. Remains : 274/289 places, 375/389 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLCardinality-07
Stuttering criterion allowed to conclude after 484 steps with 1 reset in 3 ms.
FORMULA SmartHome-PT-19-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLCardinality-07 finished in 56520 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 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 389/389 transitions.
Graph (trivial) has 313 edges and 289 vertex of which 190 / 289 are part of one of the 16 SCC in 2 ms
Free SCC test removed 174 places
Ensure Unique test removed 235 transitions
Reduce isomorphic transitions removed 235 transitions.
Graph (complete) has 214 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 113 transition count 113
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 44 rules applied. Total rules applied 86 place count 73 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 71 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 88 place count 71 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 94 place count 68 transition count 106
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 64 transition count 99
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 64 transition count 99
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 164 place count 33 transition count 68
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 168 place count 29 transition count 52
Iterating global reduction 3 with 4 rules applied. Total rules applied 172 place count 29 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 185 place count 29 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 186 place count 28 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 186 place count 28 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 188 place count 27 transition count 38
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 190 place count 25 transition count 34
Iterating global reduction 4 with 2 rules applied. Total rules applied 192 place count 25 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 25 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 25 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 24 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 196 place count 23 transition count 32
Applied a total of 196 rules in 54 ms. Remains 23 /289 variables (removed 266) and now considering 32/389 (removed 357) transitions.
[2024-06-01 16:48:17] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 23 cols
[2024-06-01 16:48:17] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 16:48:17] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 16:48:17] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2024-06-01 16:48:17] [INFO ] Invariant cache hit.
[2024-06-01 16:48:17] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-06-01 16:48:17] [INFO ] Redundant transitions in 37 ms returned []
Running 13 sub problems to find dead transitions.
[2024-06-01 16:48:17] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2024-06-01 16:48:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 5/45 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/48 variables, and 23 constraints, problems are : Problem set: 0 solved, 13 unsolved in 285 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 5/45 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/45 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/48 variables, and 36 constraints, problems are : Problem set: 0 solved, 13 unsolved in 269 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 562ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 562ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/289 places, 32/389 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 771 ms. Remains : 23/289 places, 32/389 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLCardinality-08
Stuttering criterion allowed to conclude after 38 steps with 1 reset in 1 ms.
FORMULA SmartHome-PT-19-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLCardinality-08 finished in 888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 389/389 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 288 transition count 389
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 281 transition count 382
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 281 transition count 382
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 20 place count 276 transition count 377
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 276 transition count 377
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 272 transition count 373
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 272 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 272 transition count 372
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 271 transition count 371
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 271 transition count 371
Applied a total of 36 rules in 56 ms. Remains 271 /289 variables (removed 18) and now considering 371/389 (removed 18) transitions.
// Phase 1: matrix 371 rows 271 cols
[2024-06-01 16:48:18] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 16:48:18] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 16:48:18] [INFO ] Invariant cache hit.
[2024-06-01 16:48:18] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-06-01 16:48:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 26970 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 644 constraints, problems are : Problem set: 0 solved, 370 unsolved in 25736 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 52793ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 52799ms
Starting structural reductions in LTL mode, iteration 1 : 271/289 places, 371/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53301 ms. Remains : 271/289 places, 371/389 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLCardinality-09
Stuttering criterion allowed to conclude after 451 steps with 0 reset in 4 ms.
FORMULA SmartHome-PT-19-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-19-LTLCardinality-09 finished in 53398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 389/389 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 288 transition count 389
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 282 transition count 383
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 282 transition count 383
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 278 transition count 379
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 278 transition count 379
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 275 transition count 376
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 275 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 275 transition count 375
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 274 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 274 transition count 374
Applied a total of 30 rules in 24 ms. Remains 274 /289 variables (removed 15) and now considering 374/389 (removed 15) transitions.
// Phase 1: matrix 374 rows 274 cols
[2024-06-01 16:49:11] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 16:49:11] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 16:49:11] [INFO ] Invariant cache hit.
[2024-06-01 16:49:11] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2024-06-01 16:49:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 374/648 variables, 274/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (OVERLAPS) 0/648 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 277 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/273 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/274 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/274 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 374/648 variables, 274/277 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 373/650 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 7 (OVERLAPS) 0/648 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 650 constraints, problems are : Problem set: 0 solved, 373 unsolved in 23479 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
After SMT, in 53564ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 53571ms
Starting structural reductions in LTL mode, iteration 1 : 274/289 places, 374/389 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53991 ms. Remains : 274/289 places, 374/389 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-19-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 1099 ms.
Product exploration explored 100000 steps with 50000 reset in 238 ms.
Computed a total of 40 stabilizing places and 39 stable transitions
Computed a total of 40 stabilizing places and 39 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 26 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-19-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-19-LTLCardinality-14 finished in 55477 ms.
All properties solved by simple procedures.
Total runtime 454598 ms.
ITS solved all properties within timeout

BK_STOP 1717260607075

--------------------
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-19"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SmartHome-PT-19, 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 r532-smll-171683811600483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-19.tgz
mv SmartHome-PT-19 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 ;