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-171683761000379.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 ShieldPPPs-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-171683761000379
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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.5K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 11:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 13 11:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 13 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 35K 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 ShieldPPPs-PT-002B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717241939112

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:39:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:39:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:39:00] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-06-01 11:39:00] [INFO ] Transformed 139 places.
[2024-06-01 11:39:00] [INFO ] Transformed 129 transitions.
[2024-06-01 11:39:00] [INFO ] Found NUPN structural information;
[2024-06-01 11:39:00] [INFO ] Parsed PT model containing 139 places and 129 transitions and 354 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPs-PT-002B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 132 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 132 transition count 122
Applied a total of 14 rules in 29 ms. Remains 132 /139 variables (removed 7) and now considering 122/129 (removed 7) transitions.
// Phase 1: matrix 122 rows 132 cols
[2024-06-01 11:39:00] [INFO ] Computed 23 invariants in 15 ms
[2024-06-01 11:39:00] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-06-01 11:39:00] [INFO ] Invariant cache hit.
[2024-06-01 11:39:01] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-06-01 11:39:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 11 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:39:02] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:39:03] [INFO ] Deduced a trap composed of 19 places in 516 ms of which 24 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:04] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:39:04] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 8 ms to minimize.
[2024-06-01 11:39:04] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:39:04] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:39:04] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:39:05] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:05] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:39:05] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:39:05] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:39:05] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:39:05] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:39:05] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:05] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:39:05] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:39:06] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:06] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:39:06] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:39:06] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:39:06] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:39:06] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 3 ms to minimize.
[2024-06-01 11:39:06] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:39:06] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:39:06] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:39:06] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:39:06] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:39:06] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:39:06] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:07] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 122/254 variables, 132/204 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:09] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:09] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 2 ms to minimize.
[2024-06-01 11:39:09] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:10] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:11] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 2/210 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:11] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:39:11] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 3 ms to minimize.
[2024-06-01 11:39:11] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:39:11] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:39:11] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:11] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 6/216 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/254 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:13] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:39:13] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:39:13] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:39:13] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:39:13] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/254 variables, 5/221 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:14] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:39:14] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/254 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/254 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 19 (OVERLAPS) 0/254 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 223 constraints, problems are : Problem set: 0 solved, 121 unsolved in 14790 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 68/91 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:16] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:39:16] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:39:16] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/254 variables, 132/226 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 121/347 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:17] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:39:17] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:39:18] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:39:18] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:39:18] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:39:18] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:18] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:39:18] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 8/355 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:20] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:39:20] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:39:20] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:22] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:39:22] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:39:22] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:39:23] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:25] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:39:25] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:39:25] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:28] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:39:28] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:39:28] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 3/368 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-06-01 11:39:30] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/254 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 369 constraints, problems are : Problem set: 0 solved, 121 unsolved in 21834 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 93/93 constraints]
After SMT, in 36677ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 36706ms
Starting structural reductions in LTL mode, iteration 1 : 132/139 places, 122/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37142 ms. Remains : 132/139 places, 122/129 transitions.
Support contains 31 out of 132 places after structural reductions.
[2024-06-01 11:39:37] [INFO ] Flatten gal took : 30 ms
[2024-06-01 11:39:37] [INFO ] Flatten gal took : 28 ms
[2024-06-01 11:39:38] [INFO ] Input system was already deterministic with 122 transitions.
RANDOM walk for 40000 steps (97 resets) in 798 ms. (50 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40002 steps (22 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
[2024-06-01 11:39:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:39:38] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Real declared 37/254 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 4/23 constraints, State Equation: 0/132 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 56ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 28 stabilizing places and 28 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 131 transition count 108
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 118 transition count 108
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 26 place count 118 transition count 96
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 50 place count 106 transition count 96
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 100 transition count 90
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 100 transition count 90
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 62 place count 100 transition count 87
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 97 transition count 87
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 124 place count 69 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 68 transition count 58
Applied a total of 125 rules in 33 ms. Remains 68 /132 variables (removed 64) and now considering 58/122 (removed 64) transitions.
// Phase 1: matrix 58 rows 68 cols
[2024-06-01 11:39:38] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:39:38] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 11:39:38] [INFO ] Invariant cache hit.
[2024-06-01 11:39:38] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-06-01 11:39:38] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2024-06-01 11:39:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:39:39] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:39] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:39:39] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2024-06-01 11:39:39] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:39:39] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:39:39] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:39:39] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:39:39] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 8/31 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 58/126 variables, 68/99 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:39:39] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:39:39] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:39:39] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:39:40] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:39:40] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:39:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:39:40] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/126 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 13 (OVERLAPS) 0/126 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 106 constraints, problems are : Problem set: 0 solved, 56 unsolved in 2227 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:39:41] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:39:41] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 58/126 variables, 68/108 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 56/164 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:39:41] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:39:42] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/126 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 13 (OVERLAPS) 0/126 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 166 constraints, problems are : Problem set: 0 solved, 56 unsolved in 2444 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 19/19 constraints]
After SMT, in 4682ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 4684ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/132 places, 58/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4860 ms. Remains : 68/132 places, 58/122 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-00
Stuttering criterion allowed to conclude after 695 steps with 7 reset in 14 ms.
FORMULA ShieldPPPs-PT-002B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-00 finished in 5202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(F((G(F(p1))||p0)))))))))'
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 127 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 127 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 126 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 126 transition count 116
Applied a total of 12 rules in 15 ms. Remains 126 /132 variables (removed 6) and now considering 116/122 (removed 6) transitions.
// Phase 1: matrix 116 rows 126 cols
[2024-06-01 11:39:43] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:39:43] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 11:39:43] [INFO ] Invariant cache hit.
[2024-06-01 11:39:43] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-06-01 11:39:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:39:44] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:39:44] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:39:44] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:39:44] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:39:44] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:39:44] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:39:44] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:39:44] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:39:44] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:39:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:45] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:39:45] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:39:45] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:39:45] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:39:45] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:39:45] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/242 variables, 126/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:39:46] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:39:46] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:39:46] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:39:46] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:39:46] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:39:46] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:39:46] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:39:46] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:39:46] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:39:46] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:39:46] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:39:47] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:39:47] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:48] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 2 ms to minimize.
[2024-06-01 11:39:48] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:39:48] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:39:48] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:39:48] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:39:48] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/242 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 184 constraints, problems are : Problem set: 0 solved, 115 unsolved in 6202 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 35/58 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:39:50] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:39:50] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:39:51] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:39:51] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/242 variables, 126/188 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 115/303 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:39:52] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:39:52] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:39:52] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:39:52] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:39:52] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:39:54] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:39:56] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:39:58] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:39:58] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:39:58] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/242 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 15 (OVERLAPS) 0/242 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 314 constraints, problems are : Problem set: 0 solved, 115 unsolved in 19098 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 50/50 constraints]
After SMT, in 25312ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 25314ms
Starting structural reductions in LTL mode, iteration 1 : 126/132 places, 116/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25467 ms. Remains : 126/132 places, 116/122 transitions.
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-01
Product exploration explored 100000 steps with 13815 reset in 183 ms.
Product exploration explored 100000 steps with 13820 reset in 114 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 959 steps (1 resets) in 16 ms. (56 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-06-01 11:40:11] [INFO ] Invariant cache hit.
[2024-06-01 11:40:11] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 11:40:11] [INFO ] Invariant cache hit.
[2024-06-01 11:40:11] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-06-01 11:40:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:40:12] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/242 variables, 126/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:40:13] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:14] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:40:14] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:40:14] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:40:14] [INFO ] Deduced a trap composed of 31 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:15] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:40:15] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:40:15] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:40:15] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:15] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:40:16] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:40:16] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:40:16] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/242 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 184 constraints, problems are : Problem set: 0 solved, 115 unsolved in 6208 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 35/58 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:40:18] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:18] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:40:18] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/242 variables, 126/188 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 115/303 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:19] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:40:19] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:40:20] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:40:20] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:40:20] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:22] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:23] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:26] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:40:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:40:26] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:30] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/242 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 15 (OVERLAPS) 0/242 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 314 constraints, problems are : Problem set: 0 solved, 115 unsolved in 19014 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 50/50 constraints]
After SMT, in 25234ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 25235ms
Finished structural reductions in LTL mode , in 1 iterations and 25379 ms. Remains : 126/126 places, 116/116 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4349 steps (10 resets) in 34 ms. (124 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 158 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 350 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13825 reset in 73 ms.
Product exploration explored 100000 steps with 13793 reset in 125 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 389 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 126 transition count 116
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 15 place count 126 transition count 118
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 126 transition count 118
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 59 place count 126 transition count 118
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 73 place count 112 transition count 104
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 87 place count 112 transition count 104
Deduced a syphon composed of 45 places in 0 ms
Applied a total of 87 rules in 24 ms. Remains 112 /126 variables (removed 14) and now considering 104/116 (removed 12) transitions.
[2024-06-01 11:40:39] [INFO ] Redundant transitions in 2 ms returned []
Running 103 sub problems to find dead transitions.
// Phase 1: matrix 104 rows 112 cols
[2024-06-01 11:40:39] [INFO ] Computed 23 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD49 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
[2024-06-01 11:40:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
[2024-06-01 11:40:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 17/40 constraints. Problems are: Problem set: 47 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/40 constraints. Problems are: Problem set: 47 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 104/216 variables, 112/152 constraints. Problems are: Problem set: 47 solved, 56 unsolved
[2024-06-01 11:40:40] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 1/153 constraints. Problems are: Problem set: 47 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/153 constraints. Problems are: Problem set: 47 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/216 variables, 0/153 constraints. Problems are: Problem set: 47 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 153 constraints, problems are : Problem set: 47 solved, 56 unsolved in 2014 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 47 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 47 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 46/112 variables, 23/23 constraints. Problems are: Problem set: 47 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 18/41 constraints. Problems are: Problem set: 47 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/41 constraints. Problems are: Problem set: 47 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 104/216 variables, 112/153 constraints. Problems are: Problem set: 47 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 56/209 constraints. Problems are: Problem set: 47 solved, 56 unsolved
[2024-06-01 11:40:41] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:40:41] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 2/211 constraints. Problems are: Problem set: 47 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/211 constraints. Problems are: Problem set: 47 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/216 variables, 0/211 constraints. Problems are: Problem set: 47 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 211 constraints, problems are : Problem set: 47 solved, 56 unsolved in 2372 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 56/103 constraints, Known Traps: 20/20 constraints]
After SMT, in 4401ms problems are : Problem set: 47 solved, 56 unsolved
Search for dead transitions found 47 dead transitions in 4403ms
Found 47 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 112/126 places, 57/116 transitions.
Graph (complete) has 171 edges and 112 vertex of which 67 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.2 ms
Discarding 45 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 67 /112 variables (removed 45) and now considering 57/57 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/126 places, 57/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4444 ms. Remains : 67/126 places, 57/116 transitions.
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 126 cols
[2024-06-01 11:40:43] [INFO ] Computed 23 invariants in 3 ms
[2024-06-01 11:40:43] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 11:40:43] [INFO ] Invariant cache hit.
[2024-06-01 11:40:43] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-06-01 11:40:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:40:44] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/242 variables, 126/165 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:45] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:40:45] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:40:45] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:40:46] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:40:46] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:40:46] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-06-01 11:40:46] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:46] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 2 ms to minimize.
[2024-06-01 11:40:46] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-06-01 11:40:46] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:40:46] [INFO ] Deduced a trap composed of 31 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:47] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:40:47] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:40:47] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:40:47] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:48] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:40:48] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:40:48] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:40:48] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 0/242 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 184 constraints, problems are : Problem set: 0 solved, 115 unsolved in 6334 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 35/58 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:50] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:40:50] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:50] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:40:50] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/242 variables, 126/188 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 115/303 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:52] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:40:52] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:40:52] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:40:52] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:40:52] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 5/308 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:54] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:56] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:40:58] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:40:58] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:40:58] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 3/313 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:41:02] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/242 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 15 (OVERLAPS) 0/242 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 314 constraints, problems are : Problem set: 0 solved, 115 unsolved in 19146 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 50/50 constraints]
After SMT, in 25495ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 25496ms
Finished structural reductions in LTL mode , in 1 iterations and 25638 ms. Remains : 126/126 places, 116/116 transitions.
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-01 finished in 85351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((G(F(p1))&&p0)) U G(p1)))))'
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 122/122 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 125 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 125 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 124 transition count 114
Applied a total of 16 rules in 2 ms. Remains 124 /132 variables (removed 8) and now considering 114/122 (removed 8) transitions.
// Phase 1: matrix 114 rows 124 cols
[2024-06-01 11:41:09] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:41:09] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 11:41:09] [INFO ] Invariant cache hit.
[2024-06-01 11:41:09] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 11:41:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:10] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:41:10] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:41:10] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:41:10] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:41:10] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:41:10] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:41:10] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:41:10] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:41:10] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2024-06-01 11:41:10] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2024-06-01 11:41:10] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:41:10] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:41:11] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-06-01 11:41:11] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:41:11] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:11] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:41:11] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-06-01 11:41:11] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:12] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:41:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:41:12] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:13] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:41:13] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:41:13] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2024-06-01 11:41:13] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:41:13] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:14] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:41:14] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:41:14] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:41:14] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:41:14] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:41:14] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 0 ms to minimize.
[2024-06-01 11:41:14] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:14] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6942 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:16] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:17] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:17] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:41:17] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:17] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:19] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:41:19] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 11:41:19] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:41:19] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:41:19] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:41:19] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:41:19] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:21] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:41:22] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 2 ms to minimize.
[2024-06-01 11:41:22] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:41:22] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:41:22] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:23] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:41:23] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:25] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:41:26] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:41:26] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-06-01 11:41:26] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:41:26] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:41:26] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:27] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:41:28] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-01 11:41:28] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:41:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:30] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:41:30] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:41:30] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2024-06-01 11:41:30] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 21124 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 28079ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 28081ms
Starting structural reductions in LTL mode, iteration 1 : 124/132 places, 114/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28248 ms. Remains : 124/132 places, 114/122 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-02
Product exploration explored 100000 steps with 16681 reset in 89 ms.
Product exploration explored 100000 steps with 16605 reset in 88 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 9 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
RANDOM walk for 1298 steps (2 resets) in 28 ms. (44 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 285 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 9 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 11:41:39] [INFO ] Invariant cache hit.
[2024-06-01 11:41:39] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 11:41:39] [INFO ] Invariant cache hit.
[2024-06-01 11:41:39] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 11:41:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:41:40] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:41] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:41:41] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:41:41] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:41] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:41:41] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:41:41] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:42] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:41:42] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:41:42] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:41:43] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:41:43] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:43] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 2 ms to minimize.
[2024-06-01 11:41:43] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:41:43] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:41:43] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:41:43] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:41:43] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:41:43] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:44] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6119 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:46] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:46] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:46] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:41:46] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:47] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:48] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:41:48] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:41:48] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:41:48] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:41:48] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:41:49] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:41:49] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:50] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:41:51] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:41:51] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:41:51] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:41:51] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:53] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:41:53] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:55] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:41:55] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:41:55] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:41:55] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:41:55] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:41:55] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:56] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:41:57] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:41:57] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:41:57] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:41:59] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:41:59] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:41:59] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:41:59] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 20642 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 26775ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 26776ms
Finished structural reductions in LTL mode , in 1 iterations and 26909 ms. Remains : 124/124 places, 114/114 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 9 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
RANDOM walk for 1909 steps (3 resets) in 33 ms. (56 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 196 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 9 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 361 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 351 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 16725 reset in 82 ms.
Product exploration explored 100000 steps with 16607 reset in 86 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 364 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 124 transition count 114
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 14 place count 124 transition count 115
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 19 place count 124 transition count 115
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 57 place count 124 transition count 115
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 70 place count 111 transition count 102
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 83 place count 111 transition count 102
Deduced a syphon composed of 44 places in 0 ms
Applied a total of 83 rules in 12 ms. Remains 111 /124 variables (removed 13) and now considering 102/114 (removed 12) transitions.
[2024-06-01 11:42:08] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
// Phase 1: matrix 102 rows 111 cols
[2024-06-01 11:42:08] [INFO ] Computed 23 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/43 constraints. Problems are: Problem set: 45 solved, 56 unsolved
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:42:09] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 2/45 constraints. Problems are: Problem set: 45 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/45 constraints. Problems are: Problem set: 45 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 102/213 variables, 111/156 constraints. Problems are: Problem set: 45 solved, 56 unsolved
[2024-06-01 11:42:10] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:42:10] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:42:10] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:42:10] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:42:10] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:42:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:42:10] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 7/163 constraints. Problems are: Problem set: 45 solved, 56 unsolved
[2024-06-01 11:42:10] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:42:11] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 2/165 constraints. Problems are: Problem set: 45 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/165 constraints. Problems are: Problem set: 45 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/213 variables, 0/165 constraints. Problems are: Problem set: 45 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 165 constraints, problems are : Problem set: 45 solved, 56 unsolved in 2919 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 45 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 45 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 45/111 variables, 23/23 constraints. Problems are: Problem set: 45 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 31/54 constraints. Problems are: Problem set: 45 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/54 constraints. Problems are: Problem set: 45 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 102/213 variables, 111/165 constraints. Problems are: Problem set: 45 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 56/221 constraints. Problems are: Problem set: 45 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/221 constraints. Problems are: Problem set: 45 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/213 variables, 0/221 constraints. Problems are: Problem set: 45 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 221 constraints, problems are : Problem set: 45 solved, 56 unsolved in 3062 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 56/101 constraints, Known Traps: 31/31 constraints]
After SMT, in 5996ms problems are : Problem set: 45 solved, 56 unsolved
Search for dead transitions found 45 dead transitions in 5997ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 111/124 places, 57/114 transitions.
Graph (complete) has 170 edges and 111 vertex of which 67 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.2 ms
Discarding 44 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 67 /111 variables (removed 44) and now considering 57/57 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/124 places, 57/114 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6025 ms. Remains : 67/124 places, 57/114 transitions.
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 124 cols
[2024-06-01 11:42:14] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 11:42:14] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 11:42:14] [INFO ] Invariant cache hit.
[2024-06-01 11:42:14] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 11:42:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:42:15] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:16] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:42:16] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:42:16] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:16] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:42:16] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:42:16] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:17] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:42:17] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:42:18] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:42:18] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:42:18] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:18] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:42:18] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:42:18] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:42:18] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:42:18] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:42:18] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:42:18] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:19] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6000 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:21] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:21] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:22] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:42:22] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:22] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:23] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:42:23] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 11:42:23] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:42:24] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:26] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:42:26] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-06-01 11:42:26] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:42:26] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:42:27] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:42:28] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:30] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-06-01 11:42:30] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:42:30] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:42:30] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:42:30] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2024-06-01 11:42:31] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:32] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:42:33] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:42:33] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:42:33] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:35] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:42:35] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:42:35] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:42:35] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 20952 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 26961ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 26963ms
Finished structural reductions in LTL mode , in 1 iterations and 27101 ms. Remains : 124/124 places, 114/114 transitions.
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-02 finished in 92623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 131 transition count 106
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 116 transition count 106
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 30 place count 116 transition count 97
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 48 place count 107 transition count 97
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 101 transition count 91
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 101 transition count 91
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 60 place count 101 transition count 89
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 64 place count 99 transition count 89
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 67 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 65 transition count 55
Applied a total of 130 rules in 12 ms. Remains 65 /132 variables (removed 67) and now considering 55/122 (removed 67) transitions.
// Phase 1: matrix 55 rows 65 cols
[2024-06-01 11:42:41] [INFO ] Computed 23 invariants in 0 ms
[2024-06-01 11:42:41] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 11:42:41] [INFO ] Invariant cache hit.
[2024-06-01 11:42:41] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-06-01 11:42:41] [INFO ] Redundant transitions in 0 ms returned []
Running 52 sub problems to find dead transitions.
[2024-06-01 11:42:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 11:42:42] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 11:42:42] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 55/120 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 52 unsolved in 835 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 55/120 variables, 65/90 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 52/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 142 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1172 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 65/65 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 2/2 constraints]
After SMT, in 2015ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 2015ms
Starting structural reductions in SI_LTL mode, iteration 1 : 65/132 places, 55/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2132 ms. Remains : 65/132 places, 55/122 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-04
Product exploration explored 100000 steps with 557 reset in 189 ms.
Stack based approach found an accepted trace after 1602 steps with 8 reset with depth 180 and stack size 180 in 4 ms.
FORMULA ShieldPPPs-PT-002B-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-04 finished in 2380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 131 transition count 106
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 116 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 115 transition count 105
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 32 place count 115 transition count 95
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 52 place count 105 transition count 95
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 59 place count 98 transition count 88
Iterating global reduction 3 with 7 rules applied. Total rules applied 66 place count 98 transition count 88
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 66 place count 98 transition count 85
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 72 place count 95 transition count 85
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 132 place count 65 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 63 transition count 53
Applied a total of 134 rules in 27 ms. Remains 63 /132 variables (removed 69) and now considering 53/122 (removed 69) transitions.
// Phase 1: matrix 53 rows 63 cols
[2024-06-01 11:42:44] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:42:44] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 11:42:44] [INFO ] Invariant cache hit.
[2024-06-01 11:42:44] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-06-01 11:42:44] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-06-01 11:42:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-01 11:42:44] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 53/116 variables, 63/87 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 0/116 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 87 constraints, problems are : Problem set: 0 solved, 51 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 53/116 variables, 63/87 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 51/138 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/116 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 138 constraints, problems are : Problem set: 0 solved, 51 unsolved in 702 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 1/1 constraints]
After SMT, in 1275ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1276ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/132 places, 53/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1450 ms. Remains : 63/132 places, 53/122 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-05
Stuttering criterion allowed to conclude after 175 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-002B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-05 finished in 1502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 122/122 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 125 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 125 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 124 transition count 114
Applied a total of 16 rules in 7 ms. Remains 124 /132 variables (removed 8) and now considering 114/122 (removed 8) transitions.
// Phase 1: matrix 114 rows 124 cols
[2024-06-01 11:42:45] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:42:45] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 11:42:45] [INFO ] Invariant cache hit.
[2024-06-01 11:42:45] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 11:42:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:46] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-06-01 11:42:46] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:42:46] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:42:46] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:42:46] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:42:46] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:42:46] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:42:46] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:42:46] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:42:46] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:42:46] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:42:46] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:42:46] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:42:47] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:42:47] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:47] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:42:47] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:42:47] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:47] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:42:47] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:42:48] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:49] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:42:49] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:42:49] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:42:49] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:42:49] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:49] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-06-01 11:42:49] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:42:50] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:42:50] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2024-06-01 11:42:50] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:42:50] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:42:50] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:50] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6178 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:52] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:52] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:53] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:42:53] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:53] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:54] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:42:54] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-06-01 11:42:54] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:42:54] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:42:55] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:42:55] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:42:55] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:57] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:42:57] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:42:57] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:42:57] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:42:58] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:42:59] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:42:59] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:01] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:43:01] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:43:01] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:43:01] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:43:01] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:43:01] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:02] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:43:03] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:43:03] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:43:03] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:05] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:43:05] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-06-01 11:43:05] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:43:05] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 19891 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 26088ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 26089ms
Starting structural reductions in LTL mode, iteration 1 : 124/132 places, 114/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26245 ms. Remains : 124/132 places, 114/122 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-08
Product exploration explored 100000 steps with 25000 reset in 146 ms.
Product exploration explored 100000 steps with 25000 reset in 108 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 65 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 109 steps (0 resets) in 4 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 124 /124 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-06-01 11:43:13] [INFO ] Invariant cache hit.
[2024-06-01 11:43:13] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 11:43:13] [INFO ] Invariant cache hit.
[2024-06-01 11:43:13] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 11:43:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:43:13] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:43:13] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:43:13] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:43:13] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:43:13] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:43:14] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:43:14] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:43:14] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:43:14] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:43:14] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:43:14] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:43:14] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:43:14] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:43:14] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:14] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:43:14] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:43:14] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:15] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:43:15] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-06-01 11:43:15] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:16] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:43:16] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:43:16] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:43:16] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:43:16] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:17] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:43:17] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:43:17] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:43:17] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:43:17] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:43:17] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:43:17] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:17] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6103 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:19] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:20] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:20] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:43:20] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:20] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:22] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:43:22] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:43:22] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:43:22] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:43:22] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:43:22] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:43:22] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:24] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:43:24] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-06-01 11:43:25] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:43:25] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:43:25] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:43:26] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:28] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:43:28] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:43:28] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:43:28] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:43:28] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:43:29] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:30] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:43:30] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:43:30] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:43:31] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:33] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:43:33] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:43:33] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:43:33] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 20475 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 26589ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 26591ms
Finished structural reductions in LTL mode , in 1 iterations and 26736 ms. Remains : 124/124 places, 114/114 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 173 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 208 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 148 ms.
Product exploration explored 100000 steps with 25000 reset in 169 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 124 transition count 114
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 13 place count 124 transition count 115
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 124 transition count 115
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 59 place count 124 transition count 115
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 75 place count 108 transition count 99
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 91 place count 108 transition count 99
Deduced a syphon composed of 43 places in 0 ms
Applied a total of 91 rules in 12 ms. Remains 108 /124 variables (removed 16) and now considering 99/114 (removed 15) transitions.
[2024-06-01 11:43:41] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
// Phase 1: matrix 99 rows 108 cols
[2024-06-01 11:43:41] [INFO ] Computed 23 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 11:43:41] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-06-01 11:43:41] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 11:43:41] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 11:43:41] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-01 11:43:41] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-06-01 11:43:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
[2024-06-01 11:43:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-01 11:43:42] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 11:43:42] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-01 11:43:42] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
[2024-06-01 11:43:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 11:43:42] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-06-01 11:43:42] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-01 11:43:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-06-01 11:43:42] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-06-01 11:43:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:43:42] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
[2024-06-01 11:43:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 18/41 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/41 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 99/207 variables, 108/149 constraints. Problems are: Problem set: 44 solved, 54 unsolved
[2024-06-01 11:43:42] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 1/150 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/150 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/150 constraints. Problems are: Problem set: 44 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 150 constraints, problems are : Problem set: 44 solved, 54 unsolved in 1939 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 44 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 44/108 variables, 23/23 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 19/42 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/42 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 99/207 variables, 108/150 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 54/204 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/204 constraints. Problems are: Problem set: 44 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/204 constraints. Problems are: Problem set: 44 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 204 constraints, problems are : Problem set: 44 solved, 54 unsolved in 1423 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 54/98 constraints, Known Traps: 19/19 constraints]
After SMT, in 3376ms problems are : Problem set: 44 solved, 54 unsolved
Search for dead transitions found 44 dead transitions in 3377ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 108/124 places, 55/114 transitions.
Graph (complete) has 168 edges and 108 vertex of which 65 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.3 ms
Discarding 43 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 65 /108 variables (removed 43) and now considering 55/55 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 65/124 places, 55/114 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3406 ms. Remains : 65/124 places, 55/114 transitions.
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 124 /124 variables (removed 0) and now considering 114/114 (removed 0) transitions.
// Phase 1: matrix 114 rows 124 cols
[2024-06-01 11:43:44] [INFO ] Computed 23 invariants in 2 ms
[2024-06-01 11:43:44] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 11:43:44] [INFO ] Invariant cache hit.
[2024-06-01 11:43:44] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-06-01 11:43:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:45] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-06-01 11:43:45] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:43:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:43:45] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:43:45] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:43:45] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:43:45] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:43:45] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:43:45] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:43:45] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:43:45] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:43:45] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:43:45] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:43:46] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:43:46] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:46] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:43:46] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:43:46] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:46] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:43:46] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
[2024-06-01 11:43:47] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/238 variables, 124/168 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:48] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:43:48] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:43:48] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:43:48] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:43:48] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/173 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:48] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:43:48] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:43:48] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:43:48] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:43:49] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:43:49] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:43:49] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:49] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 181 constraints, problems are : Problem set: 0 solved, 113 unsolved in 6044 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 34/57 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:51] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:51] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:52] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:43:52] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:52] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 114/238 variables, 124/186 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 113/299 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:53] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:43:53] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:43:53] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:43:53] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:43:54] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:43:54] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:43:54] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 7/306 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:56] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:43:56] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:43:56] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:43:56] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:43:57] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:43:58] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:43:58] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:44:00] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:44:00] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:44:00] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:44:00] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:44:00] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:44:00] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 6/319 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:44:02] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:44:02] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:44:02] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:44:02] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/238 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-06-01 11:44:04] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:44:05] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:44:05] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:44:05] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/238 variables, 4/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/238 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 327 constraints, problems are : Problem set: 0 solved, 113 unsolved in 20649 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 67/67 constraints]
After SMT, in 26707ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 26708ms
Finished structural reductions in LTL mode , in 1 iterations and 26847 ms. Remains : 124/124 places, 114/114 transitions.
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-08 finished in 85957 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 122/122 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 126 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 126 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 125 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 125 transition count 115
Applied a total of 14 rules in 3 ms. Remains 125 /132 variables (removed 7) and now considering 115/122 (removed 7) transitions.
// Phase 1: matrix 115 rows 125 cols
[2024-06-01 11:44:11] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:44:11] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 11:44:11] [INFO ] Invariant cache hit.
[2024-06-01 11:44:11] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 114 sub problems to find dead transitions.
[2024-06-01 11:44:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:44:12] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:44:13] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:44:13] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:13] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:44:13] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:13] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:44:13] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:44:14] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:44:14] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:44:14] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:44:14] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:44:14] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 115/240 variables, 125/174 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:15] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:15] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:44:15] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:44:15] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:44:15] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:17] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/240 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:17] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:44:17] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:44:17] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:44:17] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:44:17] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 5/185 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:18] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:18] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:44:19] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:44:19] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:19] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:44:19] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:20] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:44:20] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/240 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/240 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:21] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/240 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/240 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 20 (OVERLAPS) 0/240 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 194 constraints, problems are : Problem set: 0 solved, 114 unsolved in 11562 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 46/69 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:23] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-06-01 11:44:23] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:44:23] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:44:23] [INFO ] Deduced a trap composed of 30 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:44:24] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (OVERLAPS) 115/240 variables, 125/199 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 114/313 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:25] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:44:25] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:44:25] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:44:25] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:44:26] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:27] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:44:27] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:44:28] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:44:28] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:44:28] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:44:28] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:44:28] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 7/325 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:32] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/240 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:34] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:36] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:38] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:44:38] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:44:38] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:44:38] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:44:38] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:44:38] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:44:39] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 7/335 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:43] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/240 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 114 unsolved
[2024-06-01 11:44:45] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/240 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 18 (OVERLAPS) 0/240 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 337 constraints, problems are : Problem set: 0 solved, 114 unsolved in 29264 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 75/75 constraints]
After SMT, in 40838ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 40841ms
Starting structural reductions in LTL mode, iteration 1 : 125/132 places, 115/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40993 ms. Remains : 125/132 places, 115/122 transitions.
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-002B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-09 finished in 41252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 122/122 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 132 transition count 106
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 116 transition count 106
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 116 transition count 96
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 52 place count 106 transition count 96
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 59 place count 99 transition count 89
Iterating global reduction 2 with 7 rules applied. Total rules applied 66 place count 99 transition count 89
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 66 place count 99 transition count 86
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 96 transition count 86
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 138 place count 63 transition count 53
Applied a total of 138 rules in 13 ms. Remains 63 /132 variables (removed 69) and now considering 53/122 (removed 69) transitions.
// Phase 1: matrix 53 rows 63 cols
[2024-06-01 11:44:52] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:44:52] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 11:44:52] [INFO ] Invariant cache hit.
[2024-06-01 11:44:52] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-06-01 11:44:52] [INFO ] Redundant transitions in 0 ms returned []
Running 52 sub problems to find dead transitions.
[2024-06-01 11:44:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 11:44:53] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:44:53] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 53/116 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 11:44:53] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 89 constraints, problems are : Problem set: 0 solved, 52 unsolved in 932 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 53/116 variables, 63/89 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 52/141 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/116 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 141 constraints, problems are : Problem set: 0 solved, 52 unsolved in 929 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 3/3 constraints]
After SMT, in 1869ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1870ms
Starting structural reductions in SI_LTL mode, iteration 1 : 63/132 places, 53/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1996 ms. Remains : 63/132 places, 53/122 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT 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 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-002B-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-10 finished in 2459 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(p1)||p0)))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 122/122 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 126 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 126 transition count 116
Applied a total of 12 rules in 2 ms. Remains 126 /132 variables (removed 6) and now considering 116/122 (removed 6) transitions.
// Phase 1: matrix 116 rows 126 cols
[2024-06-01 11:44:55] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:44:55] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 11:44:55] [INFO ] Invariant cache hit.
[2024-06-01 11:44:55] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-06-01 11:44:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:44:56] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:44:57] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:44:57] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:44:57] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:44:57] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:44:57] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-06-01 11:44:57] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:44:57] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:44:57] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 11:44:57] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:44:57] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:44:58] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:44:58] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-06-01 11:44:58] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:44:58] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:44:58] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:44:58] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:44:58] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:44:58] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:44:58] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:44:58] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:44:58] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:44:59] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:44:59] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:44:59] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:44:59] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:44:59] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 116/242 variables, 126/195 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 195 constraints, problems are : Problem set: 0 solved, 115 unsolved in 6110 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 46/69 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:45:02] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:45:02] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:45:02] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:45:02] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:45:02] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:45:02] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:45:02] [INFO ] Deduced a trap composed of 42 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:45:02] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:45:02] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:45:02] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 116/242 variables, 126/205 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 115/320 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:45:03] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-06-01 11:45:04] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:45:04] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:45:04] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:45:06] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:45:06] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:45:10] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:45:11] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:45:11] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/242 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:45:12] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:45:12] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:45:12] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:45:13] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:45:15] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:45:15] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:45:15] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:45:15] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:45:17] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:45:18] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:45:18] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:45:20] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:45:20] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:45:20] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:45:20] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:45:20] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:45:21] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 6/346 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:45:23] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:45:24] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:45:24] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:45:26] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 115 unsolved
[2024-06-01 11:45:29] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/242 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 351 constraints, problems are : Problem set: 0 solved, 115 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 87/87 constraints]
After SMT, in 36136ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 36138ms
Starting structural reductions in LTL mode, iteration 1 : 126/132 places, 116/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36280 ms. Remains : 126/132 places, 116/122 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-002B-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-12 finished in 36626 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(G(p0))&&F(p1))))'
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 131 transition count 106
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 116 transition count 106
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 116 transition count 96
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 50 place count 106 transition count 96
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 100 transition count 90
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 100 transition count 90
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 62 place count 100 transition count 87
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 97 transition count 87
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 126 place count 68 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 66 transition count 56
Applied a total of 128 rules in 14 ms. Remains 66 /132 variables (removed 66) and now considering 56/122 (removed 66) transitions.
// Phase 1: matrix 56 rows 66 cols
[2024-06-01 11:45:31] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:45:32] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 11:45:32] [INFO ] Invariant cache hit.
[2024-06-01 11:45:32] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-06-01 11:45:32] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-01 11:45:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 11:45:32] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 11:45:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:45:32] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 11:45:32] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 56/122 variables, 66/93 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 11:45:33] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/122 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 94 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1250 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 1/66 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 56/122 variables, 66/94 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 53/147 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 11:45:33] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 148 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1311 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 6/6 constraints]
After SMT, in 2567ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2568ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/132 places, 56/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2699 ms. Remains : 66/132 places, 56/122 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-15
Stuttering criterion allowed to conclude after 112 steps with 2 reset in 0 ms.
FORMULA ShieldPPPs-PT-002B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-15 finished in 2853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(F((G(F(p1))||p0)))))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-002B-LTLCardinality-01
Stuttering acceptance computed with spot in 350 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 132 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 132/132 places, 122/122 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 132 transition count 107
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 117 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 116 transition count 106
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 32 place count 116 transition count 97
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 50 place count 107 transition count 97
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 55 place count 102 transition count 92
Iterating global reduction 3 with 5 rules applied. Total rules applied 60 place count 102 transition count 92
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 60 place count 102 transition count 90
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 100 transition count 90
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 130 place count 67 transition count 57
Applied a total of 130 rules in 11 ms. Remains 67 /132 variables (removed 65) and now considering 57/122 (removed 65) transitions.
// Phase 1: matrix 57 rows 67 cols
[2024-06-01 11:45:35] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:45:35] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 11:45:35] [INFO ] Invariant cache hit.
[2024-06-01 11:45:35] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-06-01 11:45:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:45:35] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/124 variables, 67/91 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:45:36] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:45:36] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/124 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 93 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1340 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/124 variables, 67/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 56/149 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 149 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1080 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
After SMT, in 2427ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2428ms
Starting structural reductions in LI_LTL mode, iteration 1 : 67/132 places, 57/122 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2569 ms. Remains : 67/132 places, 57/122 transitions.
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-01
Product exploration explored 100000 steps with 14285 reset in 87 ms.
Product exploration explored 100000 steps with 14285 reset in 95 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 899 steps (4 resets) in 8 ms. (99 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 57/57 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-06-01 11:45:39] [INFO ] Invariant cache hit.
[2024-06-01 11:45:39] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 11:45:39] [INFO ] Invariant cache hit.
[2024-06-01 11:45:39] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-06-01 11:45:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:45:39] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/124 variables, 67/91 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:45:40] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:45:40] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/124 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 93 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1358 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/124 variables, 67/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 56/149 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 149 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
After SMT, in 2467ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2467ms
Finished structural reductions in LTL mode , in 1 iterations and 2565 ms. Remains : 67/67 places, 57/57 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 871 steps (3 resets) in 7 ms. (108 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 184 ms. Reduced automaton from 8 states, 9 edges and 2 AP (stutter sensitive) to 8 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14285 reset in 94 ms.
Product exploration explored 100000 steps with 14285 reset in 97 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 57/57 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-06-01 11:45:44] [INFO ] Redundant transitions in 2 ms returned []
Running 56 sub problems to find dead transitions.
[2024-06-01 11:45:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:45:44] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/124 variables, 67/91 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:45:44] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:45:45] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/124 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 93 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1338 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/124 variables, 67/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 56/149 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 149 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1061 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
After SMT, in 2405ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2407ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2419 ms. Remains : 67/67 places, 57/57 transitions.
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 57/57 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 57/57 (removed 0) transitions.
[2024-06-01 11:45:46] [INFO ] Invariant cache hit.
[2024-06-01 11:45:46] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 11:45:46] [INFO ] Invariant cache hit.
[2024-06-01 11:45:46] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 56 sub problems to find dead transitions.
[2024-06-01 11:45:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:45:47] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/124 variables, 67/91 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:45:47] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 11:45:47] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/124 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 93 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/67 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 57/124 variables, 67/93 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 56/149 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 149 constraints, problems are : Problem set: 0 solved, 56 unsolved in 1054 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
After SMT, in 2372ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 2373ms
Finished structural reductions in LTL mode , in 1 iterations and 2478 ms. Remains : 67/67 places, 57/57 transitions.
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-01 finished in 14325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X((G(F(p1))&&p0)) U G(p1)))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-002B-LTLCardinality-02
Stuttering acceptance computed with spot in 377 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 132/132 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 131 transition count 107
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 117 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 116 transition count 106
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 30 place count 116 transition count 96
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 50 place count 106 transition count 96
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 57 place count 99 transition count 89
Iterating global reduction 3 with 7 rules applied. Total rules applied 64 place count 99 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 64 place count 99 transition count 87
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 68 place count 97 transition count 87
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 126 place count 68 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 66 transition count 56
Applied a total of 128 rules in 14 ms. Remains 66 /132 variables (removed 66) and now considering 56/122 (removed 66) transitions.
// Phase 1: matrix 56 rows 66 cols
[2024-06-01 11:45:49] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 11:45:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 11:45:49] [INFO ] Invariant cache hit.
[2024-06-01 11:45:49] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 11:45:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:45:49] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:45:50] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:45:50] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-06-01 11:45:50] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 56/122 variables, 66/93 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:45:50] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:45:50] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:45:50] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1245 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 56/122 variables, 66/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 54/150 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:45:51] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 151 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1517 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 8/8 constraints]
After SMT, in 2771ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2772ms
Starting structural reductions in LI_LTL mode, iteration 1 : 66/132 places, 56/122 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2884 ms. Remains : 66/132 places, 56/122 transitions.
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-02
Product exploration explored 100000 steps with 16646 reset in 103 ms.
Product exploration explored 100000 steps with 16667 reset in 113 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 9 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 474 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
RANDOM walk for 1035 steps (5 resets) in 16 ms. (60 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 300 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 9 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 310 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-06-01 11:45:54] [INFO ] Invariant cache hit.
[2024-06-01 11:45:54] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 11:45:54] [INFO ] Invariant cache hit.
[2024-06-01 11:45:54] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 11:45:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:45:54] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:45:54] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:45:54] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-06-01 11:45:54] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 56/122 variables, 66/93 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:45:55] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:45:55] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:45:55] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1256 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 56/122 variables, 66/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 54/150 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:45:56] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 151 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 8/8 constraints]
After SMT, in 2847ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2848ms
Finished structural reductions in LTL mode , in 1 iterations and 2956 ms. Remains : 66/66 places, 56/56 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 9 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
RANDOM walk for 1306 steps (5 resets) in 8 ms. (145 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 301 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 9 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 471 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 361 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 353 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 16672 reset in 105 ms.
Product exploration explored 100000 steps with 16681 reset in 112 ms.
Applying partial POR strategy [false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 351 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-06-01 11:45:59] [INFO ] Redundant transitions in 0 ms returned []
Running 54 sub problems to find dead transitions.
[2024-06-01 11:45:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 56/122 variables, 66/93 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:46:00] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1272 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 56/122 variables, 66/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 54/150 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:46:01] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 151 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1508 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 8/8 constraints]
After SMT, in 2793ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2794ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2808 ms. Remains : 66/66 places, 56/56 transitions.
Support contains 5 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-06-01 11:46:02] [INFO ] Invariant cache hit.
[2024-06-01 11:46:02] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 11:46:02] [INFO ] Invariant cache hit.
[2024-06-01 11:46:02] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 11:46:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:46:02] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:46:03] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 11:46:03] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-06-01 11:46:03] [INFO ] Deduced a trap composed of 31 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 56/122 variables, 66/93 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:46:03] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:46:03] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:46:03] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1229 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 2/66 variables, 11/26 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 56/122 variables, 66/96 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 54/150 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 11:46:04] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 151 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1565 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 8/8 constraints]
After SMT, in 2801ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2802ms
Finished structural reductions in LTL mode , in 1 iterations and 2906 ms. Remains : 66/66 places, 56/56 transitions.
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-02 finished in 16458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
[2024-06-01 11:46:05] [INFO ] Flatten gal took : 9 ms
[2024-06-01 11:46:05] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 11:46:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 132 places, 122 transitions and 340 arcs took 4 ms.
Total runtime 425427 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldPPPs-PT-002B-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPs-PT-002B-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPs-PT-002B-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717242458731

--------------------
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
mcc2024
ltl formula name ShieldPPPs-PT-002B-LTLCardinality-01
ltl formula formula --ltl=/tmp/5438/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 132 places, 122 transitions and 340 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5438/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5438/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5438/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5438/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 134 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 133, there are 164 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2279
pnml2lts-mc( 0/ 4): unique states count: 2279
pnml2lts-mc( 0/ 4): unique transitions count: 7516
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 5423
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2396
pnml2lts-mc( 0/ 4): - cum. max stack depth: 84
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2396 states 8384 transitions, fanout: 3.499
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 119800, Transitions per second: 419200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 10.4 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-002B-LTLCardinality-02
ltl formula formula --ltl=/tmp/5438/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 132 places, 122 transitions and 340 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5438/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5438/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5438/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5438/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 133 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 133, there are 226 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~199 levels ~10000 states ~22972 transitions
pnml2lts-mc( 2/ 4): ~199 levels ~20000 states ~46500 transitions
pnml2lts-mc( 2/ 4): ~210 levels ~40000 states ~94024 transitions
pnml2lts-mc( 2/ 4): ~210 levels ~80000 states ~202796 transitions
pnml2lts-mc( 2/ 4): ~210 levels ~160000 states ~418124 transitions
pnml2lts-mc( 2/ 4): ~210 levels ~320000 states ~911936 transitions
pnml2lts-mc( 2/ 4): ~210 levels ~640000 states ~1903364 transitions
pnml2lts-mc( 2/ 4): ~210 levels ~1280000 states ~5503076 transitions
pnml2lts-mc( 2/ 4): ~210 levels ~2560000 states ~12734348 transitions
pnml2lts-mc( 2/ 4): ~210 levels ~5120000 states ~23734292 transitions
pnml2lts-mc( 2/ 4): ~210 levels ~10240000 states ~49738244 transitions
pnml2lts-mc( 2/ 4): ~210 levels ~20480000 states ~106291940 transitions
pnml2lts-mc( 2/ 4): ~210 levels ~40960000 states ~214191016 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33550972
pnml2lts-mc( 0/ 4): unique states count: 33551618
pnml2lts-mc( 0/ 4): unique transitions count: 167300334
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 133745641
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33551640
pnml2lts-mc( 0/ 4): - cum. max stack depth: 839
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33551640 states 167300452 transitions, fanout: 4.986
pnml2lts-mc( 0/ 4): Total exploration time 92.010 sec (91.980 sec minimum, 91.993 sec on average)
pnml2lts-mc( 0/ 4): States per second: 364652, Transitions per second: 1818286
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.0MB, 8.0 B/state, compr.: 1.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.0MB (~256.0MB paged-in)
ltl formula name ShieldPPPs-PT-002B-LTLCardinality-08
ltl formula formula --ltl=/tmp/5438/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 132 places, 122 transitions and 340 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5438/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5438/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5438/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5438/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 134 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 133, there are 130 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7
pnml2lts-mc( 0/ 4): unique states count: 7
pnml2lts-mc( 0/ 4): unique transitions count: 7
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 22
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22 states 30 transitions, fanout: 1.364
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 70.9 B/state, compr.: 13.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 122 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="ShieldPPPs-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 ShieldPPPs-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-171683761000379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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