fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683761700731
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldRVs-PT-002B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
380.563 63494.00 82321.00 270.20 FFTFFFTTFFFTTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683761700731.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 ShieldRVs-PT-002B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761700731
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 17:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 24K 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 ShieldRVs-PT-002B-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-002B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717262573130

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:22:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:22:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:22:54] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-06-01 17:22:54] [INFO ] Transformed 83 places.
[2024-06-01 17:22:54] [INFO ] Transformed 93 transitions.
[2024-06-01 17:22:54] [INFO ] Found NUPN structural information;
[2024-06-01 17:22:54] [INFO ] Parsed PT model containing 83 places and 93 transitions and 288 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 9 formulas.
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-002B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 93/93 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 73 transition count 83
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 73 transition count 83
Applied a total of 20 rules in 37 ms. Remains 73 /83 variables (removed 10) and now considering 83/93 (removed 10) transitions.
// Phase 1: matrix 83 rows 73 cols
[2024-06-01 17:22:54] [INFO ] Computed 9 invariants in 10 ms
[2024-06-01 17:22:54] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 17:22:54] [INFO ] Invariant cache hit.
[2024-06-01 17:22:54] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2024-06-01 17:22:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 8 ms to minimize.
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 2 ms to minimize.
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 2 ms to minimize.
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:22:55] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:22:56] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:22:57] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 4/73 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/156 variables, 73/146 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:22:58] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:22:59] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:22:59] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 17:22:59] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:22:59] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 17:22:59] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/156 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 12 (OVERLAPS) 0/156 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 156 constraints, problems are : Problem set: 0 solved, 82 unsolved in 5775 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/73 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 74/83 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:23:00] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:23:00] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 6/95 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:23:01] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (OVERLAPS) 83/156 variables, 73/170 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 82/252 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:23:02] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:23:02] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:23:02] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:23:02] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:23:02] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 5/257 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:23:03] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 17:23:03] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:23:04] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:23:04] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:23:04] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:23:05] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:23:05] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:23:05] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:23:05] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/156 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-06-01 17:23:08] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/156 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/156 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 16 (OVERLAPS) 0/156 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 267 constraints, problems are : Problem set: 0 solved, 82 unsolved in 10545 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 103/103 constraints]
After SMT, in 16373ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 16387ms
Starting structural reductions in LTL mode, iteration 1 : 73/83 places, 83/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16753 ms. Remains : 73/83 places, 83/93 transitions.
Support contains 7 out of 73 places after structural reductions.
[2024-06-01 17:23:11] [INFO ] Flatten gal took : 26 ms
[2024-06-01 17:23:11] [INFO ] Flatten gal took : 12 ms
[2024-06-01 17:23:11] [INFO ] Input system was already deterministic with 83 transitions.
RANDOM walk for 235 steps (0 resets) in 20 ms. (11 steps per ms) remains 0/5 properties
Computed a total of 20 stabilizing places and 20 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(F(((!p0 U X(X(p1)))&&G(p2)))))'
Support contains 5 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 83/83 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 72 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 82
Applied a total of 2 rules in 6 ms. Remains 72 /73 variables (removed 1) and now considering 82/83 (removed 1) transitions.
// Phase 1: matrix 82 rows 72 cols
[2024-06-01 17:23:11] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 17:23:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 17:23:11] [INFO ] Invariant cache hit.
[2024-06-01 17:23:11] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-06-01 17:23:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:23:12] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 12/41 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 2 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:23:13] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:14] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:14] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:23:14] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:14] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:23:14] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:23:14] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:23:14] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:23:14] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:23:14] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:23:14] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:23:14] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 82/154 variables, 72/135 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:15] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-06-01 17:23:15] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:23:15] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:23:15] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:23:15] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:23:15] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:23:15] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 7/142 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:16] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/154 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:16] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 17:23:16] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:23:16] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:23:16] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:23:16] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/154 variables, 5/148 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:17] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:23:17] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:23:17] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:17] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:23:17] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:23:17] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:23:17] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:23:17] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:23:17] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/154 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 19 (OVERLAPS) 0/154 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 154/154 variables, and 157 constraints, problems are : Problem set: 0 solved, 81 unsolved in 6553 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:18] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 82/154 variables, 72/158 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 81/239 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:19] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:23:19] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:23:19] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:23:20] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:22] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 17:23:22] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:23:22] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/154 variables, 3/247 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:23] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:24] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:23:24] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:25] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:23:25] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:23:25] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:23:25] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:28] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/154 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:29] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/154 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/154 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:31] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/154 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/154 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:33] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 17:23:33] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:23:33] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/154 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/154 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-01 17:23:36] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/154 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/154 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 25 (OVERLAPS) 0/154 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 154/154 variables, and 261 constraints, problems are : Problem set: 0 solved, 81 unsolved in 21056 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 99/99 constraints]
After SMT, in 27630ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 27631ms
Starting structural reductions in LTL mode, iteration 1 : 72/73 places, 82/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27753 ms. Remains : 72/73 places, 82/83 transitions.
Stuttering acceptance computed with spot in 522 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLCardinality-01
Product exploration explored 100000 steps with 3284 reset in 221 ms.
Stack based approach found an accepted trace after 40757 steps with 1379 reset with depth 90 and stack size 90 in 67 ms.
FORMULA ShieldRVs-PT-002B-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVs-PT-002B-LTLCardinality-01 finished in 28639 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(p0)))'
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 83/83 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 70 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 70 transition count 80
Applied a total of 6 rules in 6 ms. Remains 70 /73 variables (removed 3) and now considering 80/83 (removed 3) transitions.
// Phase 1: matrix 80 rows 70 cols
[2024-06-01 17:23:40] [INFO ] Computed 9 invariants in 5 ms
[2024-06-01 17:23:40] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 17:23:40] [INFO ] Invariant cache hit.
[2024-06-01 17:23:40] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2024-06-01 17:23:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:40] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:23:40] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 17:23:40] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:23:40] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:23:40] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:23:40] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:23:40] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:23:40] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:23:40] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:23:40] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:41] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:23:42] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:43] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 80/150 variables, 70/127 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:43] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:23:43] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:23:43] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:23:43] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:23:43] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:43] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 3 ms to minimize.
[2024-06-01 17:23:44] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:44] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 17:23:44] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:23:44] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 17:23:44] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/150 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:44] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:23:44] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 17:23:44] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/150 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:45] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:23:45] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/150 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/150 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 17 (OVERLAPS) 0/150 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 143 constraints, problems are : Problem set: 0 solved, 79 unsolved in 5434 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 64/73 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:46] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:23:46] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 17:23:46] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:23:46] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 17:23:46] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:46] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:23:46] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 17:23:46] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:46] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 80/150 variables, 70/152 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 79/231 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:47] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 17:23:47] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 17:23:47] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:48] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 17:23:48] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:50] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 17:23:50] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-06-01 17:23:50] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/150 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-06-01 17:23:51] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 17:23:51] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/150 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/150 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 15 (OVERLAPS) 0/150 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 241 constraints, problems are : Problem set: 0 solved, 79 unsolved in 8311 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 70/70 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 83/83 constraints]
After SMT, in 13757ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 13760ms
Starting structural reductions in LTL mode, iteration 1 : 70/73 places, 80/83 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13903 ms. Remains : 70/73 places, 80/83 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 49 ms.
Product exploration explored 100000 steps with 33333 reset in 52 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-002B-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-002B-LTLCardinality-07 finished in 14175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 83/83 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 72 transition count 73
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 63 transition count 73
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 18 place count 63 transition count 63
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 53 transition count 63
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 49 transition count 59
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 49 transition count 59
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 46 place count 49 transition count 57
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 47 transition count 57
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 80 place count 32 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 30 transition count 40
Applied a total of 82 rules in 24 ms. Remains 30 /73 variables (removed 43) and now considering 40/83 (removed 43) transitions.
// Phase 1: matrix 40 rows 30 cols
[2024-06-01 17:23:54] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 17:23:54] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 17:23:54] [INFO ] Invariant cache hit.
[2024-06-01 17:23:54] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-01 17:23:54] [INFO ] Redundant transitions in 13 ms returned [39]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 38 sub problems to find dead transitions.
// Phase 1: matrix 39 rows 30 cols
[2024-06-01 17:23:54] [INFO ] Computed 9 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:23:54] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2024-06-01 17:23:54] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:23:54] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 17:23:54] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:23:54] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 17:23:54] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:23:54] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:23:54] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-06-01 17:23:54] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-06-01 17:23:54] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 17:23:54] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-06-01 17:23:54] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-06-01 17:23:54] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 13/22 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:23:54] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 39/69 variables, 30/53 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:23:55] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-06-01 17:23:55] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 17:23:55] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-06-01 17:23:55] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 17:23:55] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 17:23:55] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 17:23:55] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:23:55] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:23:55] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:23:55] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/69 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 63 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1249 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 39/69 variables, 30/63 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 38/101 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 17:23:55] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 102 constraints, problems are : Problem set: 0 solved, 38 unsolved in 569 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 25/25 constraints]
After SMT, in 1833ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1835ms
Starting structural reductions in SI_LTL mode, iteration 1 : 30/73 places, 39/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1949 ms. Remains : 30/73 places, 39/83 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLCardinality-08
Stuttering criterion allowed to conclude after 32562 steps with 3650 reset in 105 ms.
FORMULA ShieldRVs-PT-002B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLCardinality-08 finished in 2144 ms.
All properties solved by simple procedures.
Total runtime 62333 ms.
ITS solved all properties within timeout

BK_STOP 1717262636624

--------------------
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="ShieldRVs-PT-002B"
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 ShieldRVs-PT-002B, 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 r528-tall-171683761700731"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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