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-171683760300060.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 ShieldIIPs-PT-004B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760300060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 11 14:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 14:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 14:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 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 66K 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 ShieldIIPs-PT-004B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-004B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717223700124

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:35:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:35:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:35:01] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-06-01 06:35:01] [INFO ] Transformed 243 places.
[2024-06-01 06:35:01] [INFO ] Transformed 239 transitions.
[2024-06-01 06:35:01] [INFO ] Found NUPN structural information;
[2024-06-01 06:35:01] [INFO ] Parsed PT model containing 243 places and 239 transitions and 718 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-004B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 239/239 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 223 transition count 219
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 223 transition count 219
Applied a total of 40 rules in 40 ms. Remains 223 /243 variables (removed 20) and now considering 219/239 (removed 20) transitions.
// Phase 1: matrix 219 rows 223 cols
[2024-06-01 06:35:01] [INFO ] Computed 37 invariants in 19 ms
[2024-06-01 06:35:01] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-06-01 06:35:01] [INFO ] Invariant cache hit.
[2024-06-01 06:35:02] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-06-01 06:35:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:04] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 13 ms to minimize.
[2024-06-01 06:35:04] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 1 ms to minimize.
[2024-06-01 06:35:04] [INFO ] Deduced a trap composed of 47 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 11 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 3 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:35:05] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:35:06] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 6 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:35:07] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:08] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 4 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:35:09] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:35:10] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:35:11] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:35:11] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:35:11] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:35:11] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:35:11] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:35:11] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 18/115 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:11] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:35:12] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:35:14] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:35:15] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 13/138 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:15] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:16] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:35:16] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:35:17] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:35:17] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:18] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 12 (OVERLAPS) 219/442 variables, 223/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:35:22] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:35:23] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:35:23] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:35:23] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 2 ms to minimize.
[2024-06-01 06:35:23] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:35:23] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:35:23] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:35:23] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/442 variables, 20/387 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:24] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:24] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:35:24] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:35:24] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:35:24] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:35:24] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:35:24] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:35:24] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:35:24] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:35:24] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 10/397 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:25] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:35:25] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 38 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:35:26] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/442 variables, 12/409 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:29] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:35:29] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:35:29] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:35:29] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:35:29] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:35:29] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:35:29] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:35:29] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/442 variables, 20/429 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:30] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:35:31] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/442 variables, and 433 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 173/173 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 173/210 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:33] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:35:33] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:35:33] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:35:33] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:35:34] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:35:34] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:35:34] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:35:34] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:34] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:35:34] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:35:34] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:35:34] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 12/222 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:35] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:35:35] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:35:35] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:35:35] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:36] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:35:36] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:35:36] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:35:37] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:35:37] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:37] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 6/232 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 219/442 variables, 223/455 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 218/673 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:42] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:35:42] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2024-06-01 06:35:42] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:35:42] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:35:42] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:35:42] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:35:43] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:35:43] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:35:43] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:35:43] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:35:43] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:35:43] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:35:44] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:35:44] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:35:44] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:35:44] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:35:44] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:35:44] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:35:45] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:45] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 20/693 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:49] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:35:50] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:35:51] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:35:52] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:52] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:35:52] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:35:53] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 20/713 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-06-01 06:35:59] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:35:59] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:36:01] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/442 variables, and 718 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 240/240 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 223/243 places, 219/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60637 ms. Remains : 223/243 places, 219/239 transitions.
Support contains 45 out of 223 places after structural reductions.
[2024-06-01 06:36:02] [INFO ] Flatten gal took : 40 ms
[2024-06-01 06:36:02] [INFO ] Flatten gal took : 17 ms
[2024-06-01 06:36:02] [INFO ] Input system was already deterministic with 219 transitions.
Support contains 41 out of 223 places (down from 45) after GAL structural reductions.
RANDOM walk for 40000 steps (68 resets) in 906 ms. (44 steps per ms) remains 1/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
[2024-06-01 06:36:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 195/223 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:36:02] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 219/442 variables, 223/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 7/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/442 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 195/223 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 219/442 variables, 223/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:36:03] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/442 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints]
After SMT, in 1016ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 219/219 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 223 transition count 201
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 205 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 204 transition count 200
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 38 place count 204 transition count 178
Deduced a syphon composed of 22 places in 5 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 82 place count 182 transition count 178
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 89 place count 175 transition count 171
Iterating global reduction 3 with 7 rules applied. Total rules applied 96 place count 175 transition count 171
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 96 place count 175 transition count 168
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 102 place count 172 transition count 168
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 238 place count 104 transition count 100
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 264 place count 104 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 265 place count 103 transition count 99
Applied a total of 265 rules in 73 ms. Remains 103 /223 variables (removed 120) and now considering 99/219 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 103/223 places, 99/219 transitions.
RANDOM walk for 40000 steps (8 resets) in 531 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1990365 steps, run timeout after 3001 ms. (steps per millisecond=663 ) properties seen :0 out of 1
Probabilistic random walk after 1990365 steps, saw 410305 distinct states, run finished after 3004 ms. (steps per millisecond=662 ) properties seen :0
// Phase 1: matrix 99 rows 103 cols
[2024-06-01 06:36:07] [INFO ] Computed 37 invariants in 2 ms
[2024-06-01 06:36:07] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/28 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:36:07] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 3 ms to minimize.
[2024-06-01 06:36:07] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 40/70 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 47/117 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/117 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 43/160 variables, 24/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/160 variables, 6/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/160 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/162 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/162 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/164 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/164 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/164 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 28/192 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (INCLUDED_ONLY) 0/192 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/192 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/193 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/193 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/193 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/195 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/195 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/195 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 7/202 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/202 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/202 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/202 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/28 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:36:07] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 40/70 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/70 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 47/117 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/117 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/117 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 43/160 variables, 24/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/160 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/160 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/162 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/162 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/162 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/164 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/164 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/164 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 28/192 variables, 16/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/192 variables, 5/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/192 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/193 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/193 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/193 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/195 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/195 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/195 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 7/202 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/202 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/202 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 0/202 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 424ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 103/103 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-06-01 06:36:07] [INFO ] Invariant cache hit.
[2024-06-01 06:36:07] [INFO ] Implicit Places using invariants in 65 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 102/103 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 72 ms. Remains : 102/103 places, 99/99 transitions.
RANDOM walk for 40000 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2103569 steps, run timeout after 3001 ms. (steps per millisecond=700 ) properties seen :0 out of 1
Probabilistic random walk after 2103569 steps, saw 434032 distinct states, run finished after 3001 ms. (steps per millisecond=700 ) properties seen :0
// Phase 1: matrix 99 rows 102 cols
[2024-06-01 06:36:10] [INFO ] Computed 36 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/27 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:36:10] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/29 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:36:10] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:36:10] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 40/69 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 47/116 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/116 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 43/159 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/159 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/159 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/161 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/161 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/161 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/163 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/163 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/163 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 28/191 variables, 16/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/191 variables, 5/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:36:10] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:36:11] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:36:11] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/191 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/191 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/192 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/192 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/192 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 2/194 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/194 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/194 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 7/201 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/201 variables, 3/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:36:11] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:36:11] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/201 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/201 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 0/201 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/27 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:36:11] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:36:11] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/29 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 40/69 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/69 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 47/116 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/116 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/116 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/116 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 43/159 variables, 24/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/159 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/159 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/159 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/161 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/161 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/161 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/163 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/163 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 28/191 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/191 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/191 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:36:11] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/191 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/191 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1/192 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/192 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/192 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 2/194 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/194 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/194 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 7/201 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/201 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/201 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:36:11] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/201 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/201 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 0/201 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
After SMT, in 676ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 102/102 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-06-01 06:36:11] [INFO ] Invariant cache hit.
[2024-06-01 06:36:11] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 06:36:11] [INFO ] Invariant cache hit.
[2024-06-01 06:36:11] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-01 06:36:11] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
[2024-06-01 06:36:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:36:11] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:36:12] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 99/201 variables, 102/149 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:36:13] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:36:13] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:36:13] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:36:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:36:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:36:13] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:36:13] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:36:13] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 8/157 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 157 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3180 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 14/43 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 99/201 variables, 102/157 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 98/255 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:36:15] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:36:16] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:36:16] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 4 ms to minimize.
[2024-06-01 06:36:16] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:36:16] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 5/260 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:36:18] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:36:18] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:36:20] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:36:20] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:36:20] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:36:23] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:36:26] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:36:27] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/201 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:36:30] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/201 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/201 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 17 (OVERLAPS) 0/201 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 269 constraints, problems are : Problem set: 0 solved, 98 unsolved in 21192 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 33/33 constraints]
After SMT, in 24394ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 24398ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24569 ms. Remains : 102/102 places, 99/99 transitions.
Computed a total of 53 stabilizing places and 53 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' '!(F((G((F(p0) U p1))||((F(p0) U p1)&&G(F(!p0))))))'
Support contains 4 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 222 transition count 199
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 203 transition count 199
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 38 place count 203 transition count 179
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 78 place count 183 transition count 179
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 86 place count 175 transition count 171
Iterating global reduction 2 with 8 rules applied. Total rules applied 94 place count 175 transition count 171
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 94 place count 175 transition count 166
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 170 transition count 166
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 234 place count 105 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 103 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 102 transition count 99
Applied a total of 237 rules in 26 ms. Remains 102 /223 variables (removed 121) and now considering 99/219 (removed 120) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-06-01 06:36:36] [INFO ] Computed 36 invariants in 1 ms
[2024-06-01 06:36:36] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 06:36:36] [INFO ] Invariant cache hit.
[2024-06-01 06:36:36] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-01 06:36:36] [INFO ] Redundant transitions in 21 ms returned [98]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 102 cols
[2024-06-01 06:36:36] [INFO ] Computed 36 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 2/102 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:36:37] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 98/200 variables, 102/153 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:36:38] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:36:39] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:36:39] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:36:40] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/200 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:36:40] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:36:40] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:36:40] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:36:40] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:36:40] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:36:41] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:36:41] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:36:42] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/200 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/200 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 18 (OVERLAPS) 0/200 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 165 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6337 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 21/49 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 2/102 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/165 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 95/260 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:36:44] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 261 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3602 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 28/28 constraints]
After SMT, in 9957ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 9958ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/223 places, 98/219 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10262 ms. Remains : 102/223 places, 98/219 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-00
Stuttering criterion allowed to conclude after 208 steps with 0 reset in 11 ms.
FORMULA ShieldIIPs-PT-004B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004B-LTLFireability-00 finished in 10631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 215 transition count 211
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 215 transition count 211
Applied a total of 16 rules in 13 ms. Remains 215 /223 variables (removed 8) and now considering 211/219 (removed 8) transitions.
// Phase 1: matrix 211 rows 215 cols
[2024-06-01 06:36:47] [INFO ] Computed 37 invariants in 2 ms
[2024-06-01 06:36:47] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 06:36:47] [INFO ] Invariant cache hit.
[2024-06-01 06:36:47] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-06-01 06:36:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:36:48] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:36:48] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:36:49] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:36:50] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:36:51] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:36:52] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:36:52] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:36:52] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:36:52] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:36:52] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:36:52] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:36:52] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:36:52] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:36:52] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:36:52] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:36:53] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:36:53] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:36:53] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:36:53] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:36:53] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:36:54] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:36:54] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:36:54] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:36:54] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:36:54] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:36:54] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:36:54] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:36:54] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:36:55] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:36:55] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:36:55] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:36:57] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:36:57] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 211/426 variables, 215/320 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:36:59] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:36:59] [INFO ] Deduced a trap composed of 53 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:37:00] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:37:01] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 11/331 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:37:01] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:37:01] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:37:01] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:37:01] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:37:01] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:37:02] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:37:03] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:37:04] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:37:04] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:37:04] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:37:04] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:37:04] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:37:04] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:37:04] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:37:04] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 16/353 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:37:06] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:37:06] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:37:07] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:37:07] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:37:07] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:37:08] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:37:08] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:37:08] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:37:08] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:37:08] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:37:08] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:37:08] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:37:09] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:37:09] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:37:09] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:37:09] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 12/369 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:37:09] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:37:09] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:37:09] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:37:10] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:37:10] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:37:11] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 6/375 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:37:14] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:37:14] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:37:14] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:37:14] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:37:14] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:37:14] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/426 variables, 6/381 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:37:15] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 382 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 130/130 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 130/167 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:37:18] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:37:18] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:37:18] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:37:19] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 211/426 variables, 215/386 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 210/596 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:37:22] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:37:22] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:37:22] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:37:22] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:37:23] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:37:23] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:37:23] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:37:23] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:37:23] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:37:23] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:37:23] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:37:23] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:37:24] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:37:24] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:37:24] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:37:24] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:37:25] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 17/613 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:37:30] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:37:30] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:37:30] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:37:30] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:37:31] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:37:31] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:37:31] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 7/620 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:37:39] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:37:45] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:37:46] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:37:47] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 627 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 165/165 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 215/223 places, 211/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60310 ms. Remains : 215/223 places, 211/219 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-01
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-004B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004B-LTLFireability-01 finished in 60483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((X(p0) U p1)))&&F(p1))))'
Support contains 1 out of 223 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 222 transition count 200
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 204 transition count 200
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 36 place count 204 transition count 180
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 76 place count 184 transition count 180
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 85 place count 175 transition count 171
Iterating global reduction 2 with 9 rules applied. Total rules applied 94 place count 175 transition count 171
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 94 place count 175 transition count 166
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 170 transition count 166
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 234 place count 105 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 103 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 102 transition count 99
Applied a total of 237 rules in 30 ms. Remains 102 /223 variables (removed 121) and now considering 99/219 (removed 120) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-06-01 06:37:47] [INFO ] Computed 36 invariants in 2 ms
[2024-06-01 06:37:47] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 06:37:47] [INFO ] Invariant cache hit.
[2024-06-01 06:37:47] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-06-01 06:37:47] [INFO ] Redundant transitions in 17 ms returned [98]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 102 cols
[2024-06-01 06:37:47] [INFO ] Computed 36 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 2/102 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:37:48] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:37:49] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:37:49] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:37:49] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 5 ms to minimize.
[2024-06-01 06:37:49] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 9/53 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:37:49] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 98/200 variables, 102/156 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:37:49] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:37:49] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:37:50] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:37:50] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:37:50] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:37:51] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/200 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:37:51] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:37:51] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:37:51] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:37:51] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:37:51] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:37:51] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 5/168 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:37:52] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 15 (OVERLAPS) 0/200 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 169 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5713 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 2/102 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/169 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 95/264 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:37:54] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 265 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3666 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 32/32 constraints]
After SMT, in 9393ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 9394ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/223 places, 98/219 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9588 ms. Remains : 102/223 places, 98/219 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-02
Product exploration explored 100000 steps with 4629 reset in 315 ms.
Product exploration explored 100000 steps with 4961 reset in 239 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 174 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 25 steps (0 resets) in 5 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 215 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
[2024-06-01 06:37:58] [INFO ] Invariant cache hit.
[2024-06-01 06:37:58] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 06:37:58] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-06-01 06:37:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:37:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 06:37:58] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-01 06:37:58] [INFO ] Computed and/alt/rep : 95/235/95 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 06:37:58] [INFO ] Added : 80 causal constraints over 16 iterations in 191 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 102 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-06-01 06:37:58] [INFO ] Invariant cache hit.
[2024-06-01 06:37:58] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 06:37:58] [INFO ] Invariant cache hit.
[2024-06-01 06:37:59] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-06-01 06:37:59] [INFO ] Redundant transitions in 17 ms returned []
Running 95 sub problems to find dead transitions.
[2024-06-01 06:37:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:37:59] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:37:59] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:37:59] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:37:59] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:37:59] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:37:59] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:37:59] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:37:59] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 2/102 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:00] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:38:00] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:38:00] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:38:00] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:38:00] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:38:00] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:38:00] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:38:00] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:38:01] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 8/166 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:02] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:38:02] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:02] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:38:03] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/200 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:03] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:38:03] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 14 (OVERLAPS) 0/200 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 172 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5426 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 21/55 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 2/102 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/172 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 95/267 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/200 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 267 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2844 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 34/34 constraints]
After SMT, in 8285ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 8287ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8457 ms. Remains : 102/102 places, 98/98 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
[2024-06-01 06:38:07] [INFO ] Invariant cache hit.
[2024-06-01 06:38:07] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 06:38:07] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-06-01 06:38:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:38:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 06:38:08] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-06-01 06:38:08] [INFO ] Computed and/alt/rep : 95/235/95 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 06:38:08] [INFO ] Added : 80 causal constraints over 16 iterations in 169 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4770 reset in 196 ms.
Product exploration explored 100000 steps with 4509 reset in 191 ms.
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 98/98 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 102 transition count 97
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 101 transition count 97
Applied a total of 2 rules in 3 ms. Remains 101 /102 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-06-01 06:38:08] [INFO ] Computed 36 invariants in 2 ms
[2024-06-01 06:38:08] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 06:38:08] [INFO ] Invariant cache hit.
[2024-06-01 06:38:08] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-06-01 06:38:08] [INFO ] Redundant transitions in 17 ms returned []
Running 95 sub problems to find dead transitions.
[2024-06-01 06:38:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:09] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:38:09] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:38:09] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:38:09] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:38:09] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:38:09] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:38:09] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:38:09] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:09] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:10] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:38:10] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:38:10] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:38:10] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 97/198 variables, 101/150 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:10] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:38:10] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:11] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:38:11] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:12] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/198 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:13] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/198 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:13] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:38:13] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:13] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/198 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 17 (OVERLAPS) 0/198 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 159 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5845 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 97/198 variables, 101/159 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 95/254 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:38:15] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 255 constraints, problems are : Problem set: 0 solved, 95 unsolved in 7557 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 23/23 constraints]
After SMT, in 13418ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 13419ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/102 places, 97/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13571 ms. Remains : 101/102 places, 97/98 transitions.
Treatment of property ShieldIIPs-PT-004B-LTLFireability-02 finished in 34882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||(X(p2)&&F(p3))))'
Support contains 4 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 215 transition count 211
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 215 transition count 211
Applied a total of 16 rules in 3 ms. Remains 215 /223 variables (removed 8) and now considering 211/219 (removed 8) transitions.
// Phase 1: matrix 211 rows 215 cols
[2024-06-01 06:38:22] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 06:38:22] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 06:38:22] [INFO ] Invariant cache hit.
[2024-06-01 06:38:22] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-06-01 06:38:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:38:24] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 2 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:38:25] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:38:26] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:27] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-06-01 06:38:27] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:38:27] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-06-01 06:38:27] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:38:28] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:38:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:38:28] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:38:28] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:38:28] [INFO ] Deduced a trap composed of 23 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:38:28] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 2 ms to minimize.
[2024-06-01 06:38:28] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:38:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:38:28] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:38:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:38:28] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:38:28] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:38:28] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:29] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:38:29] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:38:29] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:38:29] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:38:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:38:29] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:38:29] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 7/101 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 211/426 variables, 215/316 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:31] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:38:32] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:38:32] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:38:32] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:38:32] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:38:32] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:38:32] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:38:33] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:38:33] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:38:33] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 10/326 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:34] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:38:34] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:38:34] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:38:34] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:38:34] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:38:34] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:38:34] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:38:34] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:38:34] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:38:35] [INFO ] Deduced a trap composed of 34 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 10/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:36] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:38:36] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:38:37] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:38:37] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:38:37] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:38:37] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:38:37] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 7/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:38:38] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:38:39] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:38:39] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:38:39] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:38:39] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:38:39] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:38:39] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:38:39] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 14/357 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:40] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:38:40] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:38:40] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:38:41] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:38:41] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:38:41] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:38:41] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 7/364 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:38:43] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:38:44] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 12/376 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:45] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:38:45] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:38:45] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:38:45] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:38:46] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:38:46] [INFO ] Deduced a trap composed of 19 places in 15 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 6/382 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:46] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:38:46] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:38:46] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:38:47] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:38:47] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:38:47] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:38:47] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:38:47] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:38:47] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:38:47] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 10/392 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:50] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:51] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:38:51] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:38:51] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:38:51] [INFO ] Deduced a trap composed of 35 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:38:52] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 5/398 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 398 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 146/146 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 146/183 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:53] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:38:54] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:38:54] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:38:55] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 211/426 variables, 215/402 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 210/612 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:39:00] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:39:00] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:39:00] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:39:00] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:39:00] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:39:00] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:39:00] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:39:01] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:39:01] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:39:01] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 10/622 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:39:07] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:39:07] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:39:07] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:39:07] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:39:08] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:39:08] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:39:08] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 7/629 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:39:17] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:39:17] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:39:17] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:39:17] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:39:17] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:39:18] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:39:18] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 7/636 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 636 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 174/174 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 215/223 places, 211/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60275 ms. Remains : 215/223 places, 211/219 transitions.
Stuttering acceptance computed with spot in 328 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), true, (NOT p3), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-04
Entered a terminal (fully accepting) state of product in 36 steps with 2 reset in 1 ms.
FORMULA ShieldIIPs-PT-004B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004B-LTLFireability-04 finished in 60625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 222 transition count 198
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 202 transition count 198
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 40 place count 202 transition count 177
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 82 place count 181 transition count 177
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 173 transition count 169
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 173 transition count 169
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 98 place count 173 transition count 164
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 108 place count 168 transition count 164
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 234 place count 105 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 103 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 102 transition count 99
Applied a total of 237 rules in 24 ms. Remains 102 /223 variables (removed 121) and now considering 99/219 (removed 120) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-06-01 06:39:23] [INFO ] Computed 36 invariants in 1 ms
[2024-06-01 06:39:23] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 06:39:23] [INFO ] Invariant cache hit.
[2024-06-01 06:39:23] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-06-01 06:39:23] [INFO ] Redundant transitions in 16 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 06:39:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:39:23] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:24] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:39:24] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:24] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2024-06-01 06:39:24] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:39:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:39:24] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
[2024-06-01 06:39:24] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 99/201 variables, 102/156 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:25] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:39:25] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:25] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:39:25] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:39:25] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:39:25] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:39:25] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:39:25] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:39:26] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 7/165 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:26] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:39:26] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:39:26] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:39:26] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:39:26] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 170 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4573 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 32/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 99/201 variables, 102/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 97/267 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 267 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5178 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 32/32 constraints]
After SMT, in 9766ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9767ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/223 places, 99/219 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9943 ms. Remains : 102/223 places, 99/219 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-05
Product exploration explored 100000 steps with 1348 reset in 253 ms.
Product exploration explored 100000 steps with 1436 reset in 288 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/102 stabilizing places and 2/99 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 371 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (170 resets) in 273 ms. (145 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40001 steps (28 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
[2024-06-01 06:39:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/38 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/62 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/64 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/64 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/64 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/84 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/84 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/85 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/85 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/87 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/87 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 24/111 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/111 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/111 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/113 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/113 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/113 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 20/133 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/133 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/133 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/134 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/134 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/134 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2/136 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 24/160 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/160 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/160 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 2/162 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/162 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/162 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 20/182 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/182 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/182 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 1/183 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/183 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/183 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 2/185 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/185 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 16/201 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/201 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/201 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 0/201 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/38 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/62 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/64 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/64 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/64 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 20/84 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/84 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/85 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/85 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/87 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/87 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 24/111 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/111 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/111 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/113 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/113 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/113 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 20/133 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/133 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/133 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1/134 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/134 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 2/136 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/136 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 24/160 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/160 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/160 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 2/162 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/162 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 20/182 variables, 10/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/182 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/182 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 1/183 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/183 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/183 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 2/185 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/185 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 16/201 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/201 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/201 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 0/201 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 239ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 99/99 transitions.
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 102 transition count 99
Applied a total of 23 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 102/102 places, 99/99 transitions.
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1931843 steps, run timeout after 3001 ms. (steps per millisecond=643 ) properties seen :0 out of 1
Probabilistic random walk after 1931843 steps, saw 380852 distinct states, run finished after 3001 ms. (steps per millisecond=643 ) properties seen :0
// Phase 1: matrix 99 rows 102 cols
[2024-06-01 06:39:37] [INFO ] Computed 36 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/16 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/40 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/64 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/64 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/86 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/86 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/86 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/87 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/87 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/87 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/89 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/89 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 24/113 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/113 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/113 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/135 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/135 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/135 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/136 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/136 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/138 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/138 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 24/162 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/162 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/162 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 20/182 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/182 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/182 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1/183 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/183 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/183 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 2/185 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/185 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 16/201 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/201 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/201 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/201 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/16 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/40 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/64 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/64 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:39:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/64 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/64 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/86 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/86 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/86 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/87 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/87 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/87 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/89 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 24/113 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/113 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/113 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 22/135 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/135 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/136 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/136 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/136 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/138 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/138 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 24/162 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/162 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 20/182 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/182 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/182 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 1/183 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/183 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/183 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 2/185 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/185 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 16/201 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/201 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:39:37] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:39:37] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:39:37] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/201 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 364ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 102/102 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-06-01 06:39:37] [INFO ] Invariant cache hit.
[2024-06-01 06:39:37] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-01 06:39:37] [INFO ] Invariant cache hit.
[2024-06-01 06:39:38] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-06-01 06:39:38] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 06:39:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:38] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:39:38] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:39:38] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:39:38] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:39:38] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:39:38] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:39:38] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 99/201 variables, 102/149 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:39:39] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:39:40] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:39:40] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:39:40] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:39:40] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 8/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:41] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/201 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 158 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 99/201 variables, 102/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 97/255 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:45] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/201 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:46] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:48] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:39:49] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:50] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:39:51] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 261 constraints, problems are : Problem set: 0 solved, 97 unsolved in 14589 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 26/26 constraints]
After SMT, in 18624ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 18625ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18783 ms. Remains : 102/102 places, 99/99 transitions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 436 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-06-01 06:39:57] [INFO ] Computed 36 invariants in 0 ms
[2024-06-01 06:39:57] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 06:39:57] [INFO ] Invariant cache hit.
[2024-06-01 06:39:57] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-06-01 06:39:57] [INFO ] Redundant transitions in 20 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 06:39:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:57] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:39:57] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:39:57] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:39:57] [INFO ] Deduced a trap composed of 12 places in 15 ms of which 0 ms to minimize.
[2024-06-01 06:39:57] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:39:57] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:39:58] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:39:58] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:39:58] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:39:58] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:39:58] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:58] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:39:58] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:58] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 99/201 variables, 102/156 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:39:59] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:00] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:40:00] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:40:00] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:40:00] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:40:00] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:40:00] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:40:00] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 7/165 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:00] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:40:00] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:40:00] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:40:00] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:40:00] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 170 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4431 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 32/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 99/201 variables, 102/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 97/267 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 267 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 32/32 constraints]
After SMT, in 9468ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9469ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9631 ms. Remains : 102/102 places, 99/99 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/102 stabilizing places and 2/99 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 362 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (171 resets) in 146 ms. (272 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (28 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
[2024-06-01 06:40:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/38 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/62 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/64 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/64 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/64 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/84 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/84 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/85 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/85 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/87 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/87 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 24/111 variables, 12/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/111 variables, 3/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/111 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/113 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/113 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/113 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 20/133 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/133 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/133 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 1/134 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/134 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/134 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2/136 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 24/160 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/160 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/160 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 2/162 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/162 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/162 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 20/182 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/182 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/182 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 1/183 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/183 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/183 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 2/185 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/185 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 16/201 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/201 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/201 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 0/201 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/16 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/38 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/62 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/64 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/64 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/64 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 20/84 variables, 10/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/84 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/84 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/85 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/85 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/85 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/87 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/87 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 24/111 variables, 12/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/111 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/111 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/113 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/113 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/113 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 20/133 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/133 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/133 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1/134 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/134 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 2/136 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/136 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 24/160 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/160 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/160 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 2/162 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/162 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/162 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 20/182 variables, 10/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/182 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/182 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 1/183 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/183 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/183 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 2/185 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/185 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 16/201 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/201 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/201 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 0/201 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 236ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 99/99 transitions.
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 102 transition count 99
Applied a total of 23 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 102/102 places, 99/99 transitions.
RANDOM walk for 40000 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1999768 steps, run timeout after 3001 ms. (steps per millisecond=666 ) properties seen :0 out of 1
Probabilistic random walk after 1999768 steps, saw 394059 distinct states, run finished after 3001 ms. (steps per millisecond=666 ) properties seen :0
// Phase 1: matrix 99 rows 102 cols
[2024-06-01 06:40:10] [INFO ] Computed 36 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/16 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/40 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/64 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/64 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/86 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/86 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/86 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/87 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/87 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/87 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/89 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/89 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 24/113 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/113 variables, 4/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/113 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/135 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/135 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/135 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/136 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/136 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/136 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/138 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/138 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 24/162 variables, 14/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/162 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/162 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 20/182 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/182 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/182 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1/183 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/183 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/183 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 2/185 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/185 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 16/201 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/201 variables, 4/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/201 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/201 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/16 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/40 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 24/64 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/64 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:40:11] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/64 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/64 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/86 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/86 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/86 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/87 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/87 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/87 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/89 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 24/113 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/113 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/113 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 22/135 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/135 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/135 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/136 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/136 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/136 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/138 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/138 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 24/162 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/162 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/162 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 20/182 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/182 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/182 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 1/183 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/183 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/183 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 2/185 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/185 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 16/201 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/201 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:40:11] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:40:11] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:40:11] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/201 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 0/201 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 423ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 102/102 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-06-01 06:40:11] [INFO ] Invariant cache hit.
[2024-06-01 06:40:11] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 06:40:11] [INFO ] Invariant cache hit.
[2024-06-01 06:40:11] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-06-01 06:40:11] [INFO ] Redundant transitions in 1 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 06:40:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:11] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:40:11] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:40:11] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:40:11] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
[2024-06-01 06:40:11] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:40:11] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:40:11] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:12] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:40:12] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:40:12] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:40:12] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 99/201 variables, 102/149 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:13] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:40:13] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:40:13] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:40:13] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:40:13] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:40:13] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:40:13] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:40:13] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 8/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:14] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/201 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 158 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3924 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 99/201 variables, 102/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 97/255 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:18] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/201 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:20] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:21] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:40:22] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:23] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:40:24] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (OVERLAPS) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 261 constraints, problems are : Problem set: 0 solved, 97 unsolved in 14649 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 26/26 constraints]
After SMT, in 18596ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 18597ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18751 ms. Remains : 102/102 places, 99/99 transitions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 542 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1404 reset in 192 ms.
Product exploration explored 100000 steps with 1341 reset in 214 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-06-01 06:40:31] [INFO ] Computed 36 invariants in 1 ms
[2024-06-01 06:40:31] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 06:40:31] [INFO ] Invariant cache hit.
[2024-06-01 06:40:31] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-01 06:40:31] [INFO ] Redundant transitions in 16 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 06:40:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:31] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:40:31] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:40:31] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:40:31] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:40:31] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 3 ms to minimize.
[2024-06-01 06:40:31] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:40:31] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:40:31] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:40:32] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:40:33] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 99/201 variables, 102/156 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:33] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:40:33] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:33] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:40:33] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 7/165 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:40:34] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 5/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 170 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4609 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 32/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 99/201 variables, 102/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 97/267 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 267 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5100 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 32/32 constraints]
After SMT, in 9724ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9724ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9935 ms. Remains : 102/102 places, 99/99 transitions.
Treatment of property ShieldIIPs-PT-004B-LTLFireability-05 finished in 78152 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((X(G(p0))&&G(p1))))'
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 222 transition count 198
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 202 transition count 198
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 40 place count 202 transition count 177
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 82 place count 181 transition count 177
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 173 transition count 169
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 173 transition count 169
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 98 place count 173 transition count 165
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 106 place count 169 transition count 165
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 232 place count 106 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 234 place count 104 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 235 place count 103 transition count 100
Applied a total of 235 rules in 14 ms. Remains 103 /223 variables (removed 120) and now considering 100/219 (removed 119) transitions.
// Phase 1: matrix 100 rows 103 cols
[2024-06-01 06:40:41] [INFO ] Computed 36 invariants in 1 ms
[2024-06-01 06:40:41] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 06:40:41] [INFO ] Invariant cache hit.
[2024-06-01 06:40:41] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-01 06:40:41] [INFO ] Redundant transitions in 16 ms returned [99]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 97 sub problems to find dead transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-06-01 06:40:41] [INFO ] Computed 36 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:41] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:40:41] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:40:41] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:40:41] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:40:41] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:40:42] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:42] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:40:42] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:40:42] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:40:42] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/149 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:43] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:40:43] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:40:43] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:40:43] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:40:43] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:40:43] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:40:43] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:43] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 157 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3433 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:45] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 97/255 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:46] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:48] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:50] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:51] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:56] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/202 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:40:57] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/202 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/202 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:04] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/202 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:41:07] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:41:08] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/202 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/202 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 202/202 variables, and 265 constraints, problems are : Problem set: 0 solved, 97 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 29/29 constraints]
After SMT, in 33456ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 33457ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/223 places, 99/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33669 ms. Remains : 103/223 places, 99/219 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-06
Product exploration explored 100000 steps with 405 reset in 292 ms.
Product exploration explored 100000 steps with 408 reset in 289 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 : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
RANDOM walk for 200 steps (0 resets) in 4 ms. (40 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 9 factoid took 271 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-06-01 06:41:16] [INFO ] Invariant cache hit.
[2024-06-01 06:41:16] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 06:41:16] [INFO ] Invariant cache hit.
[2024-06-01 06:41:16] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-06-01 06:41:16] [INFO ] Redundant transitions in 14 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 06:41:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:16] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:41:16] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:41:16] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
[2024-06-01 06:41:16] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:41:16] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:41:17] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:17] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:41:17] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:41:17] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:41:17] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/149 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:18] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:41:18] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:41:18] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:41:18] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:41:18] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2024-06-01 06:41:18] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:41:18] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:18] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:41:18] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:19] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:41:19] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:41:19] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/202 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 161 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4634 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 99/202 variables, 103/161 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 97/258 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:41:21] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:23] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 261 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5373 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 25/25 constraints]
After SMT, in 10020ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 10022ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10175 ms. Remains : 103/103 places, 99/99 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (AND p1 p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (AND p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 112 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
RANDOM walk for 105 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (AND p1 p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (AND p1 p0)))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 11 factoid took 251 ms. Reduced automaton from 3 states, 10 edges and 2 AP (stutter insensitive) to 3 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 409 reset in 214 ms.
Product exploration explored 100000 steps with 410 reset in 233 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-06-01 06:41:27] [INFO ] Invariant cache hit.
[2024-06-01 06:41:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 06:41:27] [INFO ] Invariant cache hit.
[2024-06-01 06:41:27] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-06-01 06:41:27] [INFO ] Redundant transitions in 20 ms returned []
Running 97 sub problems to find dead transitions.
[2024-06-01 06:41:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:28] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:41:28] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:41:28] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:41:28] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:41:28] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 1 ms to minimize.
[2024-06-01 06:41:28] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:28] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:41:28] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:41:29] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:41:29] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 99/202 variables, 103/149 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:29] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:41:29] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:41:29] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:41:29] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:41:29] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:41:29] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:41:29] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:30] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:41:30] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:31] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:41:31] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:41:31] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/202 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/202 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 161 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4437 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 22/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 99/202 variables, 103/161 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 97/258 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:33] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:41:33] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:41:34] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 261 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5313 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 25/25 constraints]
After SMT, in 9765ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9766ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9948 ms. Remains : 103/103 places, 99/99 transitions.
Treatment of property ShieldIIPs-PT-004B-LTLFireability-06 finished in 56518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 215 transition count 211
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 215 transition count 211
Applied a total of 16 rules in 3 ms. Remains 215 /223 variables (removed 8) and now considering 211/219 (removed 8) transitions.
// Phase 1: matrix 211 rows 215 cols
[2024-06-01 06:41:37] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 06:41:37] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 06:41:37] [INFO ] Invariant cache hit.
[2024-06-01 06:41:37] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-06-01 06:41:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:41:39] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:41:39] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:41:39] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:41:39] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:41:39] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:41:39] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:41:39] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:41:40] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:41:41] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:41:42] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:41:42] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:41:43] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:41:44] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:41:44] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:41:44] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:41:45] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:41:45] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:41:46] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (OVERLAPS) 211/426 variables, 215/314 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:41:48] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:41:48] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:41:48] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:41:48] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:41:48] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:41:48] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:41:48] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:41:49] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 19/333 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:41:51] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:41:51] [INFO ] Deduced a trap composed of 28 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:41:51] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:41:51] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:41:51] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 5/338 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:41:52] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:41:53] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:41:54] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:41:55] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:41:55] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:41:57] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:41:57] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:41:57] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:41:57] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:41:57] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 5/348 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:41:58] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:41:58] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:41:58] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:41:58] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:41:58] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:41:59] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:41:59] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:42:00] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:42:02] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:42:02] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:42:02] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:42:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:42:04] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 5/365 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:42:05] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:42:05] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:42:05] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:42:06] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/426 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 369 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 117/117 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 117/154 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:42:09] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 211/426 variables, 215/373 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 210/583 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:42:13] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:42:14] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:42:14] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:42:14] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:42:14] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:42:14] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:42:15] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:42:15] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:42:15] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:42:15] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:42:15] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-06-01 06:42:15] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:42:16] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:42:16] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:42:16] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:42:16] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:42:17] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:42:17] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 18/601 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:42:23] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:42:24] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:42:24] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:42:24] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:42:25] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 8/609 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:42:32] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:42:32] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:42:33] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:42:33] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:42:33] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 5/614 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 614 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 152/152 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 215/223 places, 211/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60259 ms. Remains : 215/223 places, 211/219 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-004B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004B-LTLFireability-07 finished in 60412 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(p0)||(!p1 U (p2||G(!p1)))))))))'
Support contains 4 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 214 transition count 210
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 214 transition count 210
Applied a total of 18 rules in 3 ms. Remains 214 /223 variables (removed 9) and now considering 210/219 (removed 9) transitions.
// Phase 1: matrix 210 rows 214 cols
[2024-06-01 06:42:38] [INFO ] Computed 37 invariants in 2 ms
[2024-06-01 06:42:38] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 06:42:38] [INFO ] Invariant cache hit.
[2024-06-01 06:42:38] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-06-01 06:42:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:42:39] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:42:40] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:42:41] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:42:42] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:42:43] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:42:43] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:42:43] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:42:43] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:42:44] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:42:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:42:46] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:42:48] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:42:49] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:42:49] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 210/424 variables, 214/320 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 17/337 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:42:53] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:42:54] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:42:56] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:42:57] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:42:57] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:42:57] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:42:57] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:42:57] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:42:57] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:42:57] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:42:58] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:42:59] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:43:00] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:43:00] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:03] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:43:03] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:03] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:43:04] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:43:04] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:43:04] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:43:04] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:43:04] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:05] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:43:05] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:43:05] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:43:05] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:43:06] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:43:06] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:43:06] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 7/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 391 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 140/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/424 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 209/600 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:11] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:43:12] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:43:12] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:43:12] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:43:13] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:43:13] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:43:13] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:43:14] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:43:14] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:18] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:43:19] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:43:19] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:43:19] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:43:19] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:43:19] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:43:20] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:43:20] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:43:20] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:43:20] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:26] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:43:27] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-06-01 06:43:27] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:43:27] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:34] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:43:34] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:43:35] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:43:35] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:43:35] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:43:35] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:43:36] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:43:36] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 8/631 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 631 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 171/171 constraints]
After SMT, in 60042ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60044ms
Starting structural reductions in LTL mode, iteration 1 : 214/223 places, 210/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60275 ms. Remains : 214/223 places, 210/219 transitions.
Stuttering acceptance computed with spot in 323 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-08
Product exploration explored 100000 steps with 20000 reset in 84 ms.
Product exploration explored 100000 steps with 20000 reset in 87 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 1886 steps (2 resets) in 8 ms. (209 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p2 (NOT p1))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p2))), (F p1), (F (NOT (OR p0 p1 p2))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 198 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 255 ms :[true, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 214 /214 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-06-01 06:43:40] [INFO ] Invariant cache hit.
[2024-06-01 06:43:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 06:43:40] [INFO ] Invariant cache hit.
[2024-06-01 06:43:40] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-06-01 06:43:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:41] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:43:41] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:43:42] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:43:44] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:43:44] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:43:44] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:43:44] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:43:44] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:43:44] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:43:44] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:43:44] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:43:44] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:45] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:43:45] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:43:45] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:43:45] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:43:45] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:43:46] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:43:46] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:43:46] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:43:46] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:43:46] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:43:46] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:43:46] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:43:46] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:47] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:43:47] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:43:47] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:43:47] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:43:47] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:43:47] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:43:47] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:43:47] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:48] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:49] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:43:50] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:43:50] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:43:50] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:50] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:43:51] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:43:51] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 210/424 variables, 214/320 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:53] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:43:53] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:43:53] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:43:53] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:43:53] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:43:53] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:43:54] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:43:55] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 17/337 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:56] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:43:56] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:43:56] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:43:56] [INFO ] Deduced a trap composed of 36 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:43:58] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:43:58] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:43:58] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:43:58] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:43:58] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:43:58] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:43:58] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 33 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:43:59] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:44:00] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:44:01] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:44:01] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:44:02] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:44:02] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:44:03] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:44:05] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:44:05] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:44:06] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:44:06] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:44:06] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:44:06] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:44:06] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:44:07] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:44:08] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:44:08] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:44:08] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:44:08] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:44:08] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:44:08] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:44:09] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 7/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 391 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 140/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/424 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 209/600 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:44:13] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:44:14] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:44:14] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:44:14] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:44:15] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:44:15] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:44:15] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:44:16] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:44:16] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:44:21] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:44:22] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:44:22] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:44:22] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:44:22] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:44:28] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:44:29] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:44:29] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:44:29] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:44:36] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:44:37] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:44:37] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:44:38] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:44:38] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:44:38] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:44:38] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:44:38] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 631 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 171/171 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Finished structural reductions in LTL mode , in 1 iterations and 60260 ms. Remains : 214/214 places, 210/210 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[true, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
RANDOM walk for 1297 steps (1 resets) in 15 ms. (81 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT (OR (NOT p1) p2))), (F p1), (F (NOT (OR p0 p1 p2))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 238 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[true, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 317 ms :[true, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 338 ms :[true, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 20000 reset in 77 ms.
Product exploration explored 100000 steps with 20000 reset in 93 ms.
Applying partial POR strategy [true, true, false, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 210/210 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 214 transition count 210
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 20 place count 214 transition count 212
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 29 place count 214 transition count 212
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 110 places in 1 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 110 place count 214 transition count 212
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 139 place count 185 transition count 183
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 168 place count 185 transition count 183
Deduced a syphon composed of 81 places in 0 ms
Applied a total of 168 rules in 23 ms. Remains 185 /214 variables (removed 29) and now considering 183/210 (removed 27) transitions.
[2024-06-01 06:44:42] [INFO ] Redundant transitions in 19 ms returned []
Running 182 sub problems to find dead transitions.
// Phase 1: matrix 183 rows 185 cols
[2024-06-01 06:44:42] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 06:44:42] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (OVERLAPS) 1/185 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-01 06:44:43] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 06:44:43] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 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 TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD176 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/57 constraints. Problems are: Problem set: 62 solved, 120 unsolved
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
[2024-06-01 06:44:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD77 is UNSAT
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD159 is UNSAT
[2024-06-01 06:44:45] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
Problem TDEAD170 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 18/75 constraints. Problems are: Problem set: 83 solved, 99 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/75 constraints. Problems are: Problem set: 83 solved, 99 unsolved
At refinement iteration 5 (OVERLAPS) 183/368 variables, 185/260 constraints. Problems are: Problem set: 83 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 4/264 constraints. Problems are: Problem set: 83 solved, 99 unsolved
[2024-06-01 06:44:46] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:44:46] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:44:46] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:44:47] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:44:47] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 5/269 constraints. Problems are: Problem set: 83 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/269 constraints. Problems are: Problem set: 83 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/269 constraints. Problems are: Problem set: 83 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 269 constraints, problems are : Problem set: 83 solved, 99 unsolved in 5969 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 185/185 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 83 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 83 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 82/185 variables, 37/37 constraints. Problems are: Problem set: 83 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 43/80 constraints. Problems are: Problem set: 83 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/80 constraints. Problems are: Problem set: 83 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 183/368 variables, 185/265 constraints. Problems are: Problem set: 83 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/368 variables, 4/269 constraints. Problems are: Problem set: 83 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 99/368 constraints. Problems are: Problem set: 83 solved, 99 unsolved
[2024-06-01 06:44:50] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:44:51] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:44:51] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:44:51] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 4/372 constraints. Problems are: Problem set: 83 solved, 99 unsolved
[2024-06-01 06:44:53] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:44:53] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:44:53] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:44:53] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:44:54] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 5/377 constraints. Problems are: Problem set: 83 solved, 99 unsolved
[2024-06-01 06:44:56] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:44:56] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 2/379 constraints. Problems are: Problem set: 83 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/379 constraints. Problems are: Problem set: 83 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 0/368 variables, 0/379 constraints. Problems are: Problem set: 83 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 379 constraints, problems are : Problem set: 83 solved, 99 unsolved in 16030 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 185/185 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 99/182 constraints, Known Traps: 54/54 constraints]
After SMT, in 22026ms problems are : Problem set: 83 solved, 99 unsolved
Search for dead transitions found 83 dead transitions in 22030ms
Found 83 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 83 transitions
Dead transitions reduction (with SMT) removed 83 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 185/214 places, 100/210 transitions.
Graph (complete) has 358 edges and 185 vertex of which 104 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.1 ms
Discarding 81 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 104 /185 variables (removed 81) and now considering 100/100 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/214 places, 100/210 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22092 ms. Remains : 104/214 places, 100/210 transitions.
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 214 /214 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 214 cols
[2024-06-01 06:45:04] [INFO ] Computed 37 invariants in 2 ms
[2024-06-01 06:45:04] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 06:45:04] [INFO ] Invariant cache hit.
[2024-06-01 06:45:05] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-06-01 06:45:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:06] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:45:06] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:45:06] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 2 ms to minimize.
[2024-06-01 06:45:06] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:45:06] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:45:06] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:45:06] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:45:06] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:45:07] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:45:07] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:45:07] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:45:07] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:45:07] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:45:07] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:45:07] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:45:07] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:45:07] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:45:07] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-06-01 06:45:07] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:45:07] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:07] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:45:08] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:45:08] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:45:08] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:45:08] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:45:08] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:45:08] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:45:08] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:45:08] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:45:08] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:45:08] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:45:08] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:45:08] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:45:08] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:45:08] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:45:09] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:45:09] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:45:09] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:45:09] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:45:09] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:45:10] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:45:11] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:45:12] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:45:12] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:45:12] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:45:12] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:45:12] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:45:12] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:13] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:14] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:45:14] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:45:14] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:45:15] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:15] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:45:15] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:45:15] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 210/424 variables, 214/320 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:18] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:45:18] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:45:18] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:45:18] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:45:18] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:45:18] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:45:18] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:45:19] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 17/337 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:20] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:45:20] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:45:21] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:45:21] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:22] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:45:23] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:45:24] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:45:24] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:45:24] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:45:24] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:45:24] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:45:24] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:24] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:45:25] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:45:25] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:45:25] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:45:25] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:45:25] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:45:25] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:45:25] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:45:25] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:45:25] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:45:25] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:45:25] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:26] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:45:27] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:45:27] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:30] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:45:30] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:30] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:45:31] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:45:31] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:45:31] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:45:31] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:45:31] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:32] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:45:32] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:45:32] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:45:32] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:45:33] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:45:33] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:45:33] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 7/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 391 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 140/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/424 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 209/600 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:38] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:45:39] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:45:39] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:45:39] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:45:40] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:45:40] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:45:40] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:45:40] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:45:40] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:45:47] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:45:47] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:45:47] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:45:53] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:45:53] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:45:53] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:45:54] [INFO ] Deduced a trap composed of 28 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:01] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:46:01] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:46:02] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:46:02] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:46:02] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:46:02] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:46:02] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:46:02] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 8/631 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 631 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 171/171 constraints]
After SMT, in 60040ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Finished structural reductions in LTL mode , in 1 iterations and 60308 ms. Remains : 214/214 places, 210/210 transitions.
Treatment of property ShieldIIPs-PT-004B-LTLFireability-08 finished in 206941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(p1))))))'
Support contains 4 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 214 transition count 210
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 214 transition count 210
Applied a total of 18 rules in 9 ms. Remains 214 /223 variables (removed 9) and now considering 210/219 (removed 9) transitions.
[2024-06-01 06:46:05] [INFO ] Invariant cache hit.
[2024-06-01 06:46:05] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 06:46:05] [INFO ] Invariant cache hit.
[2024-06-01 06:46:05] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-06-01 06:46:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:06] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:46:06] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:46:07] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:46:08] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:46:09] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:46:09] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:46:09] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:46:09] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:46:09] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:46:09] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:46:09] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:46:09] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:46:09] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:46:09] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:10] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:46:10] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:46:10] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:46:10] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:46:10] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:46:11] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:46:11] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:46:11] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:46:11] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:46:11] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:46:11] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:46:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:46:11] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:12] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:46:12] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:46:12] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:46:12] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:46:12] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:46:12] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:46:12] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:46:12] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:13] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:14] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:46:15] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:46:15] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:46:15] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:15] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:46:16] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:46:16] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 210/424 variables, 214/320 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:46:20] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 17/337 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:20] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:46:21] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:46:21] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:46:21] [INFO ] Deduced a trap composed of 36 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:26] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:46:27] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:46:27] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:30] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:46:30] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:30] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:46:31] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:46:31] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:46:31] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:46:31] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:46:31] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:32] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:46:32] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:46:32] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:46:32] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:46:32] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:46:33] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:46:33] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 7/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 391 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 140/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/424 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 209/600 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:38] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:46:39] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-06-01 06:46:39] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:46:39] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:46:40] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:46:40] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:46:40] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:46:41] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:46:41] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:46] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-06-01 06:46:46] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:46:46] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:46:46] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:46:46] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:46:46] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:46:47] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:46:53] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-06-01 06:46:54] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:46:54] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:46:54] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 8/631 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 631 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 171/171 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 214/223 places, 210/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60284 ms. Remains : 214/223 places, 210/219 transitions.
Stuttering acceptance computed with spot in 178 ms :[(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 : ShieldIIPs-PT-004B-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 84 ms.
Product exploration explored 100000 steps with 25000 reset in 85 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4103 steps (5 resets) in 15 ms. (256 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(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 148 ms :[(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 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 214 /214 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-06-01 06:47:06] [INFO ] Invariant cache hit.
[2024-06-01 06:47:06] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 06:47:06] [INFO ] Invariant cache hit.
[2024-06-01 06:47:06] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-06-01 06:47:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:08] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:47:08] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:47:08] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:47:08] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:47:08] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:47:08] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:47:08] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:47:08] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:47:08] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:47:08] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:47:11] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:47:11] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:12] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:47:12] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:47:12] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:47:12] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:47:12] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:47:12] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:47:12] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-06-01 06:47:12] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:47:12] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:47:12] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:47:12] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:47:12] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:47:13] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:13] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:47:13] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:47:13] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:47:13] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:47:13] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:47:14] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:47:14] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:47:14] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:15] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:16] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:47:16] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:47:16] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:47:16] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:17] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:47:17] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:47:17] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 210/424 variables, 214/320 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:47:20] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:47:21] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 17/337 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:22] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:47:22] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:47:23] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:47:23] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:47:25] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:26] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:47:27] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:29] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:47:29] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:47:29] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:32] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:47:32] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:32] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:47:33] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:47:33] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:47:33] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:47:33] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:47:33] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:34] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:47:34] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:47:34] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:47:35] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:47:35] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:47:35] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:47:35] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
(s121 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 7/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 391 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 140/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/424 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 209/600 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:40] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:47:41] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:47:41] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:47:41] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:47:42] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:47:42] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:47:42] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:47:42] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:47:42] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:47] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:47:47] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:47:47] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:47:47] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:47:48] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:47:48] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:47:48] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:47:48] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:47:49] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:47:49] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:47:54] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-06-01 06:47:55] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:47:55] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:47:55] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:02] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:48:03] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:48:03] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:48:04] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:48:04] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:48:04] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:48:04] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:48:04] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 8/631 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 631 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 171/171 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Finished structural reductions in LTL mode , in 1 iterations and 60267 ms. Remains : 214/214 places, 210/210 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3451 steps (4 resets) in 19 ms. (172 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(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 132 ms :[(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 124 ms :[(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 25000 reset in 85 ms.
Product exploration explored 100000 steps with 25000 reset in 85 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 122 ms :[(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 214 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 214/214 places, 210/210 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 214 transition count 210
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 19 place count 214 transition count 212
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 28 place count 214 transition count 212
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 1 with 82 rules applied. Total rules applied 110 place count 214 transition count 212
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 137 place count 187 transition count 185
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 164 place count 187 transition count 185
Deduced a syphon composed of 83 places in 0 ms
Applied a total of 164 rules in 19 ms. Remains 187 /214 variables (removed 27) and now considering 185/210 (removed 25) transitions.
[2024-06-01 06:48:08] [INFO ] Redundant transitions in 18 ms returned [184]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 183 sub problems to find dead transitions.
// Phase 1: matrix 184 rows 187 cols
[2024-06-01 06:48:08] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 06:48:08] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
[2024-06-01 06:48:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 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 TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 20/57 constraints. Problems are: Problem set: 62 solved, 121 unsolved
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD63 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD104 is UNSAT
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
[2024-06-01 06:48:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD180 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 14/71 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/71 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 184/371 variables, 187/258 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 3/261 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/261 constraints. Problems are: Problem set: 85 solved, 98 unsolved
[2024-06-01 06:48:12] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:48:12] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/371 variables, 2/263 constraints. Problems are: Problem set: 85 solved, 98 unsolved
[2024-06-01 06:48:12] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:48:12] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:48:13] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 3/266 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/266 constraints. Problems are: Problem set: 85 solved, 98 unsolved
[2024-06-01 06:48:14] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:48:14] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/371 variables, 2/268 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/371 variables, 0/268 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 13 (OVERLAPS) 0/371 variables, 0/268 constraints. Problems are: Problem set: 85 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 268 constraints, problems are : Problem set: 85 solved, 98 unsolved in 8389 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 187/187 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 85 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 84/187 variables, 37/37 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 41/78 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/78 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 184/371 variables, 187/265 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 3/268 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 98/366 constraints. Problems are: Problem set: 85 solved, 98 unsolved
[2024-06-01 06:48:17] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:48:18] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:48:18] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 3/369 constraints. Problems are: Problem set: 85 solved, 98 unsolved
[2024-06-01 06:48:19] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:48:19] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 2/371 constraints. Problems are: Problem set: 85 solved, 98 unsolved
[2024-06-01 06:48:22] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/372 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/372 constraints. Problems are: Problem set: 85 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/371 variables, 0/372 constraints. Problems are: Problem set: 85 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 372 constraints, problems are : Problem set: 85 solved, 98 unsolved in 10170 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 187/187 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 98/183 constraints, Known Traps: 47/47 constraints]
After SMT, in 18586ms problems are : Problem set: 85 solved, 98 unsolved
Search for dead transitions found 85 dead transitions in 18588ms
Found 85 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 85 transitions
Dead transitions reduction (with SMT) removed 85 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 187/214 places, 99/210 transitions.
Graph (complete) has 353 edges and 187 vertex of which 104 are kept as prefixes of interest. Removing 83 places using SCC suffix rule.1 ms
Discarding 83 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 104 /187 variables (removed 83) and now considering 99/99 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/214 places, 99/210 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18644 ms. Remains : 104/214 places, 99/210 transitions.
Support contains 4 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 214 /214 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 214 cols
[2024-06-01 06:48:26] [INFO ] Computed 37 invariants in 3 ms
[2024-06-01 06:48:26] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 06:48:26] [INFO ] Invariant cache hit.
[2024-06-01 06:48:26] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-06-01 06:48:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:28] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:48:28] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:48:28] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:48:28] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-06-01 06:48:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:48:28] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:48:28] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:48:28] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:29] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:48:30] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:48:31] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:48:31] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:48:31] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:48:31] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:48:31] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:32] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:48:32] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:48:32] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:48:32] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:48:32] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:48:32] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:48:32] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:48:32] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:48:33] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:48:33] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:48:33] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:48:33] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:48:33] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:33] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-06-01 06:48:33] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:48:34] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:48:34] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:48:34] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:48:34] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:48:34] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:48:34] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 8/98 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:35] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:36] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:48:36] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:48:36] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:48:37] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:37] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-06-01 06:48:37] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:48:38] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 210/424 variables, 214/320 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:40] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:48:40] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:48:40] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:48:40] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:48:40] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:48:40] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:48:40] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:48:41] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:48:41] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:48:41] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:48:41] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:48:41] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:48:41] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:48:41] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:48:41] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:48:41] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:48:41] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 17/337 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:42] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:48:42] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:48:43] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:48:43] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:45] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:48:45] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:48:45] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:48:45] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:48:45] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:48:45] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:48:45] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:48:45] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:48:45] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:48:45] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:48:45] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:48:45] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:48:45] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:48:46] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:48:46] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:48:46] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:48:46] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:48:46] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:48:46] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:48:46] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/424 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:46] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:48:47] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:48:47] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:48:47] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:48:47] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:48:47] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:48:47] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:48:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:48:47] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:48:47] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:48:47] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:48:47] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/424 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:49] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:48:49] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:48:49] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/424 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:52] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:48:52] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/424 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:52] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:48:53] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:48:53] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:48:53] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:48:53] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:48:53] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/424 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:48:54] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:48:54] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:48:55] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:48:55] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:48:55] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:48:55] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:48:55] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/424 variables, 7/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/424 variables, and 391 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 140/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/214 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/424 variables, 214/391 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 209/600 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:49:00] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:49:01] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:49:01] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:49:01] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:49:02] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:49:02] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-06-01 06:49:02] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:49:02] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:49:02] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 9/609 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:49:07] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:49:07] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:49:07] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:49:07] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:49:08] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:49:08] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:49:08] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:49:09] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:49:09] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:49:09] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:49:14] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:49:15] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:49:15] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:49:16] [INFO ] Deduced a trap composed of 28 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-06-01 06:49:22] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:49:23] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:49:23] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:49:24] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:49:24] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:49:24] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:49:24] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:49:24] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 8/631 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 424/424 variables, and 631 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 171/171 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Finished structural reductions in LTL mode , in 1 iterations and 60282 ms. Remains : 214/214 places, 210/210 transitions.
Treatment of property ShieldIIPs-PT-004B-LTLFireability-09 finished in 201907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 222 transition count 199
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 203 transition count 199
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 38 place count 203 transition count 178
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 80 place count 182 transition count 178
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 88 place count 174 transition count 170
Iterating global reduction 2 with 8 rules applied. Total rules applied 96 place count 174 transition count 170
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 96 place count 174 transition count 166
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 104 place count 170 transition count 166
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 234 place count 105 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 104 transition count 100
Applied a total of 235 rules in 18 ms. Remains 104 /223 variables (removed 119) and now considering 100/219 (removed 119) transitions.
// Phase 1: matrix 100 rows 104 cols
[2024-06-01 06:49:27] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 06:49:27] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 06:49:27] [INFO ] Invariant cache hit.
[2024-06-01 06:49:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 06:49:27] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-06-01 06:49:27] [INFO ] Redundant transitions in 17 ms returned [99]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 98 sub problems to find dead transitions.
// Phase 1: matrix 99 rows 104 cols
[2024-06-01 06:49:27] [INFO ] Computed 37 invariants in 0 ms
[2024-06-01 06:49:27] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 1/104 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:49:28] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:49:29] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 99/203 variables, 104/163 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/203 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 166 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3247 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/203 variables, 104/163 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 98/264 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:49:31] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:49:31] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:49:31] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/203 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 267 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3848 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 25/25 constraints]
After SMT, in 7110ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7112ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/223 places, 99/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7295 ms. Remains : 104/223 places, 99/219 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-10
Product exploration explored 100000 steps with 431 reset in 199 ms.
Product exploration explored 100000 steps with 429 reset in 219 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/104 stabilizing places and 4/99 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 263 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 12 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 427 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-06-01 06:49:35] [INFO ] Invariant cache hit.
[2024-06-01 06:49:35] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 06:49:35] [INFO ] Invariant cache hit.
[2024-06-01 06:49:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 06:49:35] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-01 06:49:35] [INFO ] Redundant transitions in 20 ms returned []
Running 98 sub problems to find dead transitions.
[2024-06-01 06:49:35] [INFO ] Invariant cache hit.
[2024-06-01 06:49:35] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:49:36] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 1/104 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:49:37] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:49:37] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:49:37] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:49:37] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:49:37] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:49:37] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:49:37] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:49:37] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 99/203 variables, 104/162 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/203 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 165 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3272 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/203 variables, 104/162 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 98/263 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 263 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2812 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 21/21 constraints]
After SMT, in 6098ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6100ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6292 ms. Remains : 104/104 places, 99/99 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/104 stabilizing places and 4/99 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 192 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 461 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 429 reset in 210 ms.
Product exploration explored 100000 steps with 430 reset in 222 ms.
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-06-01 06:49:43] [INFO ] Invariant cache hit.
[2024-06-01 06:49:43] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-01 06:49:43] [INFO ] Invariant cache hit.
[2024-06-01 06:49:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 06:49:43] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-06-01 06:49:43] [INFO ] Redundant transitions in 20 ms returned []
Running 98 sub problems to find dead transitions.
[2024-06-01 06:49:43] [INFO ] Invariant cache hit.
[2024-06-01 06:49:43] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:49:43] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:49:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:49:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:49:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:49:44] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:49:44] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:49:44] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:49:44] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:49:44] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:49:44] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:49:44] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:49:44] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:49:44] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 1/104 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:49:45] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:49:45] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:49:45] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:49:45] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:49:45] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:49:45] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:49:45] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:49:45] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 99/203 variables, 104/162 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/203 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 165 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3192 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 99/203 variables, 104/162 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 98/263 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 263 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2891 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 104/104 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 21/21 constraints]
After SMT, in 6104ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 6105ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6279 ms. Remains : 104/104 places, 99/99 transitions.
Treatment of property ShieldIIPs-PT-004B-LTLFireability-10 finished in 22761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 222 transition count 199
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 203 transition count 199
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 38 place count 203 transition count 179
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 78 place count 183 transition count 179
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 174 transition count 170
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 174 transition count 170
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 96 place count 174 transition count 165
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 106 place count 169 transition count 165
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 236 place count 104 transition count 100
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 238 place count 102 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 101 transition count 98
Applied a total of 239 rules in 16 ms. Remains 101 /223 variables (removed 122) and now considering 98/219 (removed 121) transitions.
// Phase 1: matrix 98 rows 101 cols
[2024-06-01 06:49:49] [INFO ] Computed 36 invariants in 0 ms
[2024-06-01 06:49:49] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 06:49:49] [INFO ] Invariant cache hit.
[2024-06-01 06:49:49] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-06-01 06:49:49] [INFO ] Redundant transitions in 15 ms returned [97]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-06-01 06:49:49] [INFO ] Computed 36 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:49:50] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:49:51] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:49:51] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 97/198 variables, 101/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:49:52] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:49:52] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:49:52] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:49:52] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:49:52] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:49:53] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:49:53] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:49:53] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/198 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:49:54] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:49:54] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/198 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 16 (OVERLAPS) 0/198 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 164 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5642 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 97/198 variables, 101/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 95/259 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:49:56] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:49:58] [INFO ] Deduced a trap composed of 8 places in 13 ms of which 1 ms to minimize.
[2024-06-01 06:49:58] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/198 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 262 constraints, problems are : Problem set: 0 solved, 95 unsolved in 9021 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 30/30 constraints]
After SMT, in 14680ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 14682ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/223 places, 97/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14881 ms. Remains : 101/223 places, 97/219 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-11
Product exploration explored 100000 steps with 4386 reset in 177 ms.
Product exploration explored 100000 steps with 4359 reset in 185 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 241 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-06-01 06:50:05] [INFO ] Invariant cache hit.
[2024-06-01 06:50:05] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-06-01 06:50:05] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-01 06:50:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:50:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 06:50:05] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-01 06:50:05] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:50:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-06-01 06:50:05] [INFO ] Computed and/alt/rep : 95/231/95 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:50:06] [INFO ] Added : 81 causal constraints over 17 iterations in 169 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-06-01 06:50:06] [INFO ] Invariant cache hit.
[2024-06-01 06:50:06] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 06:50:06] [INFO ] Invariant cache hit.
[2024-06-01 06:50:06] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-06-01 06:50:06] [INFO ] Redundant transitions in 15 ms returned []
Running 95 sub problems to find dead transitions.
[2024-06-01 06:50:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:50:06] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:50:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:07] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:07] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:50:07] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 97/198 variables, 101/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:08] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:08] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:50:08] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:50:08] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:09] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:50:09] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:50:09] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:09] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:09] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:50:10] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:50:10] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 14 (OVERLAPS) 0/198 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 165 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4892 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:11] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 97/198 variables, 101/166 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 95/261 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 261 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2732 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 29/29 constraints]
After SMT, in 7652ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 7655ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7807 ms. Remains : 101/101 places, 97/97 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 211 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-06-01 06:50:14] [INFO ] Invariant cache hit.
[2024-06-01 06:50:14] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 06:50:14] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-06-01 06:50:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:50:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 06:50:14] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-06-01 06:50:14] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:50:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-06-01 06:50:14] [INFO ] Computed and/alt/rep : 95/231/95 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 06:50:14] [INFO ] Added : 81 causal constraints over 17 iterations in 174 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4390 reset in 165 ms.
Product exploration explored 100000 steps with 4432 reset in 186 ms.
Support contains 1 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-06-01 06:50:15] [INFO ] Invariant cache hit.
[2024-06-01 06:50:15] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 06:50:15] [INFO ] Invariant cache hit.
[2024-06-01 06:50:15] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-06-01 06:50:15] [INFO ] Redundant transitions in 16 ms returned []
Running 95 sub problems to find dead transitions.
[2024-06-01 06:50:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:50:15] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:50:16] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:50:16] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:50:16] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:50:16] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:50:16] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:16] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:16] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:50:16] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 97/198 variables, 101/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:17] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:17] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:50:17] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:50:18] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:18] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:50:18] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:50:18] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:18] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:19] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:50:19] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:50:19] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 14 (OVERLAPS) 0/198 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 165 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4868 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:50:20] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 97/198 variables, 101/166 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 95/261 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 261 constraints, problems are : Problem set: 0 solved, 95 unsolved in 2794 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 29/29 constraints]
After SMT, in 7680ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 7682ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7846 ms. Remains : 101/101 places, 97/97 transitions.
Treatment of property ShieldIIPs-PT-004B-LTLFireability-11 finished in 33440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U (p1&&G(F(p2)))))'
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 215 transition count 211
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 215 transition count 211
Applied a total of 16 rules in 5 ms. Remains 215 /223 variables (removed 8) and now considering 211/219 (removed 8) transitions.
// Phase 1: matrix 211 rows 215 cols
[2024-06-01 06:50:23] [INFO ] Computed 37 invariants in 2 ms
[2024-06-01 06:50:23] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 06:50:23] [INFO ] Invariant cache hit.
[2024-06-01 06:50:23] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-06-01 06:50:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:24] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:50:25] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:50:26] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-06-01 06:50:27] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:50:28] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:50:29] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 17/94 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:30] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:50:30] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:50:30] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:31] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:50:31] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:50:31] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:33] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:50:33] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:50:33] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 211/426 variables, 215/318 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:35] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:50:35] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:50:36] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:50:37] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:50:37] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:50:37] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:50:37] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:50:37] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:50:37] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:50:37] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:50:37] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 19/337 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:37] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:50:37] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:50:37] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:50:37] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:50:38] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:50:38] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:50:38] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:50:38] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:50:38] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:50:38] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:50:39] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:50:39] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 12/349 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:39] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:50:39] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:50:40] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:50:40] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:50:40] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:50:40] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:50:40] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:43] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:50:43] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:50:43] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:50:43] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:50:43] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:50:43] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:50:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:50:44] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 8/364 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:44] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:50:45] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:50:45] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:50:45] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:50:45] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:50:45] [INFO ] Deduced a trap composed of 37 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:50:45] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:50:45] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:50:45] [INFO ] Deduced a trap composed of 45 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/426 variables, 10/374 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:50:46] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:50:47] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 13/387 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:49] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:50:50] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:50:50] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:50:50] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:50:50] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:50:50] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 6/393 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:51] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:50:51] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:50:51] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:50:51] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:50:51] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:50:51] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:50:52] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:50:52] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:50:52] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 3 ms to minimize.
[2024-06-01 06:50:52] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:50:52] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:50:52] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 12/405 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 405 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 153/153 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 153/190 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/426 variables, 215/405 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 210/615 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:50:57] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-06-01 06:50:57] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:50:58] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:50:59] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:51:00] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:51:00] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:51:00] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 20/635 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:51:04] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:51:04] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-06-01 06:51:04] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:51:04] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:51:04] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:51:05] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:51:05] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:51:05] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 8/643 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:51:10] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:51:10] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:51:10] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:51:11] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:51:11] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:51:11] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:51:11] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:51:11] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:51:11] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:51:11] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:51:12] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:51:12] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:51:13] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 13/656 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:51:17] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:51:19] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-06-01 06:51:19] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-06-01 06:51:19] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:51:19] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:51:20] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:51:21] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 7/663 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 663 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 201/201 constraints]
After SMT, in 60043ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60045ms
Starting structural reductions in LTL mode, iteration 1 : 215/223 places, 211/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60284 ms. Remains : 215/223 places, 211/219 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p2), true]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-004B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004B-LTLFireability-12 finished in 60478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||X((p1&&X(p2))))))))'
Support contains 3 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 216 transition count 212
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 216 transition count 212
Applied a total of 14 rules in 8 ms. Remains 216 /223 variables (removed 7) and now considering 212/219 (removed 7) transitions.
// Phase 1: matrix 212 rows 216 cols
[2024-06-01 06:51:23] [INFO ] Computed 37 invariants in 3 ms
[2024-06-01 06:51:23] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 06:51:23] [INFO ] Invariant cache hit.
[2024-06-01 06:51:23] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-06-01 06:51:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:51:25] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:51:25] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:51:25] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:51:25] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:51:25] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:51:25] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:51:25] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:51:26] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:51:26] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:51:26] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:51:26] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:51:26] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-06-01 06:51:26] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:51:26] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:51:26] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:51:26] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:51:26] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-06-01 06:51:26] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:51:26] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:51:26] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:51:27] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:51:28] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:51:28] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:51:28] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:51:28] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:51:29] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:51:30] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:51:30] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:51:30] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:51:30] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:51:30] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:51:30] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:51:30] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 18/95 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:51:31] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:51:31] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:51:31] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:51:31] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:51:31] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:51:31] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:51:31] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:51:31] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:51:31] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 9/104 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (OVERLAPS) 212/428 variables, 216/320 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:51:34] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:51:34] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:51:34] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:51:34] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:51:34] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 37 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 13/333 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:51:35] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:51:36] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:51:36] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:51:36] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:51:36] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2024-06-01 06:51:36] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:51:36] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:51:37] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:51:37] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:51:37] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:51:38] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:51:38] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:51:38] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 13/346 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:51:43] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:51:44] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:51:44] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:51:44] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:51:44] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-06-01 06:51:44] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:51:44] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:51:44] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:51:44] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:51:44] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:51:44] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:51:44] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 20/366 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:51:44] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:51:45] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:51:46] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:51:48] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:51:49] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:51:49] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:51:49] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:51:49] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/428 variables, 5/374 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:51:51] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/428 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:51:52] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/428 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/428 variables, and 376 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 123/123 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 123/160 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:51:55] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:51:55] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:51:55] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:51:55] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:51:56] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:51:56] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 2/166 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 212/428 variables, 216/382 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 211/593 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:52:00] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-06-01 06:52:00] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:52:00] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-06-01 06:52:00] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-01 06:52:01] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:52:01] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:52:01] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:52:01] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:52:01] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:52:02] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:52:02] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:52:03] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/428 variables, 12/605 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:52:07] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-01 06:52:08] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:52:08] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:52:08] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:52:08] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:52:09] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:52:09] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:52:09] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:52:09] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:52:09] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:52:10] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 11/616 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-01 06:52:16] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:52:16] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-01 06:52:16] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-01 06:52:17] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 06:52:17] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:52:17] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:52:17] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:52:18] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:52:18] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:52:18] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:52:19] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:52:19] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:52:19] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 13/629 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 629 constraints, problems are : Problem set: 0 solved, 211 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 165/165 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 60047ms
Starting structural reductions in LTL mode, iteration 1 : 216/223 places, 212/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60272 ms. Remains : 216/223 places, 212/219 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-13
Stuttering criterion allowed to conclude after 562 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-004B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004B-LTLFireability-13 finished in 60502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!(F(X(!X(p0))) U p1)||p2))))'
Support contains 6 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 222 transition count 199
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 203 transition count 199
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 38 place count 203 transition count 178
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 80 place count 182 transition count 178
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 89 place count 173 transition count 169
Iterating global reduction 2 with 9 rules applied. Total rules applied 98 place count 173 transition count 169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 98 place count 173 transition count 166
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 104 place count 170 transition count 166
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 226 place count 109 transition count 105
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 228 place count 107 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 229 place count 106 transition count 103
Applied a total of 229 rules in 19 ms. Remains 106 /223 variables (removed 117) and now considering 103/219 (removed 116) transitions.
// Phase 1: matrix 103 rows 106 cols
[2024-06-01 06:52:24] [INFO ] Computed 36 invariants in 1 ms
[2024-06-01 06:52:24] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 06:52:24] [INFO ] Invariant cache hit.
[2024-06-01 06:52:24] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-06-01 06:52:24] [INFO ] Redundant transitions in 17 ms returned [102]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 98 sub problems to find dead transitions.
// Phase 1: matrix 102 rows 106 cols
[2024-06-01 06:52:24] [INFO ] Computed 36 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:24] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:52:24] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:52:24] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:52:24] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:52:24] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:52:24] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:52:24] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:24] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 4/106 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:52:25] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:26] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:26] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 102/208 variables, 106/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:27] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:52:27] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:52:27] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:52:27] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:52:27] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:52:27] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:52:27] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:52:27] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 8/167 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:27] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:52:27] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:52:27] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:52:27] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 4/171 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:28] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:28] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:29] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/208 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/208 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 174 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5905 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 4/106 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 102/208 variables, 106/174 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 98/272 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:31] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:52:31] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:52:31] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:52:31] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:52:31] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 277 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4172 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 37/37 constraints]
After SMT, in 10091ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 10092ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/223 places, 102/219 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10284 ms. Remains : 106/223 places, 102/219 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-14
Product exploration explored 100000 steps with 376 reset in 201 ms.
Product exploration explored 100000 steps with 378 reset in 227 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/106 stabilizing places and 3/102 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p2 (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) p0) (AND p2 p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
Knowledge based reduction with 13 factoid took 551 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), false]
RANDOM walk for 40000 steps (147 resets) in 222 ms. (179 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40003 steps (30 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (30 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
[2024-06-01 06:52:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
After SMT solving in domain Real declared 35/208 variables, and 11 constraints, problems are : Problem set: 2 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 11/36 constraints, State Equation: 0/106 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 33ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p2 (NOT p0)))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) p0) (AND p2 p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (NOT (AND (OR p1 (NOT p0)) (OR (NOT p2) (NOT p0))))), (F (NOT (AND (OR (NOT p1) p2) (OR (NOT p2) p0)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p2), (F p0), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (AND (OR (NOT p1) p2) (OR (NOT p1) p0)))), (F p1)]
Knowledge based reduction with 15 factoid took 678 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p1]
Stuttering acceptance computed with spot in 29 ms :[p1]
Support contains 3 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-06-01 06:52:36] [INFO ] Invariant cache hit.
[2024-06-01 06:52:36] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 06:52:36] [INFO ] Invariant cache hit.
[2024-06-01 06:52:36] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2024-06-01 06:52:36] [INFO ] Redundant transitions in 16 ms returned []
Running 98 sub problems to find dead transitions.
[2024-06-01 06:52:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:37] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:52:37] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:52:37] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:52:37] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:52:37] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:52:37] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 1 ms to minimize.
[2024-06-01 06:52:37] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:37] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 4/106 variables, 13/44 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:38] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:52:38] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:52:38] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:52:38] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:52:38] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:52:38] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:52:38] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:38] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 102/208 variables, 106/158 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:39] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:52:39] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:52:39] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 161 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3530 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 4/106 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 102/208 variables, 106/161 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 98/259 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:41] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 06:52:43] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:52:43] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/208 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 262 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6136 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 22/22 constraints]
After SMT, in 9678ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 9681ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9848 ms. Remains : 106/106 places, 102/102 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[p1]
RANDOM walk for 399 steps (0 resets) in 5 ms. (66 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[p1]
Stuttering acceptance computed with spot in 23 ms :[p1]
Stuttering acceptance computed with spot in 38 ms :[p1]
Product exploration explored 100000 steps with 377 reset in 200 ms.
Product exploration explored 100000 steps with 379 reset in 220 ms.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 102/102 transitions.
Reduce places removed 2 places and 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 104 transition count 99
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 101 transition count 97
Applied a total of 5 rules in 5 ms. Remains 101 /106 variables (removed 5) and now considering 97/102 (removed 5) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-06-01 06:52:47] [INFO ] Computed 36 invariants in 1 ms
[2024-06-01 06:52:47] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 06:52:47] [INFO ] Invariant cache hit.
[2024-06-01 06:52:47] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-06-01 06:52:47] [INFO ] Redundant transitions in 16 ms returned []
Running 95 sub problems to find dead transitions.
[2024-06-01 06:52:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:52:47] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:52:47] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:52:47] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:52:47] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:52:47] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:52:47] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:52:48] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:52:48] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:52:48] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:52:48] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:52:48] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:52:48] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 2/101 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:52:48] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:52:49] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 97/198 variables, 101/151 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:52:49] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:52:49] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:52:49] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:52:50] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:52:50] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:52:51] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:52:51] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:52:51] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-06-01 06:52:51] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:52:51] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/198 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/198 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 15 (OVERLAPS) 0/198 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 161 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5133 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (OVERLAPS) 2/101 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 97/198 variables, 101/161 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 95/256 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-06-01 06:52:53] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 257 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4108 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 25/25 constraints]
After SMT, in 9254ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 9255ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/106 places, 97/102 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9430 ms. Remains : 101/106 places, 97/102 transitions.
Treatment of property ShieldIIPs-PT-004B-LTLFireability-14 finished in 32667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p0&&F((p0||X(p0))))||G(F(p0))))))'
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 215 transition count 211
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 215 transition count 211
Applied a total of 16 rules in 7 ms. Remains 215 /223 variables (removed 8) and now considering 211/219 (removed 8) transitions.
// Phase 1: matrix 211 rows 215 cols
[2024-06-01 06:52:56] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 06:52:56] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 06:52:56] [INFO ] Invariant cache hit.
[2024-06-01 06:52:57] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-06-01 06:52:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:52:58] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:52:58] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:52:58] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:52:58] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:52:58] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:52:59] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:53:00] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:53:01] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:53:02] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:53:03] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:53:03] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:53:03] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:53:03] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 18/95 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:03] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:53:03] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:53:04] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:53:04] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 211/426 variables, 215/314 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:06] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:53:06] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:53:06] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:53:06] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:53:06] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:53:06] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:53:06] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:53:07] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:53:07] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:53:07] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:53:07] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:53:07] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:53:07] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 13/327 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:08] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:53:08] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:53:08] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:53:08] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:53:08] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:53:09] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:53:09] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:53:09] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:53:09] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:53:09] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:53:09] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:53:09] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:53:09] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:53:09] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:53:09] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:53:09] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:53:09] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:53:10] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:53:10] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 19/346 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:11] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:53:12] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:53:13] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:53:13] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:53:13] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:53:13] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:53:13] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 18/364 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:14] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:53:14] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:53:15] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:53:15] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:16] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:53:16] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:53:16] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:19] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:53:19] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:53:19] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:53:19] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:53:19] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:53:19] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:53:20] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/426 variables, 16/387 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:22] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:53:22] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:23] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:53:23] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:53:24] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:53:24] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:25] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:53:25] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:53:26] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)timeout

(s173 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 396 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 144/144 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 144/181 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:28] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:53:28] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:53:28] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:53:28] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:53:28] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:53:28] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:53:28] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:53:29] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:53:29] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:53:29] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 10/191 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:29] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:53:30] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:30] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-06-01 06:53:30] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:53:30] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:53:31] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:53:31] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 5/198 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:31] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:53:32] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 35 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:53:33] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:53:34] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:53:34] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 17/217 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:35] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:35] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:53:35] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:53:35] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:53:35] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:53:36] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:53:36] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:53:36] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:53:36] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:53:36] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:53:36] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:53:36] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:53:36] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:37] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:53:37] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:53:37] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:53:37] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:53:37] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:53:37] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:38] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:53:38] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:39] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 14 (OVERLAPS) 211/426 variables, 215/454 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 210/664 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:43] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:53:43] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 06:53:44] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:53:44] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:53:44] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:53:44] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-01 06:53:45] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:53:45] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:53:45] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 9/673 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:53:51] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:53:51] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2024-06-01 06:53:52] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:53:52] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 4/677 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 677 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 215/215 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 215/223 places, 211/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60278 ms. Remains : 215/223 places, 211/219 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-15
Product exploration explored 100000 steps with 6270 reset in 112 ms.
Product exploration explored 100000 steps with 6122 reset in 122 ms.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Detected a total of 48/215 stabilizing places and 48/211 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 39 steps (0 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 06:53:58] [INFO ] Invariant cache hit.
[2024-06-01 06:53:58] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-06-01 06:53:58] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-06-01 06:53:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:53:58] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-06-01 06:53:58] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-06-01 06:53:58] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-06-01 06:53:58] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:53:58] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:53:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 144 ms
[2024-06-01 06:53:58] [INFO ] Computed and/alt/rep : 210/471/210 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 06:53:59] [INFO ] Added : 194 causal constraints over 43 iterations in 1194 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 211/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 215 /215 variables (removed 0) and now considering 211/211 (removed 0) transitions.
[2024-06-01 06:53:59] [INFO ] Invariant cache hit.
[2024-06-01 06:53:59] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 06:53:59] [INFO ] Invariant cache hit.
[2024-06-01 06:54:00] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-06-01 06:54:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:54:01] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 19 places in 15 ms of which 1 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:02] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:54:03] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:04] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:54:04] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:54:05] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 18/95 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:54:06] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 211/426 variables, 215/314 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:09] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:54:09] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:54:09] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:54:09] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:54:09] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:54:09] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:09] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:54:09] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:54:10] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:54:10] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:54:10] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:54:10] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:54:10] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 13/327 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:11] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:54:11] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:54:11] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:11] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:11] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:54:11] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:54:11] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:54:11] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:54:12] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:54:12] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:54:12] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:54:12] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:54:12] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:54:12] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:54:12] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:54:12] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:12] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:54:12] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:54:12] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 19/346 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:14] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:54:15] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:54:16] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 18/364 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:16] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:17] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:54:17] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:54:17] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:18] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:54:18] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:54:19] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:54:22] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:54:23] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:54:23] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/426 variables, 16/387 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:24] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:24] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:26] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:54:26] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:54:27] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:54:27] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:28] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:29] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 396 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 144/144 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 144/181 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:31] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:54:31] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:54:31] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:54:31] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:31] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:54:31] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:54:31] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:54:31] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:54:31] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:54:31] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 10/191 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:32] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:54:33] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:33] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:54:33] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:54:33] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:33] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:34] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 5/198 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:34] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:54:35] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:35] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-06-01 06:54:35] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:54:35] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:54:36] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:54:36] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:54:36] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:54:36] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:36] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:54:36] [INFO ] Deduced a trap composed of 35 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:54:36] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:54:36] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:54:36] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:54:36] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:54:36] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:54:36] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:54:36] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:54:36] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 17/217 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:37] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:38] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:54:38] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:54:38] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:54:38] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:54:39] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:54:39] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:54:39] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:54:39] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:54:39] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:54:39] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:54:39] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:54:39] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:40] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:54:40] [INFO ] Deduced a trap composed of 38 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:54:40] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:54:40] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:54:40] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:54:40] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:54:41] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:42] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 14 (OVERLAPS) 211/426 variables, 215/454 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 210/664 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:46] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-06-01 06:54:46] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:54:47] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:54:47] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-06-01 06:54:47] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:54:48] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:54:48] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:54:48] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:54:48] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 9/673 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:54:54] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:54:55] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:54:55] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:54:55] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 4/677 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 677 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 215/215 constraints]
After SMT, in 60048ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Finished structural reductions in LTL mode , in 1 iterations and 60254 ms. Remains : 215/215 places, 211/211 transitions.
Computed a total of 48 stabilizing places and 48 stable transitions
Computed a total of 48 stabilizing places and 48 stable transitions
Detected a total of 48/215 stabilizing places and 48/211 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 51 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 06:55:00] [INFO ] Invariant cache hit.
[2024-06-01 06:55:00] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-06-01 06:55:00] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-06-01 06:55:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 06:55:00] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-06-01 06:55:01] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-06-01 06:55:01] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:01] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:55:01] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 153 ms
[2024-06-01 06:55:01] [INFO ] Computed and/alt/rep : 210/471/210 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 06:55:02] [INFO ] Added : 194 causal constraints over 43 iterations in 1174 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6119 reset in 188 ms.
Product exploration explored 100000 steps with 6019 reset in 150 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 211/211 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 215 transition count 211
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 19 place count 215 transition count 213
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 28 place count 215 transition count 213
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 112 places in 0 ms
Iterating global reduction 1 with 84 rules applied. Total rules applied 112 place count 215 transition count 213
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 140 place count 187 transition count 185
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 168 place count 187 transition count 185
Deduced a syphon composed of 84 places in 0 ms
Applied a total of 168 rules in 17 ms. Remains 187 /215 variables (removed 28) and now considering 185/211 (removed 26) transitions.
[2024-06-01 06:55:03] [INFO ] Redundant transitions in 21 ms returned [180]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 183 sub problems to find dead transitions.
// Phase 1: matrix 184 rows 187 cols
[2024-06-01 06:55:03] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 06:55:03] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 183 unsolved
At refinement iteration 1 (OVERLAPS) 1/187 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 183 unsolved
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD40 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 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 TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD81 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
Problem TDEAD96 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 20/57 constraints. Problems are: Problem set: 62 solved, 121 unsolved
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 06:55:04] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD76 is UNSAT
Problem TDEAD101 is UNSAT
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD103 is UNSAT
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD130 is UNSAT
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD156 is UNSAT
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
Problem TDEAD159 is UNSAT
Problem TDEAD176 is UNSAT
[2024-06-01 06:55:05] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 17/74 constraints. Problems are: Problem set: 86 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/74 constraints. Problems are: Problem set: 86 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 184/371 variables, 187/261 constraints. Problems are: Problem set: 86 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 3/264 constraints. Problems are: Problem set: 86 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 0/264 constraints. Problems are: Problem set: 86 solved, 97 unsolved
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:55:07] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/371 variables, 6/270 constraints. Problems are: Problem set: 86 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/270 constraints. Problems are: Problem set: 86 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/371 variables, 0/270 constraints. Problems are: Problem set: 86 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 270 constraints, problems are : Problem set: 86 solved, 97 unsolved in 6028 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 187/187 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 183/183 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 86 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 86 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 85/187 variables, 37/37 constraints. Problems are: Problem set: 86 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 43/80 constraints. Problems are: Problem set: 86 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/80 constraints. Problems are: Problem set: 86 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 184/371 variables, 187/267 constraints. Problems are: Problem set: 86 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 3/270 constraints. Problems are: Problem set: 86 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 97/367 constraints. Problems are: Problem set: 86 solved, 97 unsolved
[2024-06-01 06:55:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:10] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:55:10] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 3/370 constraints. Problems are: Problem set: 86 solved, 97 unsolved
[2024-06-01 06:55:11] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:55:12] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 2/372 constraints. Problems are: Problem set: 86 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/372 constraints. Problems are: Problem set: 86 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/371 variables, 0/372 constraints. Problems are: Problem set: 86 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 371/371 variables, and 372 constraints, problems are : Problem set: 86 solved, 97 unsolved in 7962 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 187/187 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 97/183 constraints, Known Traps: 48/48 constraints]
After SMT, in 14021ms problems are : Problem set: 86 solved, 97 unsolved
Search for dead transitions found 86 dead transitions in 14022ms
Found 86 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 86 transitions
Dead transitions reduction (with SMT) removed 86 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 187/215 places, 98/211 transitions.
Graph (complete) has 353 edges and 187 vertex of which 103 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.1 ms
Discarding 84 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 103 /187 variables (removed 84) and now considering 98/98 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/215 places, 98/211 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14083 ms. Remains : 103/215 places, 98/211 transitions.
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 211/211 transitions.
Applied a total of 0 rules in 2 ms. Remains 215 /215 variables (removed 0) and now considering 211/211 (removed 0) transitions.
// Phase 1: matrix 211 rows 215 cols
[2024-06-01 06:55:17] [INFO ] Computed 37 invariants in 1 ms
[2024-06-01 06:55:17] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 06:55:17] [INFO ] Invariant cache hit.
[2024-06-01 06:55:17] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2024-06-01 06:55:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:55:18] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 19 places in 15 ms of which 0 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 2 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:19] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:20] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:55:21] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 06:55:22] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 18/95 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:55:23] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:55:24] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 211/426 variables, 215/314 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:26] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:55:27] [INFO ] Deduced a trap composed of 24 places in 20 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 13/327 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:28] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:55:28] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:55:28] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:55:28] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:55:28] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:28] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:55:28] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:55:29] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:30] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 19/346 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:31] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:55:32] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:55:33] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 18/364 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:33] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:55:34] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-01 06:55:34] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:55:34] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:35] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:55:35] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:55:36] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/426 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/426 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-06-01 06:55:39] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:55:40] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:55:40] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:40] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:55:40] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/426 variables, 16/387 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:41] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:55:42] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:55:43] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:55:44] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:45] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-06-01 06:55:46] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 3/396 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/426 variables, and 396 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 144/144 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/215 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 144/181 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:48] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:55:48] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:55:48] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:55:48] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:55:48] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:55:48] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:55:49] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 06:55:49] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:55:49] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:49] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 10/191 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:49] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:55:50] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:50] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:55:50] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 06:55:50] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:55:51] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:51] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 5/198 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:51] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:52] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:55:53] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 17/217 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:55] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:55] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-01 06:55:55] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:55:55] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:55:55] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 0 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:55:56] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 12/230 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:55:57] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:58] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:55:58] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:55:59] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 14 (OVERLAPS) 211/426 variables, 215/454 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 210/664 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:56:03] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:56:04] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:56:05] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 9/673 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2024-06-01 06:56:11] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:56:11] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 06:56:12] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:56:12] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 4/677 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 677 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 215/215 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 215/215 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Finished structural reductions in LTL mode , in 1 iterations and 60243 ms. Remains : 215/215 places, 211/211 transitions.
Treatment of property ShieldIIPs-PT-004B-LTLFireability-15 finished in 200507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((X(p0) U p1)))&&F(p1))))'
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||G(p1)))))'
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((X(G(p0))&&G(p1))))'
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(p0)||(!p1 U (p2||G(!p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(p1))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-004B-LTLFireability-09
Stuttering acceptance computed with spot in 143 ms :[(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 223 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 222 transition count 199
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 203 transition count 199
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 38 place count 203 transition count 179
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 78 place count 183 transition count 179
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 174 transition count 170
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 174 transition count 170
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 96 place count 174 transition count 165
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 106 place count 169 transition count 165
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 234 place count 105 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 236 place count 103 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 237 place count 102 transition count 99
Applied a total of 237 rules in 15 ms. Remains 102 /223 variables (removed 121) and now considering 99/219 (removed 120) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-06-01 06:56:17] [INFO ] Computed 36 invariants in 1 ms
[2024-06-01 06:56:18] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-01 06:56:18] [INFO ] Invariant cache hit.
[2024-06-01 06:56:18] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-06-01 06:56:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:18] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:18] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:56:18] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:56:18] [INFO ] Deduced a trap composed of 10 places in 14 ms of which 0 ms to minimize.
[2024-06-01 06:56:18] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:56:18] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:56:18] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:56:18] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:18] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:56:18] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:19] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:56:19] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:19] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 99/201 variables, 102/151 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:20] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:56:20] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:56:20] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:20] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:56:20] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:56:20] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:21] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 158 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3983 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 99/201 variables, 102/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 97/255 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 255 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2703 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 20/20 constraints]
After SMT, in 6711ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 6712ms
Starting structural reductions in LI_LTL mode, iteration 1 : 102/223 places, 99/219 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6893 ms. Remains : 102/223 places, 99/219 transitions.
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-09
Product exploration explored 100000 steps with 18749 reset in 125 ms.
Product exploration explored 100000 steps with 18790 reset in 146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 971 steps (2 resets) in 9 ms. (97 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(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 128 ms :[(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 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 99/99 transitions.
Applied a total of 0 rules in 0 ms. Remains 102 /102 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-06-01 06:56:25] [INFO ] Invariant cache hit.
[2024-06-01 06:56:25] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 06:56:25] [INFO ] Invariant cache hit.
[2024-06-01 06:56:26] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-06-01 06:56:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:56:26] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:27] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:27] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:27] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 99/201 variables, 102/151 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 06:56:28] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:29] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 158 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4014 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 99/201 variables, 102/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 97/255 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 255 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2706 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 20/20 constraints]
After SMT, in 6735ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 6737ms
Finished structural reductions in LTL mode , in 1 iterations and 6890 ms. Remains : 102/102 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 785 steps (1 resets) in 12 ms. (60 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 139 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(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 143 ms :[(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 142 ms :[(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 18914 reset in 118 ms.
Product exploration explored 100000 steps with 18776 reset in 134 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(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 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-06-01 06:56:34] [INFO ] Redundant transitions in 21 ms returned [98]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 98 rows 102 cols
[2024-06-01 06:56:34] [INFO ] Computed 36 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 06:56:34] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 06:56:35] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 06:56:35] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 06:56:35] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 98/200 variables, 102/149 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 06:56:36] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 06:56:36] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/200 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 06:56:37] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/200 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 06:56:38] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/200 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 06:56:38] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:56:38] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:56:38] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/200 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 06:56:39] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/200 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/200 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 19 (OVERLAPS) 0/200 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 157 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6355 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 14/49 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 98/200 variables, 102/157 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 96/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 06:56:41] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:56:41] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-01 06:56:43] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/200 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/200 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/200 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 256 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4892 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 22/22 constraints]
After SMT, in 11261ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 11263ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/102 places, 98/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11294 ms. Remains : 102/102 places, 98/99 transitions.
Support contains 4 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-06-01 06:56:45] [INFO ] Computed 36 invariants in 1 ms
[2024-06-01 06:56:45] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-01 06:56:45] [INFO ] Invariant cache hit.
[2024-06-01 06:56:45] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-06-01 06:56:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:45] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-06-01 06:56:45] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 06:56:45] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:56:45] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:56:45] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:46] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 99/201 variables, 102/151 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:47] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:48] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:48] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 0/201 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 158 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4050 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 99/201 variables, 102/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 97/255 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 255 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2797 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 20/20 constraints]
After SMT, in 6862ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 6863ms
Finished structural reductions in LTL mode , in 1 iterations and 7003 ms. Remains : 102/102 places, 99/99 transitions.
Treatment of property ShieldIIPs-PT-004B-LTLFireability-09 finished in 34721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!(F(X(!X(p0))) U p1)||p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p0&&F((p0||X(p0))))||G(F(p0))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-004B-LTLFireability-15
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 223/223 places, 219/219 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 222 transition count 199
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 203 transition count 199
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 38 place count 203 transition count 178
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 80 place count 182 transition count 178
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 88 place count 174 transition count 170
Iterating global reduction 2 with 8 rules applied. Total rules applied 96 place count 174 transition count 170
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 96 place count 174 transition count 166
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 104 place count 170 transition count 166
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 236 place count 104 transition count 100
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 238 place count 102 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 239 place count 101 transition count 98
Applied a total of 239 rules in 21 ms. Remains 101 /223 variables (removed 122) and now considering 98/219 (removed 121) transitions.
// Phase 1: matrix 98 rows 101 cols
[2024-06-01 06:56:53] [INFO ] Computed 36 invariants in 0 ms
[2024-06-01 06:56:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 06:56:53] [INFO ] Invariant cache hit.
[2024-06-01 06:56:53] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-06-01 06:56:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-06-01 06:56:53] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 1/101 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-06-01 06:56:54] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:55] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/199 variables, 101/158 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:55] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:56:55] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:56:55] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 06:56:55] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:56:55] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:56] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/199 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:56:57] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 5/171 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/199 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:56:58] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/199 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 18 (OVERLAPS) 0/199 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 174 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6787 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 37/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 98/199 variables, 101/174 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 97/271 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:57:02] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/199 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:57:03] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/199 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:57:04] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 06:57:06] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 06:57:06] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/199 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (OVERLAPS) 0/199 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 276 constraints, problems are : Problem set: 0 solved, 97 unsolved in 10266 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 42/42 constraints]
After SMT, in 17066ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 17067ms
Starting structural reductions in LI_LTL mode, iteration 1 : 101/223 places, 98/219 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 17263 ms. Remains : 101/223 places, 98/219 transitions.
Running random walk in product with property : ShieldIIPs-PT-004B-LTLFireability-15
Stuttering criterion allowed to conclude after 325 steps with 0 reset in 1 ms.
Treatment of property ShieldIIPs-PT-004B-LTLFireability-15 finished in 17482 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-06-01 06:57:10] [INFO ] Flatten gal took : 12 ms
[2024-06-01 06:57:10] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 06:57:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 223 places, 219 transitions and 678 arcs took 3 ms.
Total runtime 1329040 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldIIPs-PT-004B-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-004B-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-004B-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-004B-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-004B-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-004B-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-004B-LTLFireability-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-004B-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPs-PT-004B-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717225811394

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldIIPs-PT-004B-LTLFireability-02
ltl formula formula --ltl=/tmp/14333/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 223 places, 219 transitions and 678 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.050 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/14333/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/14333/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/14333/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/14333/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 225 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 224, there are 224 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( 3/ 4): ~208 levels ~10000 states ~25416 transitions
pnml2lts-mc( 3/ 4): ~208 levels ~20000 states ~51616 transitions
pnml2lts-mc( 3/ 4): ~208 levels ~40000 states ~101900 transitions
pnml2lts-mc( 3/ 4): ~208 levels ~80000 states ~211300 transitions
pnml2lts-mc( 3/ 4): ~217 levels ~160000 states ~436768 transitions
pnml2lts-mc( 3/ 4): ~217 levels ~320000 states ~948960 transitions
pnml2lts-mc( 3/ 4): ~217 levels ~640000 states ~1975064 transitions
pnml2lts-mc( 3/ 4): ~217 levels ~1280000 states ~4193036 transitions
pnml2lts-mc( 3/ 4): ~217 levels ~2560000 states ~8962380 transitions
pnml2lts-mc( 3/ 4): ~235 levels ~5120000 states ~17818020 transitions
pnml2lts-mc( 3/ 4): ~241 levels ~10240000 states ~36610592 transitions
pnml2lts-mc( 3/ 4): ~241 levels ~20480000 states ~76026696 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33548908
pnml2lts-mc( 0/ 4): unique states count: 33549847
pnml2lts-mc( 0/ 4): unique transitions count: 133786224
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 100231839
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33549855
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1080
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33549855 states 133786247 transitions, fanout: 3.988
pnml2lts-mc( 0/ 4): Total exploration time 113.840 sec (113.820 sec minimum, 113.827 sec on average)
pnml2lts-mc( 0/ 4): States per second: 294711, Transitions per second: 1175213
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 259.7MB, 8.1 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 219 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 259.7MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-004B-LTLFireability-05
ltl formula formula --ltl=/tmp/14333/ltl_1_
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 223 places, 219 transitions and 678 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.020 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/14333/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/14333/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/14333/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/14333/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 224 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 224, there are 236 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( 3/ 4): ~308 levels ~10000 states ~27520 transitions
pnml2lts-mc( 3/ 4): ~308 levels ~20000 states ~56320 transitions
pnml2lts-mc( 3/ 4): ~308 levels ~40000 states ~113696 transitions
pnml2lts-mc( 3/ 4): ~308 levels ~80000 states ~245204 transitions
pnml2lts-mc( 3/ 4): ~308 levels ~160000 states ~509900 transitions
pnml2lts-mc( 0/ 4): ~307 levels ~320000 states ~1041904 transitions
pnml2lts-mc( 0/ 4): ~312 levels ~640000 states ~2148256 transitions
pnml2lts-mc( 0/ 4): ~312 levels ~1280000 states ~4383944 transitions
pnml2lts-mc( 0/ 4): ~312 levels ~2560000 states ~9444760 transitions
pnml2lts-mc( 0/ 4): ~324 levels ~5120000 states ~19010872 transitions
pnml2lts-mc( 0/ 4): ~324 levels ~10240000 states ~39233300 transitions
pnml2lts-mc( 0/ 4): ~324 levels ~20480000 states ~80705740 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33543590
pnml2lts-mc( 0/ 4): unique states count: 33545862
pnml2lts-mc( 0/ 4): unique transitions count: 191139564
pnml2lts-mc( 0/ 4): - self-loop count: 66
pnml2lts-mc( 0/ 4): - claim dead count: 157584731
pnml2lts-mc( 0/ 4): - claim found count: 321
pnml2lts-mc( 0/ 4): - claim success count: 33545872
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2401
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33545872 states 191139587 transitions, fanout: 5.698
pnml2lts-mc( 0/ 4): Total exploration time 123.810 sec (123.780 sec minimum, 123.795 sec on average)
pnml2lts-mc( 0/ 4): States per second: 270946, Transitions per second: 1543814
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 262.8MB, 8.2 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/10.0%
pnml2lts-mc( 0/ 4): Stored 219 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 262.8MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-004B-LTLFireability-06
ltl formula formula --ltl=/tmp/14333/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 223 places, 219 transitions and 678 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.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/14333/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/14333/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/14333/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/14333/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 224 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 224, there are 267 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( 1/ 4): ~554 levels ~10000 states ~40644 transitions
pnml2lts-mc( 2/ 4): ~561 levels ~20000 states ~88284 transitions
pnml2lts-mc( 2/ 4): ~561 levels ~40000 states ~189084 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~669!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 71746
pnml2lts-mc( 0/ 4): unique states count: 74061
pnml2lts-mc( 0/ 4): unique transitions count: 486926
pnml2lts-mc( 0/ 4): - self-loop count: 50
pnml2lts-mc( 0/ 4): - claim dead count: 399126
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 74071
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2370
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 74071 states 486976 transitions, fanout: 6.574
pnml2lts-mc( 0/ 4): Total exploration time 0.490 sec (0.490 sec minimum, 0.490 sec on average)
pnml2lts-mc( 0/ 4): States per second: 151165, Transitions per second: 993829
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.9MB, 11.4 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 219 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.9MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-004B-LTLFireability-08
ltl formula formula --ltl=/tmp/14333/ltl_3_
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 223 places, 219 transitions and 678 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.030 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/14333/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/14333/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/14333/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/14333/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 225 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 224, there are 258 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: 17
pnml2lts-mc( 0/ 4): unique states count: 17
pnml2lts-mc( 0/ 4): unique transitions count: 21
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 8
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 32
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32 states 55 transitions, fanout: 1.719
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 3200, Transitions per second: 5500
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, 62.1 B/state, compr.: 6.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 219 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 ShieldIIPs-PT-004B-LTLFireability-09
ltl formula formula --ltl=/tmp/14333/ltl_4_
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
pnml2lts-mc( 0/ 4): Petri net has 223 places, 219 transitions and 678 arcs
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 Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/14333/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/14333/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/14333/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/14333/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 225 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 224, there are 260 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: 8
pnml2lts-mc( 0/ 4): unique states count: 8
pnml2lts-mc( 0/ 4): unique transitions count: 15
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 12
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 19
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 19 states 52 transitions, fanout: 2.737
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, 78.0 B/state, compr.: 8.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 219 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 ShieldIIPs-PT-004B-LTLFireability-10
ltl formula formula --ltl=/tmp/14333/ltl_5_
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 223 places, 219 transitions and 678 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( 3/ 4): LTL layer: formula: /tmp/14333/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/14333/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/14333/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/14333/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 224 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 224, there are 234 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( 1/ 4): ~480 levels ~10000 states ~38132 transitions
pnml2lts-mc( 2/ 4): ~498 levels ~20000 states ~77252 transitions
pnml2lts-mc( 2/ 4): ~498 levels ~40000 states ~161956 transitions
pnml2lts-mc( 2/ 4): ~498 levels ~80000 states ~329988 transitions
pnml2lts-mc( 2/ 4): ~498 levels ~160000 states ~739068 transitions
pnml2lts-mc( 2/ 4): ~498 levels ~320000 states ~1602848 transitions
pnml2lts-mc( 2/ 4): ~498 levels ~640000 states ~3218200 transitions
pnml2lts-mc( 2/ 4): ~498 levels ~1280000 states ~6970420 transitions
pnml2lts-mc( 2/ 4): ~500 levels ~2560000 states ~14307820 transitions
pnml2lts-mc( 2/ 4): ~500 levels ~5120000 states ~31400188 transitions
pnml2lts-mc( 2/ 4): ~500 levels ~10240000 states ~65811868 transitions
pnml2lts-mc( 2/ 4): ~500 levels ~20480000 states ~138912616 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33542612
pnml2lts-mc( 0/ 4): unique states count: 33545084
pnml2lts-mc( 0/ 4): unique transitions count: 250659828
pnml2lts-mc( 0/ 4): - self-loop count: 62
pnml2lts-mc( 0/ 4): - claim dead count: 217105347
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33545092
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2602
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33545092 states 250659846 transitions, fanout: 7.472
pnml2lts-mc( 0/ 4): Total exploration time 136.240 sec (136.230 sec minimum, 136.232 sec on average)
pnml2lts-mc( 0/ 4): States per second: 246221, Transitions per second: 1839840
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.8MB, 8.1 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 219 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.8MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-004B-LTLFireability-11
ltl formula formula --ltl=/tmp/14333/ltl_6_
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 223 places, 219 transitions and 678 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/14333/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/14333/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/14333/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/14333/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 225 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 224, there are 224 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( 1/ 4): ~399 levels ~10000 states ~26180 transitions
pnml2lts-mc( 0/ 4): ~435 levels ~20000 states ~55304 transitions
pnml2lts-mc( 0/ 4): ~435 levels ~40000 states ~115976 transitions
pnml2lts-mc( 0/ 4): ~435 levels ~80000 states ~241520 transitions
pnml2lts-mc( 1/ 4): ~399 levels ~160000 states ~425584 transitions
pnml2lts-mc( 3/ 4): ~377 levels ~320000 states ~871604 transitions
pnml2lts-mc( 3/ 4): ~377 levels ~640000 states ~1856944 transitions
pnml2lts-mc( 3/ 4): ~377 levels ~1280000 states ~4035328 transitions
pnml2lts-mc( 1/ 4): ~399 levels ~2560000 states ~8643972 transitions
pnml2lts-mc( 1/ 4): ~399 levels ~5120000 states ~17473908 transitions
pnml2lts-mc( 2/ 4): ~371 levels ~10240000 states ~34757736 transitions
pnml2lts-mc( 1/ 4): ~399 levels ~20480000 states ~73398960 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33545843
pnml2lts-mc( 0/ 4): unique states count: 33547217
pnml2lts-mc( 0/ 4): unique transitions count: 131065352
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 97510935
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33547226
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1582
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33547226 states 131065376 transitions, fanout: 3.907
pnml2lts-mc( 0/ 4): Total exploration time 114.940 sec (114.920 sec minimum, 114.930 sec on average)
pnml2lts-mc( 0/ 4): States per second: 291867, Transitions per second: 1140294
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 261.9MB, 8.2 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/9.0%
pnml2lts-mc( 0/ 4): Stored 219 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 261.9MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-004B-LTLFireability-14
ltl formula formula --ltl=/tmp/14333/ltl_7_
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 223 places, 219 transitions and 678 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.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/14333/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/14333/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/14333/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/14333/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 224 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 224, there are 301 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): ~608 levels ~10000 states ~75512 transitions
pnml2lts-mc( 2/ 4): ~680 levels ~20000 states ~139544 transitions
pnml2lts-mc( 2/ 4): ~680 levels ~40000 states ~289996 transitions
pnml2lts-mc( 2/ 4): ~680 levels ~80000 states ~654152 transitions
pnml2lts-mc( 2/ 4): ~680 levels ~160000 states ~1421132 transitions
pnml2lts-mc( 2/ 4): ~680 levels ~320000 states ~2889968 transitions
pnml2lts-mc( 2/ 4): ~682 levels ~640000 states ~6255652 transitions
pnml2lts-mc( 2/ 4): ~682 levels ~1280000 states ~13538076 transitions
pnml2lts-mc( 2/ 4): ~682 levels ~2560000 states ~28273464 transitions
pnml2lts-mc( 2/ 4): ~682 levels ~5120000 states ~61097520 transitions
pnml2lts-mc( 2/ 4): ~682 levels ~10240000 states ~131476480 transitions
pnml2lts-mc( 2/ 4): ~682 levels ~20480000 states ~270568036 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33540327
pnml2lts-mc( 0/ 4): unique states count: 33543116
pnml2lts-mc( 0/ 4): unique transitions count: 508544469
pnml2lts-mc( 0/ 4): - self-loop count: 54
pnml2lts-mc( 0/ 4): - claim dead count: 474980520
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33543128
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2884
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33543128 states 508544554 transitions, fanout: 15.161
pnml2lts-mc( 0/ 4): Total exploration time 170.790 sec (170.750 sec minimum, 170.777 sec on average)
pnml2lts-mc( 0/ 4): States per second: 196400, Transitions per second: 2977602
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 256.7MB, 8.0 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 219 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 256.7MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-004B-LTLFireability-15
ltl formula formula --ltl=/tmp/14333/ltl_8_
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 223 places, 219 transitions and 678 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.030 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/14333/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/14333/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/14333/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/14333/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 225 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 224, there are 225 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( 3/ 4): ~75 levels ~10000 states ~26352 transitions
pnml2lts-mc( 3/ 4): ~75 levels ~20000 states ~54180 transitions
pnml2lts-mc( 3/ 4): ~75 levels ~40000 states ~117368 transitions
pnml2lts-mc( 3/ 4): ~75 levels ~80000 states ~252960 transitions
pnml2lts-mc( 3/ 4): ~75 levels ~160000 states ~524404 transitions
pnml2lts-mc( 3/ 4): ~75 levels ~320000 states ~1110456 transitions
pnml2lts-mc( 3/ 4): ~75 levels ~640000 states ~2346848 transitions
pnml2lts-mc( 3/ 4): ~75 levels ~1280000 states ~4972488 transitions
pnml2lts-mc( 3/ 4): ~75 levels ~2560000 states ~10462896 transitions
pnml2lts-mc( 3/ 4): ~75 levels ~5120000 states ~22087036 transitions
pnml2lts-mc( 3/ 4): ~75 levels ~10240000 states ~45890908 transitions
pnml2lts-mc( 3/ 4): ~75 levels ~20480000 states ~95709940 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33553263
pnml2lts-mc( 0/ 4): unique states count: 33553478
pnml2lts-mc( 0/ 4): unique transitions count: 159854831
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 126300389
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33553489
pnml2lts-mc( 0/ 4): - cum. max stack depth: 301
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33553489 states 159854860 transitions, fanout: 4.764
pnml2lts-mc( 0/ 4): Total exploration time 117.520 sec (117.500 sec minimum, 117.505 sec on average)
pnml2lts-mc( 0/ 4): States per second: 285513, Transitions per second: 1360235
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 260.3MB, 8.1 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 219 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 260.3MB (~256.0MB paged-in)