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.r356-tall-171683760300076.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 itstools
Input is ShieldIIPs-PT-005B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760300076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 14:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 14:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 82K 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-005B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716887592207

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-005B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-28 09:13:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 09:13:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:13:13] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-28 09:13:13] [INFO ] Transformed 303 places.
[2024-05-28 09:13:13] [INFO ] Transformed 298 transitions.
[2024-05-28 09:13:13] [INFO ] Found NUPN structural information;
[2024-05-28 09:13:13] [INFO ] Parsed PT model containing 303 places and 298 transitions and 896 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-005B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 298/298 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 279 transition count 274
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 279 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 278 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 278 transition count 273
Applied a total of 50 rules in 66 ms. Remains 278 /303 variables (removed 25) and now considering 273/298 (removed 25) transitions.
// Phase 1: matrix 273 rows 278 cols
[2024-05-28 09:13:13] [INFO ] Computed 46 invariants in 22 ms
[2024-05-28 09:13:14] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-28 09:13:14] [INFO ] Invariant cache hit.
[2024-05-28 09:13:14] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-05-28 09:13:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 10 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 3 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-28 09:13:17] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:13:18] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:19] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-28 09:13:19] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-28 09:13:19] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:13:19] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:13:19] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:13:19] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:13:19] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:13:19] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:13:19] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:13:19] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:13:19] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:19] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 8 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:13:20] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:21] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:13:22] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:23] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 2 ms to minimize.
[2024-05-28 09:13:23] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:13:23] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:13:23] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:23] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 2 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:13:24] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:25] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:13:25] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:13:25] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:13:25] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:13:25] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:13:26] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:13:26] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:26] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:13:26] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:13:26] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:26] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:13:26] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:13:26] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:13:26] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:13:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:13:26] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-28 09:13:26] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:13:26] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:13:26] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 19/145 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:28] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:13:29] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:13:29] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:29] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:13:29] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:13:29] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:13:29] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:13:29] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:13:29] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:13:29] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:13:30] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 11/156 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:31] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:13:31] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:13:31] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:13:31] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:13:31] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:32] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:13:32] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:13:33] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:13:33] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:13:33] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 5/166 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:36] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:13:36] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:13:36] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:36] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:13:36] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:13:36] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:13:36] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:13:36] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:38] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:13:38] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 13 (OVERLAPS) 273/551 variables, 278/454 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:13:42] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:13:43] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:13:43] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:13:43] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
[2024-05-28 09:13:43] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:13:44] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:13:44] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:13:44] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2024-05-28 09:13:44] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-28 09:13:44] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/551 variables, and 473 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 149/149 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 149/195 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:46] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:13:46] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:46] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:13:46] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:46] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:13:46] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:13:46] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:13:46] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:47] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:13:47] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:13:47] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:13:47] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:13:47] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:13:47] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 14/209 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:48] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:13:49] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:50] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:13:50] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:13:50] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:13:50] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:50] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:13:50] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:13:50] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:13:50] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:13:50] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:13:51] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:13:51] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:13:51] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:13:51] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:51] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:51] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:13:51] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:51] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:13:51] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 18/229 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:52] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:13:52] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:13:53] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:13:53] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 4/233 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:54] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:13:54] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:13:54] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:13:54] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:13:54] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:13:54] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:13:54] [INFO ] Deduced a trap composed of 40 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:13:55] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 8/241 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:56] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:13:56] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:13:56] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:13:56] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:56] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:13:56] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:13:56] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-28 09:13:56] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:13:57] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 9/250 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:13:58] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:13:58] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:58] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:13:58] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:58] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:13:58] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:13:58] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:13:58] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:58] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:13:58] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:13:59] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:13:59] [INFO ] Deduced a trap composed of 41 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:13:59] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:13:59] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 14/264 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:14:00] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:14:00] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-28 09:14:00] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-28 09:14:01] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:14:01] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:14:01] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:14:01] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:14:01] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:01] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:14:01] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:14:01] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:14:01] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:14:01] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:14:01] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:14:01] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:14:02] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 16/280 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:14:03] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:14:03] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:14:03] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:14:03] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:14:05] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:14:05] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:14:05] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:14:05] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:14:05] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:14:05] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:14:05] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:14:05] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/278 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:14:07] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:07] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/278 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:14:09] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
[2024-05-28 09:14:09] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:14:09] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:14:09] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:14:09] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:14:09] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:14:09] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:09] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:14:09] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/278 variables, 9/303 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-28 09:14:10] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 5 ms to minimize.
[2024-05-28 09:14:11] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:14:11] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:14:11] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:14:11] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:14:11] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-28 09:14:11] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:14:11] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:14:11] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:14:11] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:14:11] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:14:11] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:14:12] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:14:12] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:14:12] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:14:12] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/278 variables, 16/319 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/278 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 597 constraints, problems are : Problem set: 0 solved, 272 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 0/272 constraints, Known Traps: 273/273 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 278/303 places, 273/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60747 ms. Remains : 278/303 places, 273/298 transitions.
Support contains 50 out of 278 places after structural reductions.
[2024-05-28 09:14:14] [INFO ] Flatten gal took : 43 ms
[2024-05-28 09:14:14] [INFO ] Flatten gal took : 19 ms
[2024-05-28 09:14:14] [INFO ] Input system was already deterministic with 273 transitions.
Support contains 49 out of 278 places (down from 50) after GAL structural reductions.
RANDOM walk for 40000 steps (56 resets) in 1120 ms. (35 steps per ms) remains 3/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 1/2 properties
[2024-05-28 09:14:15] [INFO ] Invariant cache hit.
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 1/551 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 0/46 constraints, State Equation: 0/278 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 65 stabilizing places and 65 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' '!((((p0||X((p1&&G(p0)))) U p2) U p3))'
Support contains 8 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 267 transition count 262
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 267 transition count 262
Applied a total of 22 rules in 12 ms. Remains 267 /278 variables (removed 11) and now considering 262/273 (removed 11) transitions.
// Phase 1: matrix 262 rows 267 cols
[2024-05-28 09:14:15] [INFO ] Computed 46 invariants in 4 ms
[2024-05-28 09:14:15] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-28 09:14:15] [INFO ] Invariant cache hit.
[2024-05-28 09:14:16] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-28 09:14:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 2 ms to minimize.
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:14:18] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:14:19] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:20] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:14:20] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:14:20] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:14:20] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:14:20] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:14:20] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:14:20] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:14:20] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:14:20] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:14:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:14:20] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:14:21] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 3 ms to minimize.
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:23] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:24] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-28 09:14:25] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:14:25] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:25] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:14:25] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:14:25] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:25] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:14:25] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:14:26] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:14:26] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:26] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:14:27] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:27] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:14:27] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:14:27] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:14:27] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:14:27] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:30] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-28 09:14:30] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:31] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:14:31] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:14:31] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:32] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 262/529 variables, 267/396 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:36] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:14:36] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:14:37] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:14:37] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:37] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:14:37] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:14:37] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:14:38] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:14:38] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:14:38] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:14:38] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 11/407 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:40] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:14:40] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:14:41] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:14:42] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:14:42] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:14:42] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:14:42] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:14:42] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:14:42] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:14:42] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:14:42] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:14:43] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 18/425 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:43] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:14:44] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:14:44] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:14:44] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:14:45] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:14:45] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:14:45] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:14:45] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-28 09:14:45] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:14:45] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 1.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 1.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 0.0)
(s57 1.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 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.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.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 1.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 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/529 variables, and 435 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 122/122 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 122/168 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:47] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:14:47] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:14:48] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:14:48] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:14:48] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:14:48] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:48] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 09:14:49] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:14:50] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 262/529 variables, 267/445 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 261/706 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:14:55] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-28 09:14:55] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:14:55] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-28 09:14:55] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-28 09:14:55] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:14:55] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:14:56] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-28 09:14:56] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-05-28 09:14:56] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-05-28 09:14:56] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:14:56] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:14:56] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:14:56] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:14:57] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-28 09:14:57] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:14:57] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:14:57] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:14:57] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:14:57] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2024-05-28 09:14:57] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 20/726 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:15:02] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:15:02] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:15:03] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-28 09:15:03] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-28 09:15:03] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:15:03] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:15:04] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:15:04] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:15:04] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:15:04] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:15:05] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-28 09:15:05] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:15:05] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:15:05] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:15:05] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:15:06] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:15:06] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:15:06] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-28 09:15:06] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:15:06] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 20/746 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:15:12] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:15:13] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:15:14] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:15:14] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:15:14] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:15:14] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:15:14] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:15:14] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:15:15] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:15:15] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/529 variables, and 756 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 182/182 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60073ms
Starting structural reductions in LTL mode, iteration 1 : 267/278 places, 262/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60378 ms. Remains : 267/278 places, 262/273 transitions.
Stuttering acceptance computed with spot in 303 ms :[(NOT p3), (OR (NOT p1) (NOT p0)), (NOT p2), true, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-00 finished in 60777 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 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 277 transition count 247
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 252 transition count 247
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 50 place count 252 transition count 221
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 102 place count 226 transition count 221
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 113 place count 215 transition count 210
Iterating global reduction 2 with 11 rules applied. Total rules applied 124 place count 215 transition count 210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 124 place count 215 transition count 206
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 132 place count 211 transition count 206
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 298 place count 128 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 300 place count 126 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 301 place count 125 transition count 121
Applied a total of 301 rules in 56 ms. Remains 125 /278 variables (removed 153) and now considering 121/273 (removed 152) transitions.
// Phase 1: matrix 121 rows 125 cols
[2024-05-28 09:15:16] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 09:15:16] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 09:15:16] [INFO ] Invariant cache hit.
[2024-05-28 09:15:16] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-28 09:15:16] [INFO ] Redundant transitions in 30 ms returned [120]
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 119 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-05-28 09:15:16] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:17] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:15:18] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:18] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/245 variables, 125/190 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:19] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:15:19] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:15:19] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:20] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:15:21] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:22] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:15:22] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:23] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/245 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:24] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/245 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 16 (OVERLAPS) 0/245 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 203 constraints, problems are : Problem set: 0 solved, 119 unsolved in 8956 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 33/78 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 120/245 variables, 125/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 119/322 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:26] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:15:26] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:15:26] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:15:26] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:15:26] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 5/327 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/245 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 327 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5357 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 38/38 constraints]
After SMT, in 14333ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 14334ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/278 places, 120/273 transitions.
Applied a total of 0 rules in 10 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14599 ms. Remains : 125/278 places, 120/273 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-01
Product exploration explored 100000 steps with 1209 reset in 371 ms.
Product exploration explored 100000 steps with 1227 reset in 362 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 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 346 steps (0 resets) in 7 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 86 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-05-28 09:15:32] [INFO ] Invariant cache hit.
[2024-05-28 09:15:32] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 09:15:32] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-28 09:15:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:15:32] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 09:15:32] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-28 09:15:32] [INFO ] Computed and/alt/rep : 119/288/119 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-28 09:15:33] [INFO ] Added : 113 causal constraints over 25 iterations in 413 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 120/120 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-28 09:15:33] [INFO ] Invariant cache hit.
[2024-05-28 09:15:33] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 09:15:33] [INFO ] Invariant cache hit.
[2024-05-28 09:15:33] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-28 09:15:33] [INFO ] Redundant transitions in 26 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-28 09:15:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:15:33] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:34] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/245 variables, 125/190 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:35] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:15:35] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:15:35] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:36] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:15:37] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:15:37] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:15:37] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:15:37] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/245 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 199 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5673 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 29/74 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 120/245 variables, 125/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 119/318 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:39] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:15:43] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:15:44] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/245 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:47] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:15:47] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:15:55] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:15:56] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/245 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 326 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 37/37 constraints]
After SMT, in 35703ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 35705ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 35915 ms. Remains : 125/125 places, 120/120 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 360 steps (0 resets) in 11 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 128 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
[2024-05-28 09:16:09] [INFO ] Invariant cache hit.
[2024-05-28 09:16:09] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 09:16:09] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-28 09:16:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:16:09] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 09:16:09] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-28 09:16:09] [INFO ] Computed and/alt/rep : 119/288/119 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-28 09:16:10] [INFO ] Added : 113 causal constraints over 25 iterations in 397 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1236 reset in 202 ms.
Product exploration explored 100000 steps with 1213 reset in 222 ms.
Built C files in :
/tmp/ltsmin9323583464977467208
[2024-05-28 09:16:10] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2024-05-28 09:16:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:16:10] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2024-05-28 09:16:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:16:10] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2024-05-28 09:16:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:16:10] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9323583464977467208
Running compilation step : cd /tmp/ltsmin9323583464977467208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 411 ms.
Running link step : cd /tmp/ltsmin9323583464977467208;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9323583464977467208;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14299617311855013205.hoa' '--buchi-type=spotba'
LTSmin run took 387 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-005B-LTLFireability-01 finished in 55010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)||G(p2)))'
Support contains 5 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 277 transition count 247
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 252 transition count 247
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 252 transition count 223
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 228 transition count 223
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 107 place count 219 transition count 214
Iterating global reduction 2 with 9 rules applied. Total rules applied 116 place count 219 transition count 214
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 116 place count 219 transition count 211
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 122 place count 216 transition count 211
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 290 place count 132 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 292 place count 130 transition count 125
Applied a total of 292 rules in 45 ms. Remains 130 /278 variables (removed 148) and now considering 125/273 (removed 148) transitions.
// Phase 1: matrix 125 rows 130 cols
[2024-05-28 09:16:11] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 09:16:11] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 09:16:11] [INFO ] Invariant cache hit.
[2024-05-28 09:16:11] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-28 09:16:11] [INFO ] Redundant transitions in 29 ms returned []
Running 123 sub problems to find dead transitions.
[2024-05-28 09:16:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:16:12] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 2/130 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:13] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:16:13] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:16:13] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:16:13] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:16:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:16:14] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 125/255 variables, 130/203 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:16:15] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:16:16] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:16:16] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 13/216 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:16] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:16:16] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:17] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:16:17] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:16:17] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:17] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:16:17] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:16:18] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:16:18] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:16:18] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:16:18] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:16:18] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 7/228 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:19] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:16:19] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:19] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:16:19] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:16:19] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:16:19] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:16:19] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:16:20] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:20] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/255 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/255 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 17 (OVERLAPS) 0/255 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 237 constraints, problems are : Problem set: 0 solved, 123 unsolved in 10470 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 60/98 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 2/130 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 125/255 variables, 130/237 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 123/360 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/255 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 360 constraints, problems are : Problem set: 0 solved, 123 unsolved in 5253 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 61/61 constraints]
After SMT, in 15745ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 15747ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/278 places, 125/273 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16006 ms. Remains : 130/278 places, 125/273 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-02
Product exploration explored 100000 steps with 16703 reset in 192 ms.
Product exploration explored 100000 steps with 16932 reset in 189 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/130 stabilizing places and 4/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 1896 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
RANDOM walk for 2652 steps (7 resets) in 60 ms. (43 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 p2 p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (OR p2 p1))), (F p1), (F (NOT (AND (NOT p0) p2 (NOT p1))))]
Knowledge based reduction with 13 factoid took 3155 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 125/125 transitions.
Applied a total of 0 rules in 11 ms. Remains 130 /130 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-28 09:16:33] [INFO ] Invariant cache hit.
[2024-05-28 09:16:33] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 09:16:33] [INFO ] Invariant cache hit.
[2024-05-28 09:16:33] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-28 09:16:33] [INFO ] Redundant transitions in 27 ms returned []
Running 123 sub problems to find dead transitions.
[2024-05-28 09:16:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:16: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/128 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:34] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:16:35] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 2/130 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:35] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:16:35] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:16:35] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:36] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:16:36] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:16:36] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:16:36] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:16:36] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:36] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:16:36] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:16:36] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:16:36] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:16:36] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 125/255 variables, 130/203 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:37] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:16:37] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:16:37] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:16:37] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:16:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:16:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:16:37] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-28 09:16:37] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:16:37] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:16:38] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:16:38] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:16:38] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:16:38] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 13/216 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:38] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:16:38] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:39] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:16:39] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:16:39] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:39] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:16:40] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:16:40] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:40] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:16:40] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:16:40] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:16:40] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 7/228 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:41] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:16:41] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:41] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:16:41] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:16:41] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:16:41] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:16:41] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:16:42] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:16:42] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/255 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/255 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 17 (OVERLAPS) 0/255 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 237 constraints, problems are : Problem set: 0 solved, 123 unsolved in 10259 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 60/98 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 2/130 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 125/255 variables, 130/237 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 123/360 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/255 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 360 constraints, problems are : Problem set: 0 solved, 123 unsolved in 5276 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 61/61 constraints]
After SMT, in 15559ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 15560ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15779 ms. Remains : 130/130 places, 125/125 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/130 stabilizing places and 4/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
Knowledge based reduction with 13 factoid took 1963 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
RANDOM walk for 4095 steps (14 resets) in 38 ms. (105 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2)), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR p0 p2 p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (OR p2 p1))), (F p1), (F (NOT (AND (NOT p0) p2 (NOT p1))))]
Knowledge based reduction with 13 factoid took 3136 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 16906 reset in 170 ms.
Product exploration explored 100000 steps with 16884 reset in 190 ms.
Built C files in :
/tmp/ltsmin11178588443227708690
[2024-05-28 09:16:55] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2024-05-28 09:16:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:16:55] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2024-05-28 09:16:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:16:55] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2024-05-28 09:16:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:16:55] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11178588443227708690
Running compilation step : cd /tmp/ltsmin11178588443227708690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 308 ms.
Running link step : cd /tmp/ltsmin11178588443227708690;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11178588443227708690;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12636055823809894559.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 130 /130 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-28 09:17:10] [INFO ] Invariant cache hit.
[2024-05-28 09:17:10] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 09:17:10] [INFO ] Invariant cache hit.
[2024-05-28 09:17:10] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-28 09:17:11] [INFO ] Redundant transitions in 22 ms returned []
Running 123 sub problems to find dead transitions.
[2024-05-28 09:17:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:17:11] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:17:11] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:17:11] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:17:11] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:17:11] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:17:11] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:17:11] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:17:11] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:17:11] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:17:11] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:17:11] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:17:11] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:17:12] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:17:12] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 2/130 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:17:12] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:17:13] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 125/255 variables, 130/203 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:17:14] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:17:14] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:17:14] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:17:14] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:17:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:17:14] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:17:14] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:17:14] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:17:15] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:17:15] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:17:15] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:17:15] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:17:15] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 13/216 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:17:16] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:17:16] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:17:16] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:17:16] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:17:16] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/255 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:17:17] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 7/228 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/255 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:17:18] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/255 variables, 6/236 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:17:19] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/255 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/255 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 17 (OVERLAPS) 0/255 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 237 constraints, problems are : Problem set: 0 solved, 123 unsolved in 10373 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 60/98 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 2/130 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 125/255 variables, 130/237 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 123/360 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/255 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 360 constraints, problems are : Problem set: 0 solved, 123 unsolved in 5272 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 61/61 constraints]
After SMT, in 15663ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 15665ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15884 ms. Remains : 130/130 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin575781807072845296
[2024-05-28 09:17:26] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2024-05-28 09:17:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:17:26] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2024-05-28 09:17:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:17:26] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2024-05-28 09:17:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:17:26] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin575781807072845296
Running compilation step : cd /tmp/ltsmin575781807072845296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 307 ms.
Running link step : cd /tmp/ltsmin575781807072845296;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin575781807072845296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased892178095745226654.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 09:17:41] [INFO ] Flatten gal took : 9 ms
[2024-05-28 09:17:41] [INFO ] Flatten gal took : 9 ms
[2024-05-28 09:17:41] [INFO ] Time to serialize gal into /tmp/LTL14317949200993899115.gal : 3 ms
[2024-05-28 09:17:41] [INFO ] Time to serialize properties into /tmp/LTL252989693831874341.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14317949200993899115.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2302526019663906668.hoa' '-atoms' '/tmp/LTL252989693831874341.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL252989693831874341.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2302526019663906668.hoa
Detected timeout of ITS tools.
[2024-05-28 09:17:56] [INFO ] Flatten gal took : 9 ms
[2024-05-28 09:17:56] [INFO ] Flatten gal took : 8 ms
[2024-05-28 09:17:56] [INFO ] Time to serialize gal into /tmp/LTL25883008286828953.gal : 2 ms
[2024-05-28 09:17:56] [INFO ] Time to serialize properties into /tmp/LTL17913726644401803510.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL25883008286828953.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17913726644401803510.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((((F("(p100==1)"))U("(p101==1)"))||(G("(((p267==0)||(p286==0))||(p297==0))"))))
Formula 0 simplified : (G!"(p100==1)" R !"(p101==1)") & F!"(((p267==0)||(p286==0))||(p297==0))"
Detected timeout of ITS tools.
[2024-05-28 09:18:12] [INFO ] Flatten gal took : 8 ms
[2024-05-28 09:18:12] [INFO ] Applying decomposition
[2024-05-28 09:18:12] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6442287418375968570.txt' '-o' '/tmp/graph6442287418375968570.bin' '-w' '/tmp/graph6442287418375968570.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6442287418375968570.bin' '-l' '-1' '-v' '-w' '/tmp/graph6442287418375968570.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:18:12] [INFO ] Decomposing Gal with order
[2024-05-28 09:18:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:18:12] [INFO ] Removed a total of 82 redundant transitions.
[2024-05-28 09:18:12] [INFO ] Flatten gal took : 51 ms
[2024-05-28 09:18:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 7 ms.
[2024-05-28 09:18:12] [INFO ] Time to serialize gal into /tmp/LTL13085583538740603512.gal : 3 ms
[2024-05-28 09:18:12] [INFO ] Time to serialize properties into /tmp/LTL1795998569155271149.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13085583538740603512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1795998569155271149.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((F("(i1.i1.u16.p100==1)"))U("(i1.i0.u17.p101==1)"))||(G("(((i4.i0.u42.p267==0)||(i4.i0.u45.p286==0))||(i4.i1.u46.p297==0))"))))
Formula 0 simplified : (G!"(i1.i1.u16.p100==1)" R !"(i1.i0.u17.p101==1)") & F!"(((i4.i0.u42.p267==0)||(i4.i0.u45.p286==0))||(i4.i1.u46.p297==0))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-02 finished in 135760 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))||G((F(p1)||(!p2 U (p3||G(!p2)))))))'
Support contains 9 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 268 transition count 263
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 268 transition count 263
Applied a total of 20 rules in 4 ms. Remains 268 /278 variables (removed 10) and now considering 263/273 (removed 10) transitions.
// Phase 1: matrix 263 rows 268 cols
[2024-05-28 09:18:27] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 09:18:27] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 09:18:27] [INFO ] Invariant cache hit.
[2024-05-28 09:18:27] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-28 09:18:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:18:29] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:18:29] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:18:30] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:18:31] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:18:32] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:18:34] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:18:34] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:18:34] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:18:34] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:18:34] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:18:34] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:18:35] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:18:36] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:18:37] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:18:37] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:18:38] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:18:38] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:18:38] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:18:38] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:18:40] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:18:40] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:18:40] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:18:40] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:18:41] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:18:41] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:18:41] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:18:41] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 8/127 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:18:42] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:18:42] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-28 09:18:42] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:18:42] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:18:43] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:18:43] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:18:43] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:18:43] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:18:44] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:18:44] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:18:44] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 3/138 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 11 (OVERLAPS) 263/531 variables, 268/406 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:18:48] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:18:48] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:18:48] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:18:49] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:18:49] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:18:49] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:18:49] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:18:49] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 8/414 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:18:52] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:18:52] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:18:52] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:18:52] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:18:53] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:18:53] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:18:53] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:18:53] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:18:53] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:18:53] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/531 variables, 10/424 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:18:54] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:18:55] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:18:55] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:18:55] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:18:55] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:18:56] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:18:56] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/531 variables, 7/431 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:18:57] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:18:57] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:18:57] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:18:57] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:18:57] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:18:57] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:18:57] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
SMT process timed out in 30055ms, After SMT, problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 30058ms
Starting structural reductions in LTL mode, iteration 1 : 268/278 places, 263/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30314 ms. Remains : 268/278 places, 263/273 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p3) p2 (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3) p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-03
Stuttering criterion allowed to conclude after 25435 steps with 70 reset in 67 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-03 finished in 30543 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&&(p1||F(p2))))))'
Support contains 6 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 268 transition count 263
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 268 transition count 263
Applied a total of 20 rules in 6 ms. Remains 268 /278 variables (removed 10) and now considering 263/273 (removed 10) transitions.
// Phase 1: matrix 263 rows 268 cols
[2024-05-28 09:18:57] [INFO ] Computed 46 invariants in 5 ms
[2024-05-28 09:18:57] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 09:18:57] [INFO ] Invariant cache hit.
[2024-05-28 09:18:58] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-28 09:18:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:00] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:19:00] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:19:00] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:19:00] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:19:00] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-05-28 09:19:00] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:19:00] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 3 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:19:01] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:02] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:19:02] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:19:02] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:19:02] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:19:02] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:19:02] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:19:02] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:19:02] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:19:02] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:19:02] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-28 09:19:02] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-28 09:19:03] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:19:03] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:19:03] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:19:03] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:19:03] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:19:03] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:19:03] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:19:03] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:19:03] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:04] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:19:05] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:19:05] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:19:05] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:19:05] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:19:05] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:19:05] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:19:05] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:19:05] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:19:05] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:19:05] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 3 ms to minimize.
[2024-05-28 09:19:05] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:19:05] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:19:05] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:19:06] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:19:06] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:19:06] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:19:06] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:19:06] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:19:06] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:06] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:19:06] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:19:07] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-05-28 09:19:07] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:19:07] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2024-05-28 09:19:07] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-28 09:19:07] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:19:07] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:19:07] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:19:07] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:19:07] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:19:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:19:07] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:19:07] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:19:07] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:19:08] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:19:08] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:19:08] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:19:08] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:19:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:08] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:19:08] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:19:08] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:19:08] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:19:09] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:19:09] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:19:09] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:19:09] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:19:09] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:19:09] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:19:09] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:19:09] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:19:09] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:19:09] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:19:09] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:19:09] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 16/142 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:11] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:19:12] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:19:12] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:14] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:19:14] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (OVERLAPS) 263/531 variables, 268/415 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:17] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:19:17] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:19:17] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:19:17] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:19:17] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:19:18] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:19:18] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:19:19] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 8/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:19] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:19:20] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:19:20] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:19:20] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:19:20] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:19:20] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:19:20] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:19:21] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:19:21] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:19:21] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:19:21] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:19:21] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:19:21] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:19:21] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:19:21] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:19:21] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:19:21] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:19:21] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:19:22] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:19:22] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:24] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:19:24] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:19:24] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:19:24] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-05-28 09:19:24] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-28 09:19:25] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:19:25] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:19:25] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:19:25] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/531 variables, 9/452 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:26] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:19:27] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:19:27] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:19:27] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:19:27] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:19:27] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/531 variables, and 458 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 144/144 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 144/190 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:29] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-28 09:19:30] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:19:30] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:19:30] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:19:30] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:19:30] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:19:30] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 7/197 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:32] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:19:32] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:19:32] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:19:32] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:19:32] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 5/202 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:33] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:19:33] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 263/531 variables, 268/472 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 262/734 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:38] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:19:38] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:19:39] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-28 09:19:39] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-28 09:19:40] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:19:40] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:19:40] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:19:40] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:19:41] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-28 09:19:41] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-28 09:19:41] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:19:41] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-28 09:19:42] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
[2024-05-28 09:19:42] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:19:42] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:19:43] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:19:44] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:19:44] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 20/754 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:19:51] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-05-28 09:19:51] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-28 09:19:52] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:19:52] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:19:53] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:19:53] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:19:54] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
[2024-05-28 09:19:54] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-28 09:19:54] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:19:54] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:19:55] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:19:55] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:19:56] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:19:56] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:19:57] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:19:57] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:19:57] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/531 variables, and 771 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 195/195 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 268/278 places, 263/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60348 ms. Remains : 268/278 places, 263/273 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-04
Product exploration explored 100000 steps with 3811 reset in 169 ms.
Product exploration explored 100000 steps with 3883 reset in 190 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/268 stabilizing places and 60/263 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 281 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (54 resets) in 194 ms. (205 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 1/1 properties
[2024-05-28 09:19:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 234/268 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:19:59] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:19:59] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:19:59] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:19:59] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 263/531 variables, 268/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:19:59] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:19:59] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:19:59] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/531 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 321 constraints, problems are : Problem set: 0 solved, 1 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 234/268 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:19:59] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:19:59] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:19:59] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:19:59] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:20:00] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:20:00] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:20:00] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 263/531 variables, 268/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:20:00] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/531 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 531/531 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints]
After SMT, in 1009ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 3 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 263/263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 268 transition count 238
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 243 transition count 238
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 50 place count 243 transition count 212
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 102 place count 217 transition count 212
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 274 place count 131 transition count 126
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 2 with 31 rules applied. Total rules applied 305 place count 131 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 306 place count 130 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 307 place count 129 transition count 125
Applied a total of 307 rules in 29 ms. Remains 129 /268 variables (removed 139) and now considering 125/263 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 129/268 places, 125/263 transitions.
RANDOM walk for 40000 steps (72 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (16 resets) in 112 ms. (354 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1657475 steps, run timeout after 3001 ms. (steps per millisecond=552 ) properties seen :0 out of 1
Probabilistic random walk after 1657475 steps, saw 316286 distinct states, run finished after 3005 ms. (steps per millisecond=551 ) properties seen :0
// Phase 1: matrix 125 rows 129 cols
[2024-05-28 09:20:03] [INFO ] Computed 45 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:20:03] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/57 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/90 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/91 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/93 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/93 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 24/117 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/117 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/117 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 22/139 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/139 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/139 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/140 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/142 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 24/166 variables, 14/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/166 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:20:03] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:20:03] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/166 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/166 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 22/188 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/188 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/188 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 1/189 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/189 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/189 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/191 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/191 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 24/215 variables, 14/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/215 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/215 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 20/235 variables, 10/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/235 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/235 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 1/236 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/236 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/236 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 2/238 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/238 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 16/254 variables, 12/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/254 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/254 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 0/254 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 35/57 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/90 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/91 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/91 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/91 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/93 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/93 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 24/117 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/117 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/117 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/139 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/139 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/139 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/140 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/142 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/142 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 24/166 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/166 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/166 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:20:03] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/166 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/166 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/188 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/188 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/188 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 1/189 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/189 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/189 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 2/191 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/191 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 24/215 variables, 14/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/215 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/215 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 20/235 variables, 10/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/235 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/235 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 1/236 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/236 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/236 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 2/238 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/238 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 16/254 variables, 12/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/254 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:20:03] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/254 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/254 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 0/254 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 526ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 129/129 places, 125/125 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-28 09:20:04] [INFO ] Invariant cache hit.
[2024-05-28 09:20:04] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 09:20:04] [INFO ] Invariant cache hit.
[2024-05-28 09:20:04] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-28 09:20:04] [INFO ] Redundant transitions in 1 ms returned []
Running 123 sub problems to find dead transitions.
[2024-05-28 09:20:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:04] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:20:04] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:20:04] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-28 09:20:04] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:20:04] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:20:04] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:20:04] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:20:04] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-28 09:20:04] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 2/129 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:05] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:20:05] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:20:05] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:20:05] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:06] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 125/254 variables, 129/188 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:20:07] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 10/198 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:08] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:20:08] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:20:08] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:08] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:20:08] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:20:09] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:20:09] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:20:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:20:09] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:20:09] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:20:09] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:20:09] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 9/210 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:09] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:20:10] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:11] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:20:11] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:11] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:20:11] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/254 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:12] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/254 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:13] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:20:13] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:20:13] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:20:13] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:20:13] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/254 variables, 5/223 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:13] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:20:13] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:20:13] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:20:13] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:20:13] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/254 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:14] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:20:14] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:20:14] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/254 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:15] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:20:15] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:20:15] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/254 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:16] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/254 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/254 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:17] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/254 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/254 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 25 (OVERLAPS) 0/254 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 236 constraints, problems are : Problem set: 0 solved, 123 unsolved in 14716 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 59/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 2/129 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 125/254 variables, 129/236 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 123/359 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-05-28 09:20:22] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 360 constraints, problems are : Problem set: 0 solved, 123 unsolved in 14863 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 63/63 constraints]
After SMT, in 29600ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 29601ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29803 ms. Remains : 129/129 places, 125/125 transitions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (F p0), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p2), (F (NOT (OR p2 (NOT p0) p1))), (F p1)]
Knowledge based reduction with 11 factoid took 421 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 262 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 263 rows 268 cols
[2024-05-28 09:20:34] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 09:20:34] [INFO ] [Real]Absence check using 46 positive place invariants in 10 ms returned sat
[2024-05-28 09:20:35] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-28 09:20:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:20:35] [INFO ] [Nat]Absence check using 46 positive place invariants in 10 ms returned sat
[2024-05-28 09:20:35] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2024-05-28 09:20:35] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:20:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-05-28 09:20:35] [INFO ] Computed and/alt/rep : 262/588/262 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-28 09:20:37] [INFO ] Added : 252 causal constraints over 52 iterations in 1703 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-28 09:20:37] [INFO ] Invariant cache hit.
[2024-05-28 09:20:37] [INFO ] [Real]Absence check using 46 positive place invariants in 10 ms returned sat
[2024-05-28 09:20:37] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2024-05-28 09:20:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:20:37] [INFO ] [Nat]Absence check using 46 positive place invariants in 11 ms returned sat
[2024-05-28 09:20:37] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-28 09:20:37] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:20:37] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:20:37] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:20:37] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:20:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 193 ms
[2024-05-28 09:20:37] [INFO ] Computed and/alt/rep : 262/588/262 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-28 09:20:39] [INFO ] Added : 210 causal constraints over 42 iterations in 1403 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 263/263 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 267 transition count 238
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 243 transition count 238
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 48 place count 243 transition count 212
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 100 place count 217 transition count 212
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 268 place count 133 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 270 place count 131 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 271 place count 130 transition count 126
Applied a total of 271 rules in 19 ms. Remains 130 /268 variables (removed 138) and now considering 126/263 (removed 137) transitions.
// Phase 1: matrix 126 rows 130 cols
[2024-05-28 09:20:39] [INFO ] Computed 45 invariants in 0 ms
[2024-05-28 09:20:39] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 09:20:39] [INFO ] Invariant cache hit.
[2024-05-28 09:20:39] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-28 09:20:39] [INFO ] Redundant transitions in 24 ms returned [125]
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 122 sub problems to find dead transitions.
// Phase 1: matrix 125 rows 130 cols
[2024-05-28 09:20:39] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:20:39] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:20:39] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:20:40] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:20:40] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:20:40] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:20:40] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:20:40] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:20:40] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:20:40] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:20:40] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 09:20:40] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:20:40] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:20:40] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:20:40] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 3/130 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:20:41] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:20:41] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:20:41] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:20:41] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:20:41] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:20:41] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-28 09:20:41] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-28 09:20:41] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-28 09:20:42] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:20:42] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 125/255 variables, 130/199 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:20:42] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:20:42] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:20:42] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:20:43] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:20:43] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:20:43] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:20:43] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 7/206 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:20:43] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/255 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 207 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5757 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 26/65 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 3/130 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:20:45] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:20:45] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 125/255 variables, 130/209 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 122/331 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:20:47] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/255 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:20:54] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:20:56] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/255 variables, 2/334 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:21:01] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:21:03] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:21:03] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/255 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:21:11] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 255/255 variables, and 338 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 41/41 constraints]
After SMT, in 35792ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 35794ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/268 places, 125/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36022 ms. Remains : 130/268 places, 125/263 transitions.
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/130 stabilizing places and 3/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p1)), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 p0 (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 10 factoid took 738 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40000 steps (132 resets) in 154 ms. (258 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (16 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
[2024-05-28 09:21:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:21:16] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/54 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/87 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/88 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/90 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/90 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 22/112 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/112 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/112 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/115 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/115 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 23/138 variables, 13/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/138 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1/139 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/139 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/141 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/141 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 24/165 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/165 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/165 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 2/167 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/167 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 20/187 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/187 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/187 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 1/188 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/188 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/188 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 2/190 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/190 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 24/214 variables, 12/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/214 variables, 3/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/214 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 2/216 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/216 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/216 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 20/236 variables, 10/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/236 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/236 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 1/237 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/237 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/237 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 2/239 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/239 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 16/255 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/255 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:21:16] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:21:16] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/255 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/255 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 0/255 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/54 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/87 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/88 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/88 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/90 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/90 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 22/112 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/112 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/112 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/115 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/115 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 23/138 variables, 13/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/138 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/138 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/139 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/139 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/139 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/141 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/141 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 24/165 variables, 12/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/165 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/165 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2/167 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/167 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/167 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 20/187 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/187 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/187 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 1/188 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/188 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/188 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 2/190 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/190 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 24/214 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/214 variables, 3/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/214 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 2/216 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/216 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/216 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 20/236 variables, 10/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/236 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/236 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 1/237 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/237 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/237 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 2/239 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/239 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 16/255 variables, 12/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/255 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/255 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/255 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 0/255 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 482ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 125/125 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 130 transition count 124
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 129 transition count 124
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 0 with 27 rules applied. Total rules applied 29 place count 129 transition count 124
Applied a total of 29 rules in 6 ms. Remains 129 /130 variables (removed 1) and now considering 124/125 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 129/130 places, 124/125 transitions.
RANDOM walk for 40000 steps (68 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (16 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1696356 steps, run timeout after 3001 ms. (steps per millisecond=565 ) properties seen :0 out of 1
Probabilistic random walk after 1696356 steps, saw 350694 distinct states, run finished after 3001 ms. (steps per millisecond=565 ) properties seen :0
// Phase 1: matrix 124 rows 129 cols
[2024-05-28 09:21:20] [INFO ] Computed 45 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:21:20] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/56 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/89 variables, 19/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:21:20] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/90 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/90 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/92 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/92 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 24/116 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/116 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/116 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/138 variables, 10/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/138 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/138 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/139 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/139 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/139 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 2/141 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/141 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 24/165 variables, 14/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/165 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/165 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 22/187 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/187 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/187 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 1/188 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/188 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/188 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/190 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/190 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 24/214 variables, 14/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/214 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/214 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 20/234 variables, 10/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/234 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/234 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 1/235 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/235 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/235 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 2/237 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/237 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 16/253 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/253 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/253 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 0/253 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 129/129 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/22 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 34/56 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/89 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 09:21:20] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/89 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/89 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/90 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/90 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/90 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/92 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/92 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 24/116 variables, 14/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/116 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/116 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 22/138 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/138 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/139 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/139 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/139 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 2/141 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/141 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 24/165 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/165 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/165 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/187 variables, 10/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/187 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/187 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 1/188 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/188 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/188 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 2/190 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/190 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 24/214 variables, 14/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/214 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/214 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 20/234 variables, 10/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/234 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/234 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 1/235 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/235 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/235 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 2/237 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/237 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 16/253 variables, 12/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/253 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/253 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 0/253 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 446ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 129/129 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-28 09:21:20] [INFO ] Invariant cache hit.
[2024-05-28 09:21:20] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 09:21:20] [INFO ] Invariant cache hit.
[2024-05-28 09:21:20] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-28 09:21:20] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-28 09:21:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:21:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:21:21] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:21:21] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 09:21:21] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:21:21] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:21:21] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:21:21] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:21:21] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 2/129 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:21:22] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:21:22] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:21:22] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:21:22] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 124/253 variables, 129/186 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:21:23] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:21:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:21:23] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:21:24] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 0/253 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 190 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5034 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 2/129 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 124/253 variables, 129/190 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 122/312 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:21:27] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:21:27] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:21:27] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:21:29] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:21:29] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 5/317 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:21:32] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:21:32] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:21:32] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:21:32] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:21:34] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:21:34] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:21:34] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 3/324 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:21:37] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:21:46] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:21:46] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/253 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:21:51] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:21:51] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:21:53] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:21:53] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:21:53] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:21:53] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/253 variables, 6/333 constraints. Problems are: Problem set: 0 solved, 122 unsolved
[2024-05-28 09:21:55] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:21:55] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 253/253 variables, and 335 constraints, problems are : Problem set: 0 solved, 122 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 39/39 constraints]
After SMT, in 35075ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 35076ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35284 ms. Remains : 129/129 places, 124/124 transitions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT p1)), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p2 p0 (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p2 (NOT p1) (NOT p0)))), (F (NOT (OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))))), (F (NOT (OR (NOT p2) p1 (NOT p0)))), (F p0), (F p2), (F (NOT (OR p2 p1 (NOT p0)))), (F p1)]
Knowledge based reduction with 10 factoid took 996 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 325 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 310 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 125 rows 130 cols
[2024-05-28 09:21:57] [INFO ] Computed 45 invariants in 3 ms
[2024-05-28 09:21:57] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 09:21:57] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-28 09:21:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:21:57] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 09:21:57] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-28 09:21:57] [INFO ] Computed and/alt/rep : 122/308/122 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 09:21:57] [INFO ] Added : 85 causal constraints over 17 iterations in 217 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-28 09:21:57] [INFO ] Invariant cache hit.
[2024-05-28 09:21:58] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 09:21:58] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-28 09:21:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:21:58] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 09:21:58] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-28 09:21:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:21:58] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:21:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2024-05-28 09:21:58] [INFO ] Computed and/alt/rep : 122/308/122 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-28 09:21:58] [INFO ] Added : 79 causal constraints over 16 iterations in 218 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 33341 reset in 150 ms.
Product exploration explored 100000 steps with 33351 reset in 173 ms.
Built C files in :
/tmp/ltsmin15661818551203524345
[2024-05-28 09:21:59] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2024-05-28 09:21:59] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:21:59] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2024-05-28 09:21:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:21:59] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2024-05-28 09:21:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:21:59] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15661818551203524345
Running compilation step : cd /tmp/ltsmin15661818551203524345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 321 ms.
Running link step : cd /tmp/ltsmin15661818551203524345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin15661818551203524345;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1382142370981482938.hoa' '--buchi-type=spotba'
LTSmin run took 149 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-005B-LTLFireability-04 finished in 181920 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))||G(p1)||F(p2)))'
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 268 transition count 263
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 268 transition count 263
Applied a total of 20 rules in 9 ms. Remains 268 /278 variables (removed 10) and now considering 263/273 (removed 10) transitions.
// Phase 1: matrix 263 rows 268 cols
[2024-05-28 09:21:59] [INFO ] Computed 46 invariants in 3 ms
[2024-05-28 09:21:59] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 09:21:59] [INFO ] Invariant cache hit.
[2024-05-28 09:22:00] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-28 09:22:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:02] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:22:02] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:22:02] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:22:02] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 2 ms to minimize.
[2024-05-28 09:22:02] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:22:02] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:22:02] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:22:02] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:22:02] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:22:02] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-28 09:22:03] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:22:04] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:22:05] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:22:05] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:22:05] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:22:05] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:22:05] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:22:05] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:22:05] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:22:05] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:06] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:22:06] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:22:07] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:22:08] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:22:09] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:22:10] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:22:10] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:10] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:22:10] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:22:11] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 13/139 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:13] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 09:22:14] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:22:14] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:22:14] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:22:14] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:22:14] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 6/145 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:15] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:22:15] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:22:15] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:22:17] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:19] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2024-05-28 09:22:20] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:22:20] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:22:20] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 4/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:21] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-28 09:22:21] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:22:21] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:22:22] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 13/169 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:23] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:26] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/268 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 15 (OVERLAPS) 263/531 variables, 268/439 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/531 variables, and 439 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 125/125 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 125/171 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:31] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:22:32] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:22:32] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:33] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/531 variables, 268/443 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 262/705 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:37] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:22:39] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:22:39] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-28 09:22:39] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-28 09:22:39] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-28 09:22:40] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:22:40] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2024-05-28 09:22:40] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-28 09:22:40] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-28 09:22:40] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:22:41] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:22:41] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:22:41] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2024-05-28 09:22:41] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:22:41] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:22:41] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:22:41] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:22:41] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:22:41] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:22:41] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 20/725 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:46] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-28 09:22:47] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-28 09:22:47] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-28 09:22:47] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-05-28 09:22:47] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 1 ms to minimize.
[2024-05-28 09:22:47] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-05-28 09:22:48] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-05-28 09:22:48] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-28 09:22:48] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:22:48] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:22:49] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-05-28 09:22:49] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-28 09:22:49] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:22:49] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:22:50] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:22:50] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:22:50] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:22:50] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:22:50] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:22:51] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 20/745 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:22:58] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 2 ms to minimize.
[2024-05-28 09:22:58] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-28 09:22:59] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:22:59] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:22:59] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/531 variables, and 750 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 174/174 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60068ms
Starting structural reductions in LTL mode, iteration 1 : 268/278 places, 263/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60360 ms. Remains : 268/278 places, 263/273 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-05
Product exploration explored 100000 steps with 1814 reset in 160 ms.
Product exploration explored 100000 steps with 1841 reset in 164 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/268 stabilizing places and 60/263 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 217 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (55 resets) in 115 ms. (344 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
[2024-05-28 09:23:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 22/531 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 4/46 constraints, State Equation: 0/268 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F p0), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 16 factoid took 479 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-28 09:23:01] [INFO ] Invariant cache hit.
[2024-05-28 09:23:02] [INFO ] [Real]Absence check using 46 positive place invariants in 11 ms returned sat
[2024-05-28 09:23:02] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2024-05-28 09:23:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:23:02] [INFO ] [Nat]Absence check using 46 positive place invariants in 11 ms returned sat
[2024-05-28 09:23:02] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2024-05-28 09:23:02] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:23:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-28 09:23:02] [INFO ] Computed and/alt/rep : 262/588/262 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-28 09:23:05] [INFO ] Added : 261 causal constraints over 53 iterations in 2351 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 268 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 : 268/268 places, 263/263 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 267 transition count 238
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 243 transition count 238
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 48 place count 243 transition count 211
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 102 place count 216 transition count 211
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 272 place count 131 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 274 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 275 place count 128 transition count 124
Applied a total of 275 rules in 21 ms. Remains 128 /268 variables (removed 140) and now considering 124/263 (removed 139) transitions.
// Phase 1: matrix 124 rows 128 cols
[2024-05-28 09:23:05] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 09:23:05] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 09:23:05] [INFO ] Invariant cache hit.
[2024-05-28 09:23:05] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-28 09:23:05] [INFO ] Redundant transitions in 22 ms returned [123]
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 120 sub problems to find dead transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 09:23:05] [INFO ] Computed 45 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:23:05] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:23:05] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:23:05] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:23:05] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:23:05] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:23:05] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:23:05] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:23:05] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:23:06] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:23:07] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/199 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:23:08] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:23:08] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:23:08] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:23:08] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/251 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:23:10] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:23:10] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/251 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:23:10] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:23:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:23:12] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:23:12] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:23:12] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:23:12] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/251 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:23:13] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:23:13] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:23:13] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/251 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:23:14] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:23:14] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:23:14] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:23:14] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/251 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:23:15] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:23:15] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/251 variables, 2/220 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/251 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 20 (OVERLAPS) 0/251 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 220 constraints, problems are : Problem set: 0 solved, 120 unsolved in 11520 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 47/87 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:23:16] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:23:16] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:23:17] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 2/128 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/223 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 120/343 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:23:18] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:23:18] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:23:18] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:23:18] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:23:18] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 5/348 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:23:23] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:23:30] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:23:30] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:23:30] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/251 variables, 3/352 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/251 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 352 constraints, problems are : Problem set: 0 solved, 120 unsolved in 25007 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 59/59 constraints]
After SMT, in 36546ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 36548ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/268 places, 123/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36780 ms. Remains : 128/268 places, 123/263 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/128 stabilizing places and 4/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 493 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (137 resets) in 130 ms. (305 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
[2024-05-28 09:23:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 11/251 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 4/45 constraints, State Equation: 0/128 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 (NOT p2)))), (F p0), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 696 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-28 09:23:43] [INFO ] Invariant cache hit.
[2024-05-28 09:23:43] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 09:23:43] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-28 09:23:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:23:43] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 09:23:43] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-28 09:23:43] [INFO ] Computed and/alt/rep : 119/294/119 causal constraints (skipped 1 transitions) in 7 ms.
[2024-05-28 09:23:44] [INFO ] Added : 104 causal constraints over 21 iterations in 254 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 24590 reset in 140 ms.
Product exploration explored 100000 steps with 24637 reset in 156 ms.
Built C files in :
/tmp/ltsmin422835581781266836
[2024-05-28 09:23:44] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2024-05-28 09:23:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:23:44] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2024-05-28 09:23:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:23:44] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2024-05-28 09:23:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:23:44] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin422835581781266836
Running compilation step : cd /tmp/ltsmin422835581781266836;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 294 ms.
Running link step : cd /tmp/ltsmin422835581781266836;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin422835581781266836;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7836143378263872106.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 121
Applied a total of 1 rules in 13 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 09:23:59] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 09:23:59] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-28 09:23:59] [INFO ] Invariant cache hit.
[2024-05-28 09:24:00] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-28 09:24:00] [INFO ] Redundant transitions in 25 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-28 09:24:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:00] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:24:00] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:24:00] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-05-28 09:24:00] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:24:00] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:24:00] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:24:00] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:24:00] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:24:00] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:24:00] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-05-28 09:24:00] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:24:00] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:24:01] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:01] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:24:01] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:24:01] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 1/126 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:02] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:24:02] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:24:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-28 09:24:02] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 121/247 variables, 126/191 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:03] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:24:03] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:24:03] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:24:03] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:24:03] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 5/196 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:03] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:04] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:24:04] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:04] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:24:04] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:24:05] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:24:05] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:05] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:24:05] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:24:05] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:06] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:24:06] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:07] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/247 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:08] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:24:08] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:24:08] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/247 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:09] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/247 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:09] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:24:09] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:24:10] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:24:10] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:24:10] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:24:10] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:24:10] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:24:10] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:24:10] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/247 variables, 9/222 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:10] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:24:10] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:24:10] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/247 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:11] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:24:11] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/247 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:24:12] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:24:12] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:24:12] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/247 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/247 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 24 (OVERLAPS) 0/247 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 230 constraints, problems are : Problem set: 0 solved, 119 unsolved in 13909 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 58/99 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 121/247 variables, 126/230 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 119/349 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/247 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 349 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4749 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 59/59 constraints]
After SMT, in 18674ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 18676ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/128 places, 121/123 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18902 ms. Remains : 126/128 places, 121/123 transitions.
Built C files in :
/tmp/ltsmin16067514887160349062
[2024-05-28 09:24:18] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2024-05-28 09:24:18] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:24:18] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2024-05-28 09:24:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:24:18] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2024-05-28 09:24:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:24:18] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16067514887160349062
Running compilation step : cd /tmp/ltsmin16067514887160349062;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 298 ms.
Running link step : cd /tmp/ltsmin16067514887160349062;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16067514887160349062;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8563145238811465443.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 09:24:33] [INFO ] Flatten gal took : 14 ms
[2024-05-28 09:24:33] [INFO ] Flatten gal took : 6 ms
[2024-05-28 09:24:33] [INFO ] Time to serialize gal into /tmp/LTL18060585016942666768.gal : 2 ms
[2024-05-28 09:24:33] [INFO ] Time to serialize properties into /tmp/LTL3678286849483089663.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18060585016942666768.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12671683744109071730.hoa' '-atoms' '/tmp/LTL3678286849483089663.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3678286849483089663.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12671683744109071730.hoa
Detected timeout of ITS tools.
[2024-05-28 09:24:48] [INFO ] Flatten gal took : 15 ms
[2024-05-28 09:24:48] [INFO ] Flatten gal took : 10 ms
[2024-05-28 09:24:48] [INFO ] Time to serialize gal into /tmp/LTL1765849541997112259.gal : 2 ms
[2024-05-28 09:24:48] [INFO ] Time to serialize properties into /tmp/LTL7376756095402836216.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1765849541997112259.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7376756095402836216.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((X(F("(p251==1)")))||(G("(p159==1)")))||(F("((p255==1)&&(p280==1))"))))
Formula 0 simplified : XG!"(p251==1)" & F!"(p159==1)" & G!"((p255==1)&&(p280==1))"
Detected timeout of ITS tools.
[2024-05-28 09:25:04] [INFO ] Flatten gal took : 13 ms
[2024-05-28 09:25:04] [INFO ] Applying decomposition
[2024-05-28 09:25:04] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13015424749467251562.txt' '-o' '/tmp/graph13015424749467251562.bin' '-w' '/tmp/graph13015424749467251562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13015424749467251562.bin' '-l' '-1' '-v' '-w' '/tmp/graph13015424749467251562.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:25:04] [INFO ] Decomposing Gal with order
[2024-05-28 09:25:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:25:04] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-28 09:25:04] [INFO ] Flatten gal took : 13 ms
[2024-05-28 09:25:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 3 ms.
[2024-05-28 09:25:04] [INFO ] Time to serialize gal into /tmp/LTL14843310508663550594.gal : 2 ms
[2024-05-28 09:25:04] [INFO ] Time to serialize properties into /tmp/LTL283550433162289530.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14843310508663550594.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL283550433162289530.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((((X(F("(i4.i0.u38.p251==1)")))||(G("(i2.i0.u24.p159==1)")))||(F("((i4.i0.u40.p255==1)&&(i4.i0.u44.p280==1))"))))
Formula 0 simplified : XG!"(i4.i0.u38.p251==1)" & F!"(i2.i0.u24.p159==1)" & G!"((i4.i0.u40.p255==1)&&(i4.i0.u44.p280==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-05 finished in 199444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 277 transition count 246
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 251 transition count 246
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 251 transition count 220
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 225 transition count 220
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 114 place count 215 transition count 210
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 215 transition count 210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 124 place count 215 transition count 206
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 132 place count 211 transition count 206
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 298 place count 128 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 300 place count 126 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 301 place count 125 transition count 121
Applied a total of 301 rules in 23 ms. Remains 125 /278 variables (removed 153) and now considering 121/273 (removed 152) transitions.
// Phase 1: matrix 121 rows 125 cols
[2024-05-28 09:25:19] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 09:25:19] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 09:25:19] [INFO ] Invariant cache hit.
[2024-05-28 09:25:19] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-28 09:25:19] [INFO ] Redundant transitions in 20 ms returned [120]
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 119 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-05-28 09:25:19] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:25:19] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:25:19] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:25:19] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:25:19] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:25:19] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:25:19] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:25:19] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:25:20] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:25:20] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:25:20] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:25:20] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:25:20] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-05-28 09:25:20] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:25:20] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:25:20] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:25:20] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:25:20] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:25:20] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/245 variables, 125/188 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:25:21] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:25:21] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:25:21] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:25:21] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:25:21] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:25:21] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:25:22] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:25:22] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:25:22] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:25:23] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:25:23] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 199 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5360 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 29/74 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:25:24] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:25:24] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-28 09:25:24] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:25:25] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/245 variables, 125/203 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 119/322 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:25:28] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:25:28] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/245 variables, 2/324 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:25:31] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:25:31] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:25:38] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/245 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 327 constraints, problems are : Problem set: 0 solved, 119 unsolved in 20013 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 38/38 constraints]
After SMT, in 25391ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 25392ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/278 places, 120/273 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25618 ms. Remains : 125/278 places, 120/273 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-06
Stuttering criterion allowed to conclude after 266 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-06 finished in 25679 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((G(p1)||p0)))'
Support contains 5 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 277 transition count 246
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 251 transition count 246
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 52 place count 251 transition count 221
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 102 place count 226 transition count 221
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 216 transition count 211
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 216 transition count 211
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 122 place count 216 transition count 207
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 130 place count 212 transition count 207
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 292 place count 131 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 294 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 128 transition count 124
Applied a total of 295 rules in 17 ms. Remains 128 /278 variables (removed 150) and now considering 124/273 (removed 149) transitions.
// Phase 1: matrix 124 rows 128 cols
[2024-05-28 09:25:44] [INFO ] Computed 45 invariants in 0 ms
[2024-05-28 09:25:45] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-28 09:25:45] [INFO ] Invariant cache hit.
[2024-05-28 09:25:45] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-05-28 09:25:45] [INFO ] Redundant transitions in 21 ms returned [123]
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 120 sub problems to find dead transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 09:25:45] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:25:45] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:25:46] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 2/128 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:25:47] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:25:47] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:25:47] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:25:47] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:25:47] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:25:47] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:25:47] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 123/251 variables, 128/195 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:25:48] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2024-05-28 09:25:49] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:25:49] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:25:49] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:25:49] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:25:50] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:25:51] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:25:52] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 16 (OVERLAPS) 0/251 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 207 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8519 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 120/327 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:25:54] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:25:55] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:25:56] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:25:58] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:25:58] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:02] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:04] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:26:04] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:26:05] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:26:05] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 4/337 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:08] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:18] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:26:19] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/251 variables, 2/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:22] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:26:22] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 251/251 variables, and 342 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 49/49 constraints]
After SMT, in 38548ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 38549ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/278 places, 123/273 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38967 ms. Remains : 128/278 places, 123/273 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-07
Entered a terminal (fully accepting) state of product in 790 steps with 2 reset in 5 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-07 finished in 39071 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))'
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 277 transition count 246
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 251 transition count 246
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 251 transition count 220
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 225 transition count 220
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 114 place count 215 transition count 210
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 215 transition count 210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 124 place count 215 transition count 206
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 132 place count 211 transition count 206
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 294 place count 130 transition count 125
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 296 place count 128 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 297 place count 127 transition count 123
Applied a total of 297 rules in 27 ms. Remains 127 /278 variables (removed 151) and now considering 123/273 (removed 150) transitions.
// Phase 1: matrix 123 rows 127 cols
[2024-05-28 09:26:23] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 09:26:24] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 09:26:24] [INFO ] Invariant cache hit.
[2024-05-28 09:26:24] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-28 09:26:24] [INFO ] Redundant transitions in 17 ms returned [122]
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 120 sub problems to find dead transitions.
// Phase 1: matrix 122 rows 127 cols
[2024-05-28 09:26:24] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:24] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:26:24] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:26:24] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:26:24] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 1 ms to minimize.
[2024-05-28 09:26:24] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:26:24] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:26:24] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:26:24] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:26:24] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:26:24] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:26:25] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:25] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 1/127 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:26] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:26:26] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:26:26] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:26:26] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:26:26] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:26:26] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:26:26] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:26:26] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:26:26] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:26] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 122/249 variables, 127/194 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:27] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:26:27] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:26:27] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:26:27] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:28] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:29] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:26:29] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:26:29] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:26:29] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:26:29] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:29] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:26:29] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:30] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:30] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:26:31] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:31] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:26:31] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:26:32] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:26:32] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/249 variables, 3/214 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:32] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:26:32] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:26:32] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:26:33] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:26:33] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:26:33] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/249 variables, 6/220 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:33] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:26:33] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-28 09:26:33] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/249 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/249 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:35] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:26:35] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:26:35] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/249 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/249 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 22 (OVERLAPS) 0/249 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 226 constraints, problems are : Problem set: 0 solved, 120 unsolved in 12777 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 52/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:37] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 1/127 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 122/249 variables, 127/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 120/347 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/249 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 347 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4881 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 55/55 constraints]
After SMT, in 17678ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 17680ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/278 places, 122/273 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17910 ms. Remains : 127/278 places, 122/273 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-08
Product exploration explored 100000 steps with 354 reset in 252 ms.
Product exploration explored 100000 steps with 352 reset in 282 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 41 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (138 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 22460 steps (9 resets) in 40 ms. (547 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-005B-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-005B-LTLFireability-08 finished in 18819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 277 transition count 247
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 252 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 251 transition count 246
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 52 place count 251 transition count 220
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 104 place count 225 transition count 220
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 114 place count 215 transition count 210
Iterating global reduction 3 with 10 rules applied. Total rules applied 124 place count 215 transition count 210
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 124 place count 215 transition count 207
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 130 place count 212 transition count 207
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 292 place count 131 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 294 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 295 place count 128 transition count 124
Applied a total of 295 rules in 26 ms. Remains 128 /278 variables (removed 150) and now considering 124/273 (removed 149) transitions.
// Phase 1: matrix 124 rows 128 cols
[2024-05-28 09:26:42] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 09:26:42] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 09:26:42] [INFO ] Invariant cache hit.
[2024-05-28 09:26:42] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-28 09:26:42] [INFO ] Redundant transitions in 19 ms returned [123]
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 120 sub problems to find dead transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 09:26:42] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:43] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 2/128 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:44] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:26:44] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:26:44] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:26:44] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:26:44] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:26:44] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:26:44] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:26:44] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2024-05-28 09:26:45] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:26:45] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:45] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:26:45] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:26:45] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:26:45] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:26:45] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:26:45] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:26:45] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:46] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 123/251 variables, 128/200 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:47] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:47] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:26:47] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:26:47] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:26:47] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:48] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:26:48] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:26:48] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:26:48] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:49] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:26:49] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (OVERLAPS) 0/251 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 211 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7841 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 36/69 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:51] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:26:51] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:26:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 123/251 variables, 128/214 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 120/334 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:52] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:54] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:26:54] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:26:55] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 13 (OVERLAPS) 0/251 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 338 constraints, problems are : Problem set: 0 solved, 120 unsolved in 9095 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 45/45 constraints]
After SMT, in 16954ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 16955ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/278 places, 123/273 transitions.
Applied a total of 0 rules in 21 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17191 ms. Remains : 128/278 places, 123/273 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-09
Product exploration explored 100000 steps with 508 reset in 239 ms.
Product exploration explored 100000 steps with 515 reset in 259 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/128 stabilizing places and 4/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 470 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 105 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 1128 steps (4 resets) in 8 ms. (125 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 525 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 :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 09:27:01] [INFO ] Invariant cache hit.
[2024-05-28 09:27:01] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 09:27:01] [INFO ] Invariant cache hit.
[2024-05-28 09:27:01] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-28 09:27:01] [INFO ] Redundant transitions in 16 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-28 09:27:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:02] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:27:02] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:27:02] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:27:02] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:27:02] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:27:02] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:27:02] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:27:02] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:02] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 2/128 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:03] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:27:03] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:27:03] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:27:03] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:27:03] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:27:04] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:27:04] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-28 09:27:04] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 1 ms to minimize.
[2024-05-28 09:27:04] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:27:04] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:04] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:27:04] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:27:04] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:27:04] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:27:04] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:27:04] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:27:04] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:05] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 123/251 variables, 128/200 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:06] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:06] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:27:06] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:27:06] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:27:06] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:07] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:27:07] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-28 09:27:07] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-28 09:27:07] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:08] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:27:08] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (OVERLAPS) 0/251 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 211 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7794 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 36/69 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 120/331 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:11] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:27:11] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 333 constraints, problems are : Problem set: 0 solved, 120 unsolved in 6294 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 40/40 constraints]
After SMT, in 14116ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 14118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14337 ms. Remains : 128/128 places, 123/123 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/128 stabilizing places and 4/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 416 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 75 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 1470 steps (5 resets) in 15 ms. (91 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 435 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 :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 497 reset in 231 ms.
Product exploration explored 100000 steps with 504 reset in 252 ms.
Built C files in :
/tmp/ltsmin16758776387711242947
[2024-05-28 09:27:17] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2024-05-28 09:27:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:27:17] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2024-05-28 09:27:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:27:17] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2024-05-28 09:27:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:27:17] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16758776387711242947
Running compilation step : cd /tmp/ltsmin16758776387711242947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 292 ms.
Running link step : cd /tmp/ltsmin16758776387711242947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16758776387711242947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10171430444699969840.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 09:27:32] [INFO ] Invariant cache hit.
[2024-05-28 09:27:32] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 09:27:32] [INFO ] Invariant cache hit.
[2024-05-28 09:27:33] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-28 09:27:33] [INFO ] Redundant transitions in 20 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-28 09:27:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:33] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:27:33] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:27:33] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:27:33] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:27:33] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:27:33] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:27:33] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:27:33] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:33] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 2/128 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:34] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:27:34] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:27:34] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:27:34] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:27:35] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:36] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 123/251 variables, 128/200 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:37] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:37] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:27:37] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:27:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:27:37] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 4/205 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:38] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:27:38] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:27:38] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:27:38] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:39] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:27:39] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (OVERLAPS) 0/251 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 211 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7866 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 36/69 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 123/251 variables, 128/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 120/331 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:27:42] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-05-28 09:27:42] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 2/333 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/251 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 333 constraints, problems are : Problem set: 0 solved, 120 unsolved in 6275 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 40/40 constraints]
After SMT, in 14169ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 14171ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14379 ms. Remains : 128/128 places, 123/123 transitions.
Built C files in :
/tmp/ltsmin4115134296865211125
[2024-05-28 09:27:47] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2024-05-28 09:27:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:27:47] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2024-05-28 09:27:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:27:47] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2024-05-28 09:27:47] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:27:47] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4115134296865211125
Running compilation step : cd /tmp/ltsmin4115134296865211125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 285 ms.
Running link step : cd /tmp/ltsmin4115134296865211125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4115134296865211125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13281257714639093171.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 09:28:02] [INFO ] Flatten gal took : 6 ms
[2024-05-28 09:28:02] [INFO ] Flatten gal took : 6 ms
[2024-05-28 09:28:02] [INFO ] Time to serialize gal into /tmp/LTL3634198685121388394.gal : 1 ms
[2024-05-28 09:28:02] [INFO ] Time to serialize properties into /tmp/LTL3493267164027318420.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3634198685121388394.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3985141149107416892.hoa' '-atoms' '/tmp/LTL3493267164027318420.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3493267164027318420.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3985141149107416892.hoa
Detected timeout of ITS tools.
[2024-05-28 09:28:17] [INFO ] Flatten gal took : 6 ms
[2024-05-28 09:28:17] [INFO ] Flatten gal took : 5 ms
[2024-05-28 09:28:17] [INFO ] Time to serialize gal into /tmp/LTL3990149917559684188.gal : 2 ms
[2024-05-28 09:28:17] [INFO ] Time to serialize properties into /tmp/LTL11558000494003652209.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3990149917559684188.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11558000494003652209.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(p209!=1)"))U(G("(p150!=1)"))))
Formula 0 simplified : G!"(p209!=1)" R F!"(p150!=1)"
Detected timeout of ITS tools.
[2024-05-28 09:28:32] [INFO ] Flatten gal took : 12 ms
[2024-05-28 09:28:32] [INFO ] Applying decomposition
[2024-05-28 09:28:32] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14325108084065029308.txt' '-o' '/tmp/graph14325108084065029308.bin' '-w' '/tmp/graph14325108084065029308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14325108084065029308.bin' '-l' '-1' '-v' '-w' '/tmp/graph14325108084065029308.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:28:32] [INFO ] Decomposing Gal with order
[2024-05-28 09:28:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:28:32] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-28 09:28:32] [INFO ] Flatten gal took : 10 ms
[2024-05-28 09:28:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 2 ms.
[2024-05-28 09:28:32] [INFO ] Time to serialize gal into /tmp/LTL7978101625527182680.gal : 2 ms
[2024-05-28 09:28:32] [INFO ] Time to serialize properties into /tmp/LTL12183900333301867594.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7978101625527182680.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12183900333301867594.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(i3.i0.u34.p209!=1)"))U(G("(i2.i0.u25.p150!=1)"))))
Formula 0 simplified : G!"(i3.i0.u34.p209!=1)" R F!"(i2.i0.u25.p150!=1)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-09 finished in 124877 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(F(p0)))))'
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 267 transition count 262
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 267 transition count 262
Applied a total of 22 rules in 6 ms. Remains 267 /278 variables (removed 11) and now considering 262/273 (removed 11) transitions.
// Phase 1: matrix 262 rows 267 cols
[2024-05-28 09:28:47] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 09:28:47] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 09:28:47] [INFO ] Invariant cache hit.
[2024-05-28 09:28:47] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-28 09:28:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 2 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:28:50] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:28:51] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:28:51] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-28 09:28:51] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-28 09:28:51] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-28 09:28:51] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:28:51] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:28:51] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:28:51] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-28 09:28:52] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:28:53] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:28:54] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:28:55] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:28:56] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:28:56] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:28:56] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:28:56] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:28:56] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:28:56] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:28:57] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:28:58] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-05-28 09:28:59] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:28:59] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:28:59] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:28:59] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:28:59] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:28:59] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:29:01] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-28 09:29:02] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:29:03] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:29:03] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:29:03] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:29:04] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 262/529 variables, 267/396 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:29:08] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:29:08] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:29:09] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:29:09] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:29:09] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:29:09] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:29:10] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:29:10] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-28 09:29:10] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:29:10] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:29:10] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 11/407 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:29:13] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:29:13] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:29:13] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:29:13] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:29:13] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:29:13] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:29:13] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:29:13] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:29:14] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:29:14] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:29:14] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:29:14] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:29:14] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:29:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:29:15] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:29:15] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:29:15] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:29:15] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 18/425 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:29:16] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:29:16] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:29:17] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:29:17] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:29:17] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:29:17] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:29:17] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:29:17] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:29:17] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:29:17] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/529 variables, and 435 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 122/122 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 122/168 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:29:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:29:19] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:29:19] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:29:19] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:29:19] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:29:20] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:29:20] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:29:21] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-28 09:29:21] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:29:22] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 262/529 variables, 267/445 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 261/706 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:29:26] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:29:26] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-28 09:29:27] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-05-28 09:29:27] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-28 09:29:27] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:29:27] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:29:27] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-28 09:29:27] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-28 09:29:27] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:29:28] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:29:28] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:29:28] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2024-05-28 09:29:28] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:29:28] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:29:29] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:29:29] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:29:29] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:29:29] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:29:29] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:29:29] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 20/726 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:29:33] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:29:34] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-28 09:29:34] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-28 09:29:35] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-28 09:29:35] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:29:35] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:29:35] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-28 09:29:36] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-05-28 09:29:36] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:29:36] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:29:36] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-05-28 09:29:37] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:29:37] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:29:37] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:29:37] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:29:37] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:29:37] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:29:38] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:29:38] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:29:38] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 20/746 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:29:44] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2024-05-28 09:29:45] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:29:45] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:29:45] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:29:46] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:29:46] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:29:46] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:29:46] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:29:47] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:29:47] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/529 variables, and 756 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 182/182 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 267/278 places, 262/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60344 ms. Remains : 267/278 places, 262/273 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-10
Product exploration explored 100000 steps with 1160 reset in 292 ms.
Product exploration explored 100000 steps with 1165 reset in 226 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 346 steps (0 resets) in 5 ms. (57 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 09:29:49] [INFO ] Invariant cache hit.
[2024-05-28 09:29:49] [INFO ] [Real]Absence check using 46 positive place invariants in 11 ms returned sat
[2024-05-28 09:29:49] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-05-28 09:29:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:29:49] [INFO ] [Nat]Absence check using 46 positive place invariants in 11 ms returned sat
[2024-05-28 09:29:49] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2024-05-28 09:29:50] [INFO ] Computed and/alt/rep : 261/587/261 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-28 09:29:51] [INFO ] Added : 238 causal constraints over 49 iterations in 1663 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 262/262 transitions.
Applied a total of 0 rules in 3 ms. Remains 267 /267 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-28 09:29:51] [INFO ] Invariant cache hit.
[2024-05-28 09:29:51] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-28 09:29:51] [INFO ] Invariant cache hit.
[2024-05-28 09:29:51] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-28 09:29:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:29:54] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:29:54] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:29:54] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:29:54] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:29:54] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:29:54] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:29:54] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-05-28 09:29:54] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:29:54] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-28 09:29:54] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:29:55] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:29:55] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:29:55] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:29:55] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-28 09:29:55] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:29:55] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-05-28 09:29:55] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:29:55] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:29:55] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:29:55] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:29:56] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:29:57] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:29:57] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:29:57] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:29:57] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:29:58] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:29:58] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-28 09:29:59] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:29:59] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:29:59] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:29:59] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:29:59] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 2 ms to minimize.
[2024-05-28 09:29:59] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:29:59] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:29:59] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:29:59] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:29:59] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:29:59] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:29:59] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:29:59] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:30:00] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:30:00] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:30:00] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:30:00] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:30:00] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:30:00] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:30:00] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:30:01] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:30:01] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:30:01] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:30:01] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:30:01] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:30:01] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:30:01] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:30:01] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:30:02] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:30:02] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:30:03] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:30:03] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:30:03] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:30:03] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:30:03] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:30:05] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-28 09:30:06] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:30:07] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:30:07] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:30:07] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:30:08] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 262/529 variables, 267/396 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:30:12] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:30:12] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:30:13] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:30:14] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:30:14] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:30:14] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:30:14] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:30:14] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 11/407 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:30:16] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:30:16] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:30:17] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:30:17] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:30:17] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:30:17] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:30:17] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:30:17] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:30:17] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:30:18] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:30:18] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:30:18] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:30:18] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:30:18] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:30:18] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:30:18] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:30:18] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:30:19] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 18/425 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:30:19] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:30:20] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:30:20] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:30:20] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:30:21] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:30:21] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:30:21] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:30:21] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:30:21] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:30:21] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/529 variables, and 435 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 122/122 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 122/168 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:30:23] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:30:23] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:30:23] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:30:23] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:30:24] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:30:24] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:30:24] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:30:25] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 09:30:25] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:30:26] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 262/529 variables, 267/445 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 261/706 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:30:30] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-28 09:30:30] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-28 09:30:31] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2024-05-28 09:30:31] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-28 09:30:31] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:30:31] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:30:31] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-28 09:30:32] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:30:32] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:30:32] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:30:32] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:30:32] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:30:32] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:30:32] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-05-28 09:30:33] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:30:33] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:30:33] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:30:33] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:30:33] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:30:33] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 20/726 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:30:37] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:30:38] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-05-28 09:30:38] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-28 09:30:38] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 1 ms to minimize.
[2024-05-28 09:30:39] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:30:39] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:30:39] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-28 09:30:39] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 2 ms to minimize.
[2024-05-28 09:30:40] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-28 09:30:40] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:30:40] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-28 09:30:40] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2024-05-28 09:30:41] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:30:41] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:30:41] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:30:41] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:30:41] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:30:41] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:30:41] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:30:42] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 20/746 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:30:48] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-28 09:30:48] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:30:49] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:30:49] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:30:49] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:30:49] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:30:50] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:30:50] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:30:50] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:30:51] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:30:52] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
SMT process timed out in 60075ms, After SMT, problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Finished structural reductions in LTL mode , in 1 iterations and 60345 ms. Remains : 267/267 places, 262/262 transitions.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 306 steps (0 resets) in 6 ms. (43 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 09:30:52] [INFO ] Invariant cache hit.
[2024-05-28 09:30:52] [INFO ] [Real]Absence check using 46 positive place invariants in 10 ms returned sat
[2024-05-28 09:30:52] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2024-05-28 09:30:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:30:53] [INFO ] [Nat]Absence check using 46 positive place invariants in 11 ms returned sat
[2024-05-28 09:30:53] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2024-05-28 09:30:53] [INFO ] Computed and/alt/rep : 261/587/261 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-28 09:30:54] [INFO ] Added : 238 causal constraints over 49 iterations in 1665 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1157 reset in 156 ms.
Product exploration explored 100000 steps with 1152 reset in 165 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 262/262 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 267 transition count 262
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 24 place count 267 transition count 264
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 35 place count 267 transition count 264
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 1 with 104 rules applied. Total rules applied 139 place count 267 transition count 264
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 173 place count 233 transition count 230
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 207 place count 233 transition count 230
Deduced a syphon composed of 105 places in 0 ms
Applied a total of 207 rules in 52 ms. Remains 233 /267 variables (removed 34) and now considering 230/262 (removed 32) transitions.
[2024-05-28 09:30:55] [INFO ] Redundant transitions in 19 ms returned [229]
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 228 sub problems to find dead transitions.
// Phase 1: matrix 229 rows 233 cols
[2024-05-28 09:30:55] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 09:30:55] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-28 09:30:57] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-28 09:30:57] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-05-28 09:30:57] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-28 09:30:57] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-28 09:30:57] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-28 09:30:57] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
Problem TDEAD18 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
Problem TDEAD27 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 20/66 constraints. Problems are: Problem set: 70 solved, 158 unsolved
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-05-28 09:30:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-05-28 09:30:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
[2024-05-28 09:30:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-28 09:30:59] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-28 09:30:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Problem TDEAD70 is UNSAT
[2024-05-28 09:30:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
[2024-05-28 09:30:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD74 is UNSAT
[2024-05-28 09:30:59] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
[2024-05-28 09:30:59] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
[2024-05-28 09:30:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
[2024-05-28 09:30:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
[2024-05-28 09:30:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD149 is UNSAT
[2024-05-28 09:30:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD225 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 20/86 constraints. Problems are: Problem set: 106 solved, 122 unsolved
[2024-05-28 09:31:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD202 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 1/87 constraints. Problems are: Problem set: 107 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/87 constraints. Problems are: Problem set: 107 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 229/462 variables, 233/320 constraints. Problems are: Problem set: 107 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 3/323 constraints. Problems are: Problem set: 107 solved, 121 unsolved
[2024-05-28 09:31:02] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 1/324 constraints. Problems are: Problem set: 107 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/324 constraints. Problems are: Problem set: 107 solved, 121 unsolved
[2024-05-28 09:31:04] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/462 variables, 1/325 constraints. Problems are: Problem set: 107 solved, 121 unsolved
[2024-05-28 09:31:04] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:31:04] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 2/327 constraints. Problems are: Problem set: 107 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/327 constraints. Problems are: Problem set: 107 solved, 121 unsolved
At refinement iteration 13 (OVERLAPS) 0/462 variables, 0/327 constraints. Problems are: Problem set: 107 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 327 constraints, problems are : Problem set: 107 solved, 121 unsolved in 10857 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 233/233 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 107 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 107 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 106/233 variables, 46/46 constraints. Problems are: Problem set: 107 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 45/91 constraints. Problems are: Problem set: 107 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/91 constraints. Problems are: Problem set: 107 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 229/462 variables, 233/324 constraints. Problems are: Problem set: 107 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 3/327 constraints. Problems are: Problem set: 107 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 121/448 constraints. Problems are: Problem set: 107 solved, 121 unsolved
[2024-05-28 09:31:09] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:31:09] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 2/450 constraints. Problems are: Problem set: 107 solved, 121 unsolved
[2024-05-28 09:31:13] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:31:14] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:31:15] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:31:15] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 4/454 constraints. Problems are: Problem set: 107 solved, 121 unsolved
[2024-05-28 09:31:18] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:31:19] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 2/456 constraints. Problems are: Problem set: 107 solved, 121 unsolved
[2024-05-28 09:31:21] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:31:21] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 2/458 constraints. Problems are: Problem set: 107 solved, 121 unsolved
[2024-05-28 09:31:24] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 1/459 constraints. Problems are: Problem set: 107 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/459 constraints. Problems are: Problem set: 107 solved, 121 unsolved
At refinement iteration 13 (OVERLAPS) 0/462 variables, 0/459 constraints. Problems are: Problem set: 107 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 459 constraints, problems are : Problem set: 107 solved, 121 unsolved in 26858 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 233/233 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 121/228 constraints, Known Traps: 56/56 constraints]
After SMT, in 37755ms problems are : Problem set: 107 solved, 121 unsolved
Search for dead transitions found 107 dead transitions in 37759ms
Found 107 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 107 transitions
Dead transitions reduction (with SMT) removed 107 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 233/267 places, 122/262 transitions.
Graph (complete) has 441 edges and 233 vertex of which 128 are kept as prefixes of interest. Removing 105 places using SCC suffix rule.4 ms
Discarding 105 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 128 /233 variables (removed 105) and now considering 122/122 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/267 places, 122/262 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37850 ms. Remains : 128/267 places, 122/262 transitions.
Built C files in :
/tmp/ltsmin1092691235466345216
[2024-05-28 09:31:33] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1092691235466345216
Running compilation step : cd /tmp/ltsmin1092691235466345216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 470 ms.
Running link step : cd /tmp/ltsmin1092691235466345216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1092691235466345216;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17413681488316458744.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 262/262 transitions.
Applied a total of 0 rules in 4 ms. Remains 267 /267 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 267 cols
[2024-05-28 09:31:48] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 09:31:48] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 09:31:48] [INFO ] Invariant cache hit.
[2024-05-28 09:31:49] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-05-28 09:31:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:31:51] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:31:51] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:31:51] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:31:51] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:31:51] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:31:51] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:31:51] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:31:51] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 2 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:31:52] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:31:53] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:31:54] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-28 09:31:54] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:31:54] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:31:54] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:31:54] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:31:54] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:31:55] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:31:56] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:31:57] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:31:57] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:31:57] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:31:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:31:57] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:31:57] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:31:57] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:31:58] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:31:58] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:31:58] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:31:58] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:31:58] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:31:58] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:31:58] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:31:58] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:31:59] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:31:59] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:32:00] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:32:00] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:32:00] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:32:00] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:32:00] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:32:02] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:32:02] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:32:04] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:32:04] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:32:04] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:32:05] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 11 (OVERLAPS) 262/529 variables, 267/396 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:32:09] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:32:09] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:32:09] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:32:09] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:32:10] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:32:10] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:32:10] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:32:10] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-28 09:32:10] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:32:11] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:32:11] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/529 variables, 11/407 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:32:13] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:32:13] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:32:13] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:32:13] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:32:14] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:32:14] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:32:14] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 09:32:14] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:32:14] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:32:14] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:32:14] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:32:15] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:32:15] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:32:15] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:32:15] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:32:15] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:32:15] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:32:15] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 18/425 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:32:16] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 0 ms to minimize.
[2024-05-28 09:32:17] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-28 09:32:17] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:32:17] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:32:17] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:32:17] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-28 09:32:18] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-28 09:32:18] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:32:18] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:32:18] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 10/435 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/529 variables, and 435 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 122/122 constraints]
Escalating to Integer solving :Problem set: 0 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 122/168 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:32:20] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:32:20] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:32:21] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:32:21] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:32:21] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:32:21] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:32:21] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:32:22] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 09:32:22] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:32:23] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 6 (OVERLAPS) 262/529 variables, 267/445 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 261/706 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:32:27] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-28 09:32:27] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:32:28] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:32:28] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:32:28] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-28 09:32:28] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:32:28] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-28 09:32:29] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:32:29] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:32:29] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:32:29] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:32:29] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:32:29] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:32:29] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-28 09:32:30] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:32:30] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:32:30] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:32:30] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:32:30] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:32:30] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 20/726 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:32:35] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:32:35] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-28 09:32:36] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-28 09:32:36] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-28 09:32:36] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:32:36] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:32:36] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-28 09:32:37] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-28 09:32:37] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:32:37] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-05-28 09:32:38] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:32:38] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-28 09:32:38] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-28 09:32:38] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:32:38] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:32:38] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:32:39] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:32:39] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:32:39] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:32:39] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 20/746 constraints. Problems are: Problem set: 0 solved, 261 unsolved
[2024-05-28 09:32:45] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-28 09:32:46] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
[2024-05-28 09:32:47] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:32:47] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:32:47] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:32:47] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:32:47] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:32:48] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:32:48] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:32:48] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/529 variables, and 756 constraints, problems are : Problem set: 0 solved, 261 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 182/182 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 261 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Finished structural reductions in LTL mode , in 1 iterations and 60326 ms. Remains : 267/267 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin3629985944767204265
[2024-05-28 09:32:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3629985944767204265
Running compilation step : cd /tmp/ltsmin3629985944767204265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 474 ms.
Running link step : cd /tmp/ltsmin3629985944767204265;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3629985944767204265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17122622707794913250.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 09:33:04] [INFO ] Flatten gal took : 8 ms
[2024-05-28 09:33:04] [INFO ] Flatten gal took : 8 ms
[2024-05-28 09:33:04] [INFO ] Time to serialize gal into /tmp/LTL17924100847151706949.gal : 2 ms
[2024-05-28 09:33:04] [INFO ] Time to serialize properties into /tmp/LTL13323901792883256186.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17924100847151706949.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9654633127729034097.hoa' '-atoms' '/tmp/LTL13323901792883256186.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13323901792883256186.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9654633127729034097.hoa
Detected timeout of ITS tools.
[2024-05-28 09:33:19] [INFO ] Flatten gal took : 10 ms
[2024-05-28 09:33:19] [INFO ] Flatten gal took : 9 ms
[2024-05-28 09:33:19] [INFO ] Time to serialize gal into /tmp/LTL7499805771487700323.gal : 2 ms
[2024-05-28 09:33:19] [INFO ] Time to serialize properties into /tmp/LTL5554282960462662401.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7499805771487700323.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5554282960462662401.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(p99==1)"))))))
Formula 0 simplified : XXXG!"(p99==1)"
Detected timeout of ITS tools.
[2024-05-28 09:33:34] [INFO ] Flatten gal took : 12 ms
[2024-05-28 09:33:34] [INFO ] Applying decomposition
[2024-05-28 09:33:34] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16943006905514372665.txt' '-o' '/tmp/graph16943006905514372665.bin' '-w' '/tmp/graph16943006905514372665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16943006905514372665.bin' '-l' '-1' '-v' '-w' '/tmp/graph16943006905514372665.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:33:34] [INFO ] Decomposing Gal with order
[2024-05-28 09:33:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:33:34] [INFO ] Removed a total of 115 redundant transitions.
[2024-05-28 09:33:34] [INFO ] Flatten gal took : 14 ms
[2024-05-28 09:33:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 09:33:34] [INFO ] Time to serialize gal into /tmp/LTL1476216026148874442.gal : 3 ms
[2024-05-28 09:33:34] [INFO ] Time to serialize properties into /tmp/LTL6487969830844021652.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1476216026148874442.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6487969830844021652.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(i4.i0.u34.p99==1)"))))))
Formula 0 simplified : XXXG!"(i4.i0.u34.p99==1)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-10 finished in 301974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 277 transition count 246
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 251 transition count 246
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 251 transition count 220
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 225 transition count 220
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 114 place count 215 transition count 210
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 215 transition count 210
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 124 place count 215 transition count 207
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 130 place count 212 transition count 207
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 296 place count 129 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 298 place count 127 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 299 place count 126 transition count 122
Applied a total of 299 rules in 19 ms. Remains 126 /278 variables (removed 152) and now considering 122/273 (removed 151) transitions.
// Phase 1: matrix 122 rows 126 cols
[2024-05-28 09:33:49] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 09:33:49] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-28 09:33:49] [INFO ] Invariant cache hit.
[2024-05-28 09:33:49] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-28 09:33:49] [INFO ] Redundant transitions in 22 ms returned [121]
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 120 sub problems to find dead transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 09:33:49] [INFO ] Computed 45 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:33:50] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:33:51] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:33:51] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/247 variables, 126/190 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:33:52] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:33:52] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:33:52] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:33:52] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:33:52] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 5/195 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:33:52] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:33:52] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:33:53] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:33:53] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:33:53] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:33:53] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:33:53] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:33:53] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 6/203 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:33:54] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:33:54] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 1 ms to minimize.
[2024-05-28 09:33:54] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:33:55] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:33:56] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:33:56] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:33:56] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:33:57] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/247 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:33:57] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (OVERLAPS) 0/247 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 216 constraints, problems are : Problem set: 0 solved, 120 unsolved in 9522 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 45/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 121/247 variables, 126/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 120/336 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:00] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/247 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 337 constraints, problems are : Problem set: 0 solved, 120 unsolved in 16345 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 46/46 constraints]
After SMT, in 25891ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 25893ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/278 places, 121/273 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26124 ms. Remains : 126/278 places, 121/273 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-11
Product exploration explored 100000 steps with 1775 reset in 196 ms.
Product exploration explored 100000 steps with 1822 reset in 222 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 161 steps (0 resets) in 4 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 78 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 121/121 transitions.
Applied a total of 0 rules in 6 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-05-28 09:34:16] [INFO ] Invariant cache hit.
[2024-05-28 09:34:16] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-28 09:34:16] [INFO ] Invariant cache hit.
[2024-05-28 09:34:17] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-05-28 09:34:17] [INFO ] Redundant transitions in 23 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-28 09:34:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:17] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:34:17] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:34:17] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:34:17] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:34:17] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:34:17] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:34:17] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:34:17] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:34:17] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:34:17] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:34:17] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:34:17] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:34:18] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:34:18] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:34:18] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:34:18] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:34:18] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:18] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:34:18] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:34:18] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:34:18] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:34:18] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/247 variables, 126/193 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:19] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:34: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/247 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:19] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:34:19] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:34:20] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:34:20] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:21] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:21] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:22] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/247 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 0/247 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 202 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7291 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 31/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 121/247 variables, 126/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 120/322 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:25] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:34:25] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:34:25] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:34:25] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:34:25] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 5/327 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/247 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 327 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 36/36 constraints]
After SMT, in 12323ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 12325ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12741 ms. Remains : 126/126 places, 121/121 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 142 steps (0 resets) in 6 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1763 reset in 202 ms.
Product exploration explored 100000 steps with 1845 reset in 219 ms.
Built C files in :
/tmp/ltsmin6650253052463599276
[2024-05-28 09:34:30] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2024-05-28 09:34:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:34:30] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2024-05-28 09:34:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:34:30] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2024-05-28 09:34:30] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:34:30] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6650253052463599276
Running compilation step : cd /tmp/ltsmin6650253052463599276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 300 ms.
Running link step : cd /tmp/ltsmin6650253052463599276;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6650253052463599276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10578786948321792527.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 121/121 transitions.
Applied a total of 0 rules in 6 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-05-28 09:34:45] [INFO ] Invariant cache hit.
[2024-05-28 09:34:45] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 09:34:45] [INFO ] Invariant cache hit.
[2024-05-28 09:34:45] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-28 09:34:45] [INFO ] Redundant transitions in 21 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-28 09:34:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 17/62 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:46] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:34:47] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:34:47] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:34:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:34:47] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/247 variables, 126/193 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:48] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:34:48] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:48] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:34:48] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:34:48] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:34:48] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:49] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:49] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:51] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/247 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (OVERLAPS) 0/247 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 202 constraints, problems are : Problem set: 0 solved, 120 unsolved in 7243 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 31/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 121/247 variables, 126/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 120/322 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:34:53] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:34:53] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:34:53] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:34:54] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:34:54] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 5/327 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/247 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 327 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4965 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 36/36 constraints]
After SMT, in 12239ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 12242ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12467 ms. Remains : 126/126 places, 121/121 transitions.
Built C files in :
/tmp/ltsmin18179958621435850597
[2024-05-28 09:34:57] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2024-05-28 09:34:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:34:57] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2024-05-28 09:34:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:34:57] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2024-05-28 09:34:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:34:57] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18179958621435850597
Running compilation step : cd /tmp/ltsmin18179958621435850597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 281 ms.
Running link step : cd /tmp/ltsmin18179958621435850597;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18179958621435850597;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3851262313558282173.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 09:35:13] [INFO ] Flatten gal took : 5 ms
[2024-05-28 09:35:13] [INFO ] Flatten gal took : 4 ms
[2024-05-28 09:35:13] [INFO ] Time to serialize gal into /tmp/LTL1734200292389265766.gal : 1 ms
[2024-05-28 09:35:13] [INFO ] Time to serialize properties into /tmp/LTL2252543701033452982.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1734200292389265766.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5333920871342354327.hoa' '-atoms' '/tmp/LTL2252543701033452982.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2252543701033452982.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5333920871342354327.hoa
Detected timeout of ITS tools.
[2024-05-28 09:35:28] [INFO ] Flatten gal took : 4 ms
[2024-05-28 09:35:28] [INFO ] Flatten gal took : 4 ms
[2024-05-28 09:35:28] [INFO ] Time to serialize gal into /tmp/LTL6029646867766527829.gal : 1 ms
[2024-05-28 09:35:28] [INFO ] Time to serialize properties into /tmp/LTL17816584357742718198.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6029646867766527829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17816584357742718198.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p116==1)||(p89!=1))"))))
Formula 0 simplified : FG!"((p116==1)||(p89!=1))"
Detected timeout of ITS tools.
[2024-05-28 09:35:43] [INFO ] Flatten gal took : 11 ms
[2024-05-28 09:35:43] [INFO ] Applying decomposition
[2024-05-28 09:35:43] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2101616924219075807.txt' '-o' '/tmp/graph2101616924219075807.bin' '-w' '/tmp/graph2101616924219075807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2101616924219075807.bin' '-l' '-1' '-v' '-w' '/tmp/graph2101616924219075807.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:35:43] [INFO ] Decomposing Gal with order
[2024-05-28 09:35:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:35:43] [INFO ] Removed a total of 78 redundant transitions.
[2024-05-28 09:35:43] [INFO ] Flatten gal took : 8 ms
[2024-05-28 09:35:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 1 ms.
[2024-05-28 09:35:43] [INFO ] Time to serialize gal into /tmp/LTL10221355402000779757.gal : 2 ms
[2024-05-28 09:35:43] [INFO ] Time to serialize properties into /tmp/LTL4223359584593515247.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10221355402000779757.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4223359584593515247.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.i2.u18.p116==1)||(i1.i2.u14.p89!=1))"))))
Formula 0 simplified : FG!"((i1.i2.u18.p116==1)||(i1.i2.u14.p89!=1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-11 finished in 128728 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)))'
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 268 transition count 263
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 268 transition count 263
Applied a total of 20 rules in 7 ms. Remains 268 /278 variables (removed 10) and now considering 263/273 (removed 10) transitions.
// Phase 1: matrix 263 rows 268 cols
[2024-05-28 09:35:58] [INFO ] Computed 46 invariants in 4 ms
[2024-05-28 09:35:58] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-28 09:35:58] [INFO ] Invariant cache hit.
[2024-05-28 09:35:58] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-05-28 09:35:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:00] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:36:01] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:36:01] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:36:01] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2024-05-28 09:36:01] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 2 ms to minimize.
[2024-05-28 09:36:01] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:36:01] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-28 09:36:01] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:36:01] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-28 09:36:01] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:36:01] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:36:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:36:01] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 09:36:02] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:36:02] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-28 09:36:02] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:36:02] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:36:02] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:36:02] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:36:02] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:02] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-28 09:36:02] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:36:02] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:36:03] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:05] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:36:05] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:36:05] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:36:05] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:36:06] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:07] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:36:07] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-28 09:36:07] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-28 09:36:07] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-28 09:36:07] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:36:07] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:36:08] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:36:08] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:36:08] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:36:08] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:36:08] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-28 09:36:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:36:08] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:36:08] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-05-28 09:36:08] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:36:08] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:36:08] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:36:08] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 18/124 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:09] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-05-28 09:36:09] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:36:10] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-28 09:36:10] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:36:10] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:36:10] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:36:10] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:36:10] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:36:10] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:12] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:36:12] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-28 09:36:13] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:36:13] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:36:13] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:36:13] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 09:36:13] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-28 09:36:13] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:36:13] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:36:13] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 10/143 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:14] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:36:15] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:16] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 11 (OVERLAPS) 263/531 variables, 268/414 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:19] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:36:20] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:36:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:36:20] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:36:20] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:36:20] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:36:20] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:36:20] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:36:20] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:36:20] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:36:21] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:36:21] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:36:21] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:36:21] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-28 09:36:22] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:36:22] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:36:22] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:36:22] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:36:22] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:36:22] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 20/434 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:25] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:36:25] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-28 09:36:26] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:36:26] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:36:26] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:36:26] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:36:26] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-28 09:36:26] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:36:26] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/531 variables, 9/443 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:27] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:36:27] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:36:27] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-28 09:36:27] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:36:28] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:36:28] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:36:28] [INFO ] Deduced a trap composed of 33 places in 38 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 Real declared 531/531 variables, and 450 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 136/136 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 136/182 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:30] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:36:30] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:36:30] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:36:31] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:36:31] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 5/187 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:32] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:36:32] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:36:32] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:36:32] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:36:32] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:36:32] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 6/193 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:34] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:36:34] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:35] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:37] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (OVERLAPS) 263/531 variables, 268/465 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 262/727 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:41] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-28 09:36:41] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:36:43] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 09:36:43] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:36:43] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-28 09:36:43] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:36:44] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-28 09:36:44] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:36:44] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-28 09:36:44] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
[2024-05-28 09:36:44] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-05-28 09:36:45] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:36:46] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-28 09:36:46] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-28 09:36:46] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-28 09:36:46] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-05-28 09:36:47] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:36:47] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-28 09:36:49] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:36:49] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 20/747 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-28 09:36:55] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-28 09:36:55] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-28 09:36:56] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-28 09:36:57] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:36:57] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:36:57] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:36:58] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/531 variables, and 754 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 178/178 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 268/278 places, 263/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60341 ms. Remains : 268/278 places, 263/273 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-12 finished in 60494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 277 transition count 247
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 252 transition count 247
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 50 place count 252 transition count 221
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 102 place count 226 transition count 221
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 113 place count 215 transition count 210
Iterating global reduction 2 with 11 rules applied. Total rules applied 124 place count 215 transition count 210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 124 place count 215 transition count 206
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 132 place count 211 transition count 206
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 298 place count 128 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 300 place count 126 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 301 place count 125 transition count 121
Applied a total of 301 rules in 23 ms. Remains 125 /278 variables (removed 153) and now considering 121/273 (removed 152) transitions.
// Phase 1: matrix 121 rows 125 cols
[2024-05-28 09:36:58] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 09:36:58] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 09:36:58] [INFO ] Invariant cache hit.
[2024-05-28 09:36:58] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-28 09:36:59] [INFO ] Redundant transitions in 19 ms returned [120]
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 118 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-05-28 09:36:59] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:36:59] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:37:00] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:37:00] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:37:00] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:37:00] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:37:00] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:37:00] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 1/125 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:37:01] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:37:01] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 120/245 variables, 125/192 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:37:02] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:37:02] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:37:02] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:37:02] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:37:02] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:37:02] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:37:02] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:37:02] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:37:02] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:37:02] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 10/202 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:37:03] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/245 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 203 constraints, problems are : Problem set: 0 solved, 118 unsolved in 6341 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 31/75 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:37:05] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:37:05] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 1/125 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 120/245 variables, 125/205 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 118/323 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-28 09:37:08] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:37:08] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/245 variables, 2/325 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (OVERLAPS) 0/245 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 325 constraints, problems are : Problem set: 0 solved, 118 unsolved in 7258 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 37/37 constraints]
After SMT, in 13617ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 13618ms
Starting structural reductions in SI_LTL mode, iteration 1 : 125/278 places, 120/273 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13830 ms. Remains : 125/278 places, 120/273 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-14
Stuttering criterion allowed to conclude after 439 steps with 1 reset in 3 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-14 finished in 13881 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 3 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 277 transition count 247
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 252 transition count 247
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 252 transition count 222
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 227 transition count 222
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 111 place count 216 transition count 211
Iterating global reduction 2 with 11 rules applied. Total rules applied 122 place count 216 transition count 211
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 122 place count 216 transition count 207
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 130 place count 212 transition count 207
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 290 place count 132 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 292 place count 130 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 129 transition count 125
Applied a total of 293 rules in 23 ms. Remains 129 /278 variables (removed 149) and now considering 125/273 (removed 148) transitions.
// Phase 1: matrix 125 rows 129 cols
[2024-05-28 09:37:12] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 09:37:12] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 09:37:12] [INFO ] Invariant cache hit.
[2024-05-28 09:37:12] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-28 09:37:12] [INFO ] Redundant transitions in 18 ms returned [124]
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 121 sub problems to find dead transitions.
// Phase 1: matrix 124 rows 129 cols
[2024-05-28 09:37:12] [INFO ] Computed 45 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:13] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:37:13] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:37:13] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:37:13] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:37:13] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:37:13] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:37:13] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 2/129 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:14] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:37:14] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:37:14] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-05-28 09:37:14] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:37:14] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:37:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:37:14] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:37:14] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-28 09:37:14] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 09:37:14] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:37:14] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:14] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:37:15] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 124/253 variables, 129/195 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:16] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:17] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:37:17] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:37:17] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:17] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:37:17] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (OVERLAPS) 0/253 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 201 constraints, problems are : Problem set: 0 solved, 121 unsolved in 6669 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 2/129 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 124/253 variables, 129/201 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 121/322 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:21] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:22] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:37:22] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:37:22] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 0/253 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 326 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7079 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 31/31 constraints]
After SMT, in 13777ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 13779ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/278 places, 124/273 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13995 ms. Remains : 129/278 places, 124/273 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-15
Product exploration explored 100000 steps with 6040 reset in 180 ms.
Product exploration explored 100000 steps with 6006 reset in 191 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
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 5 factoid took 274 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 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (133 resets) in 180 ms. (220 steps per ms) remains 2/4 properties
BEST_FIRST walk for 4945 steps (2 resets) in 8 ms. (549 steps per ms) remains 0/2 properties
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)))]
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 (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 355 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 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-28 09:37:28] [INFO ] Invariant cache hit.
[2024-05-28 09:37:28] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 09:37:28] [INFO ] Invariant cache hit.
[2024-05-28 09:37:28] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-28 09:37:28] [INFO ] Redundant transitions in 16 ms returned []
Running 121 sub problems to find dead transitions.
[2024-05-28 09:37:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:28] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:37:28] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:37:28] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:37:28] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:37:28] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-28 09:37:29] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:37:29] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:29] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 2/129 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:30] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:37:30] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:37:30] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-28 09:37:30] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:37:30] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-28 09:37:30] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:37:30] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:37:30] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:37:30] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-05-28 09:37:30] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:37:30] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:30] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 124/253 variables, 129/194 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:31] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:37:31] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:37:31] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:37:32] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:37:32] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:32] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:37:32] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:37:32] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:37:33] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:33] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-28 09:37:33] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/253 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:34] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:37:35] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:37:35] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/253 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:35] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:37:35] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:37:35] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:35] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:37:35] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2024-05-28 09:37:35] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-28 09:37:36] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:37:36] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-28 09:37:36] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-28 09:37:36] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:37:36] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 8/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:37] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/253 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:38] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:37:38] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:37:38] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/253 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:38] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-28 09:37:39] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:37:39] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/253 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/253 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 21 (OVERLAPS) 0/253 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 226 constraints, problems are : Problem set: 0 solved, 121 unsolved in 12382 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 2/129 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 124/253 variables, 129/226 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 121/347 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:37:42] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:37:42] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/253 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 349 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5833 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 54/54 constraints]
After SMT, in 18240ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 18241ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18499 ms. Remains : 129/129 places, 124/124 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
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 5 factoid took 284 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 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (133 resets) in 172 ms. (231 steps per ms) remains 2/4 properties
BEST_FIRST walk for 12032 steps (6 resets) in 26 ms. (445 steps per ms) remains 0/2 properties
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)))]
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 (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 351 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 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6233 reset in 163 ms.
Product exploration explored 100000 steps with 6328 reset in 192 ms.
Built C files in :
/tmp/ltsmin9383903886427913524
[2024-05-28 09:37:48] [INFO ] Computing symmetric may disable matrix : 124 transitions.
[2024-05-28 09:37:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:37:48] [INFO ] Computing symmetric may enable matrix : 124 transitions.
[2024-05-28 09:37:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:37:48] [INFO ] Computing Do-Not-Accords matrix : 124 transitions.
[2024-05-28 09:37:48] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:37:48] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9383903886427913524
Running compilation step : cd /tmp/ltsmin9383903886427913524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 286 ms.
Running link step : cd /tmp/ltsmin9383903886427913524;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9383903886427913524;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16883025923076366938.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 124/124 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-28 09:38:03] [INFO ] Invariant cache hit.
[2024-05-28 09:38:03] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 09:38:03] [INFO ] Invariant cache hit.
[2024-05-28 09:38:03] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-28 09:38:03] [INFO ] Redundant transitions in 16 ms returned []
Running 121 sub problems to find dead transitions.
[2024-05-28 09:38:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:38:03] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:38:03] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:38:03] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:38:03] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:38:03] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:38:04] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:38:04] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:38:04] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 2/129 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:38:05] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:38:05] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:38:05] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:38:05] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:38:05] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:38:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:38:05] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-28 09:38:05] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:38:05] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2024-05-28 09:38:05] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:38:05] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:38:05] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 124/253 variables, 129/194 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:38:06] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:38:06] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:38:06] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:38:06] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:38:07] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 5/199 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:38:07] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:38:07] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:38:07] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:38:07] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:38:08] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:38:08] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/253 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:38:09] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:38:09] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:38:09] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/253 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:38:10] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:38:10] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:38:10] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:38:10] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:38:10] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:38:10] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:38:10] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:38:11] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:38:11] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:38:11] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:38:11] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 8/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:38:12] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/253 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:38:12] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:38:12] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:38:13] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/253 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:38:13] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:38:13] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:38:14] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/253 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/253 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 21 (OVERLAPS) 0/253 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 226 constraints, problems are : Problem set: 0 solved, 121 unsolved in 12346 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 39/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 2/129 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 124/253 variables, 129/226 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 121/347 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:38:17] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:38:17] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/253 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 349 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5834 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 54/54 constraints]
After SMT, in 18210ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 18211ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18402 ms. Remains : 129/129 places, 124/124 transitions.
Built C files in :
/tmp/ltsmin3720193765273728875
[2024-05-28 09:38:21] [INFO ] Computing symmetric may disable matrix : 124 transitions.
[2024-05-28 09:38:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:38:21] [INFO ] Computing symmetric may enable matrix : 124 transitions.
[2024-05-28 09:38:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:38:21] [INFO ] Computing Do-Not-Accords matrix : 124 transitions.
[2024-05-28 09:38:21] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:38:21] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3720193765273728875
Running compilation step : cd /tmp/ltsmin3720193765273728875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 307 ms.
Running link step : cd /tmp/ltsmin3720193765273728875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3720193765273728875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15888556467460779641.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 09:38:36] [INFO ] Flatten gal took : 8 ms
[2024-05-28 09:38:36] [INFO ] Flatten gal took : 5 ms
[2024-05-28 09:38:36] [INFO ] Time to serialize gal into /tmp/LTL7487072529415651166.gal : 1 ms
[2024-05-28 09:38:36] [INFO ] Time to serialize properties into /tmp/LTL14109419206723477909.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7487072529415651166.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16073381172591489259.hoa' '-atoms' '/tmp/LTL14109419206723477909.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14109419206723477909.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16073381172591489259.hoa
Detected timeout of ITS tools.
[2024-05-28 09:38:51] [INFO ] Flatten gal took : 7 ms
[2024-05-28 09:38:51] [INFO ] Flatten gal took : 4 ms
[2024-05-28 09:38:51] [INFO ] Time to serialize gal into /tmp/LTL18336129475941654258.gal : 1 ms
[2024-05-28 09:38:51] [INFO ] Time to serialize properties into /tmp/LTL16999422224550936447.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18336129475941654258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16999422224550936447.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p242!=1)")||(G("((p133==1)&&(p21==1))"))))))
Formula 0 simplified : G(F!"((p133==1)&&(p21==1))" & FG!"(p242!=1)")
Detected timeout of ITS tools.
[2024-05-28 09:39:06] [INFO ] Flatten gal took : 8 ms
[2024-05-28 09:39:06] [INFO ] Applying decomposition
[2024-05-28 09:39:06] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16859536868645640048.txt' '-o' '/tmp/graph16859536868645640048.bin' '-w' '/tmp/graph16859536868645640048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16859536868645640048.bin' '-l' '-1' '-v' '-w' '/tmp/graph16859536868645640048.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:39:06] [INFO ] Decomposing Gal with order
[2024-05-28 09:39:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:39:06] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-28 09:39:06] [INFO ] Flatten gal took : 9 ms
[2024-05-28 09:39:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 2 ms.
[2024-05-28 09:39:06] [INFO ] Time to serialize gal into /tmp/LTL3547965869651367169.gal : 1 ms
[2024-05-28 09:39:06] [INFO ] Time to serialize properties into /tmp/LTL17657849853713971090.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3547965869651367169.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17657849853713971090.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i3.i2.u39.p242!=1)")||(G("((i2.i1.u20.p133==1)&&(i0.i0.u3.p21==1))"))))))
Formula 0 simplified : G(F!"((i2.i1.u20.p133==1)&&(i0.i0.u3.p21==1))" & FG!"(i3.i2.u39.p242!=1)")
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-15 finished in 129196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)||G(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))||G(p1)||F(p2)))'
Found a Shortening insensitive property : ShieldIIPs-PT-005B-LTLFireability-05
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 277 transition count 248
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 253 transition count 248
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 48 place count 253 transition count 221
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 102 place count 226 transition count 221
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 216 transition count 211
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 216 transition count 211
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 122 place count 216 transition count 208
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 128 place count 213 transition count 208
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 292 place count 131 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 294 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 128 transition count 124
Applied a total of 295 rules in 17 ms. Remains 128 /278 variables (removed 150) and now considering 124/273 (removed 149) transitions.
// Phase 1: matrix 124 rows 128 cols
[2024-05-28 09:39:22] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 09:39:22] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-28 09:39:22] [INFO ] Invariant cache hit.
[2024-05-28 09:39:22] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-28 09:39:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:22] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:39:22] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-28 09:39:22] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:39:22] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:39:22] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:39:23] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:39:23] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:39:23] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:39:23] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:39:23] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:39:23] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:39:23] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:23] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:23] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 2/128 variables, 5/59 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:24] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:39:24] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:39:24] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:39:24] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:39:24] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:39:24] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:39:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:39:25] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:39:25] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 124/252 variables, 128/196 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:25] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:39:25] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:39:26] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:39:26] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:39:26] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:39:26] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:39:26] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:39:26] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 8/204 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:27] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:39:27] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:39:27] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:27] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:39:27] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:39:27] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:39:27] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:39:27] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:39:27] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:39:27] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-28 09:39:27] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:39:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:39:28] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:28] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:29] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:29] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:39:29] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:39:29] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/252 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:30] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/252 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:31] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:39:31] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/252 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:31] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:39:31] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:39:31] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/252 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/252 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:32] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:39:33] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:39:33] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:39:33] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:39:33] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:39:33] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/252 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:33] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/252 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:34] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/252 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:35] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:39:35] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/252 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/252 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 24 (OVERLAPS) 0/252 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 238 constraints, problems are : Problem set: 0 solved, 121 unsolved in 14302 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 63/103 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 5/108 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 124/252 variables, 128/238 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 121/359 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:38] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:39:39] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:42] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-28 09:39:49] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/252 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (OVERLAPS) 0/252 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 363 constraints, problems are : Problem set: 0 solved, 121 unsolved in 24299 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 69/69 constraints]
After SMT, in 38615ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 38617ms
Starting structural reductions in LI_LTL mode, iteration 1 : 128/278 places, 124/273 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 38839 ms. Remains : 128/278 places, 124/273 transitions.
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-05
Product exploration explored 100000 steps with 24389 reset in 150 ms.
Product exploration explored 100000 steps with 24640 reset in 168 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/128 stabilizing places and 4/124 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 992 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (137 resets) in 104 ms. (380 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (19 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
[2024-05-28 09:40:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 11/252 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 4/45 constraints, State Equation: 0/128 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p2)))), (F p0), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 6 factoid took 1298 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-28 09:40:04] [INFO ] Invariant cache hit.
[2024-05-28 09:40:04] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 09:40:04] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-28 09:40:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:40:04] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 09:40:04] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-28 09:40:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:40:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-05-28 09:40:04] [INFO ] Computed and/alt/rep : 120/299/120 causal constraints (skipped 1 transitions) in 7 ms.
[2024-05-28 09:40:04] [INFO ] Added : 97 causal constraints over 20 iterations in 257 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 128 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 : 128/128 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-28 09:40:04] [INFO ] Invariant cache hit.
[2024-05-28 09:40:04] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 09:40:04] [INFO ] Invariant cache hit.
[2024-05-28 09:40:05] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-28 09:40:05] [INFO ] Redundant transitions in 21 ms returned [123]
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 120 sub problems to find dead transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 09:40:05] [INFO ] Computed 45 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:40:05] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:40:05] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:40:05] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 09:40:05] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:40:05] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:40:05] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:40:05] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:40:05] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:40:05] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:40:05] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:40:05] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-05-28 09:40:05] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:40:06] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:40:06] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:40:06] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:40:06] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:40:06] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 2/128 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:40:07] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:40:07] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:40:07] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:40:07] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:40:07] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:40:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-28 09:40:07] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:40:07] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-28 09:40:07] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:40:08] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 123/251 variables, 128/200 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:40:09] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:40:09] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:40:09] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:40:09] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:40:09] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:40:09] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:40:10] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:40:10] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-28 09:40:10] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:40:10] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:40:10] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:40:11] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:40:12] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:40:12] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:40:12] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:40:13] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:40:13] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/251 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 18 (OVERLAPS) 0/251 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 217 constraints, problems are : Problem set: 0 solved, 120 unsolved in 10006 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 44/84 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 123/251 variables, 128/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 120/337 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:40:16] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:40:16] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:40:16] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (OVERLAPS) 0/251 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 340 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5444 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 47/47 constraints]
After SMT, in 15470ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 15471ms
Starting structural reductions in SI_LTL mode, iteration 1 : 128/128 places, 123/124 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15679 ms. Remains : 128/128 places, 123/124 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/128 stabilizing places and 4/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 590 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (139 resets) in 150 ms. (264 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (18 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
[2024-05-28 09:40:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 11/251 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 4/45 constraints, State Equation: 0/128 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 (NOT p2)))), (F p0), (F p2), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 843 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-28 09:40:22] [INFO ] Invariant cache hit.
[2024-05-28 09:40:22] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 09:40:22] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-28 09:40:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:40:22] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 09:40:23] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-28 09:40:23] [INFO ] Computed and/alt/rep : 119/294/119 causal constraints (skipped 1 transitions) in 9 ms.
[2024-05-28 09:40:23] [INFO ] Added : 102 causal constraints over 21 iterations in 253 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 24528 reset in 146 ms.
Product exploration explored 100000 steps with 24539 reset in 160 ms.
Built C files in :
/tmp/ltsmin11510893359278883247
[2024-05-28 09:40:23] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2024-05-28 09:40:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:40:23] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2024-05-28 09:40:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:40:23] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2024-05-28 09:40:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:40:23] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11510893359278883247
Running compilation step : cd /tmp/ltsmin11510893359278883247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 302 ms.
Running link step : cd /tmp/ltsmin11510893359278883247;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11510893359278883247;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1245871960512412837.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 121
Applied a total of 1 rules in 8 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 09:40:38] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 09:40:39] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 09:40:39] [INFO ] Invariant cache hit.
[2024-05-28 09:40:39] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-28 09:40:39] [INFO ] Redundant transitions in 19 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-28 09:40:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:40:39] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:40:39] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:40:39] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:40:39] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 09:40:39] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-28 09:40:39] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:40:39] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:40:39] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:40:39] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:40:39] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:40:39] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:40:39] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:40:40] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:40:40] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:40:40] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:40:40] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:40:40] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 1/126 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:40:41] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:40:41] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-28 09:40:41] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:40:41] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 121/247 variables, 126/192 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:40:42] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:40:42] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:40:42] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:40:42] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:40:42] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:40:42] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:40:42] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:40:42] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:40:42] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 9/201 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:40:42] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:40:42] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:40:43] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:40:43] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:40:44] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:40:44] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:40:44] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:40:44] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:40:44] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 09:40:44] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:40:45] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:40:45] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/247 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (OVERLAPS) 0/247 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 213 constraints, problems are : Problem set: 0 solved, 119 unsolved in 8280 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 42/83 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:40:47] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:40:47] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 1/126 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:40:48] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 121/247 variables, 126/216 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 119/335 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:40:49] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:40:57] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/247 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (OVERLAPS) 0/247 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 337 constraints, problems are : Problem set: 0 solved, 119 unsolved in 22789 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 47/47 constraints]
After SMT, in 31111ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 31113ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/128 places, 121/123 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31322 ms. Remains : 126/128 places, 121/123 transitions.
Built C files in :
/tmp/ltsmin17172360031034048410
[2024-05-28 09:41:10] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2024-05-28 09:41:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:41:10] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2024-05-28 09:41:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:41:10] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2024-05-28 09:41:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:41:10] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17172360031034048410
Running compilation step : cd /tmp/ltsmin17172360031034048410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 294 ms.
Running link step : cd /tmp/ltsmin17172360031034048410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17172360031034048410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5707323409617462505.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 09:41:25] [INFO ] Flatten gal took : 5 ms
[2024-05-28 09:41:25] [INFO ] Flatten gal took : 4 ms
[2024-05-28 09:41:25] [INFO ] Time to serialize gal into /tmp/LTL10597081955043159093.gal : 2 ms
[2024-05-28 09:41:25] [INFO ] Time to serialize properties into /tmp/LTL4627840978678555982.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10597081955043159093.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14543125934704642892.hoa' '-atoms' '/tmp/LTL4627840978678555982.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4627840978678555982.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14543125934704642892.hoa
Detected timeout of ITS tools.
[2024-05-28 09:41:40] [INFO ] Flatten gal took : 4 ms
[2024-05-28 09:41:40] [INFO ] Flatten gal took : 4 ms
[2024-05-28 09:41:40] [INFO ] Time to serialize gal into /tmp/LTL1530454762606912467.gal : 2 ms
[2024-05-28 09:41:40] [INFO ] Time to serialize properties into /tmp/LTL921733198061540099.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1530454762606912467.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL921733198061540099.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((((X(F("(p251==1)")))||(G("(p159==1)")))||(F("((p255==1)&&(p280==1))"))))
Formula 0 simplified : XG!"(p251==1)" & F!"(p159==1)" & G!"((p255==1)&&(p280==1))"
Detected timeout of ITS tools.
[2024-05-28 09:41:55] [INFO ] Flatten gal took : 4 ms
[2024-05-28 09:41:55] [INFO ] Applying decomposition
[2024-05-28 09:41:55] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3751626051183859189.txt' '-o' '/tmp/graph3751626051183859189.bin' '-w' '/tmp/graph3751626051183859189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3751626051183859189.bin' '-l' '-1' '-v' '-w' '/tmp/graph3751626051183859189.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:41:55] [INFO ] Decomposing Gal with order
[2024-05-28 09:41:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:41:55] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-28 09:41:55] [INFO ] Flatten gal took : 7 ms
[2024-05-28 09:41:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 2 ms.
[2024-05-28 09:41:55] [INFO ] Time to serialize gal into /tmp/LTL12302481001097718760.gal : 1 ms
[2024-05-28 09:41:55] [INFO ] Time to serialize properties into /tmp/LTL11700665647029709842.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12302481001097718760.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11700665647029709842.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((X(F("(i4.i0.u38.p251==1)")))||(G("(i2.i2.u24.p159==1)")))||(F("((i4.i0.u40.p255==1)&&(i4.i0.u44.p280==1))"))))
Formula 0 simplified : XG!"(i4.i0.u38.p251==1)" & F!"(i2.i2.u24.p159==1)" & G!"((i4.i0.u40.p255==1)&&(i4.i0.u44.p280==1))"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-05 finished in 168578 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U 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(F(p0)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-005B-LTLFireability-10
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 277 transition count 247
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 252 transition count 247
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 50 place count 252 transition count 221
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 102 place count 226 transition count 221
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 113 place count 215 transition count 210
Iterating global reduction 2 with 11 rules applied. Total rules applied 124 place count 215 transition count 210
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 124 place count 215 transition count 207
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 130 place count 212 transition count 207
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 296 place count 129 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 298 place count 127 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 299 place count 126 transition count 122
Applied a total of 299 rules in 16 ms. Remains 126 /278 variables (removed 152) and now considering 122/273 (removed 151) transitions.
// Phase 1: matrix 122 rows 126 cols
[2024-05-28 09:42:10] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 09:42:11] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 09:42:11] [INFO ] Invariant cache hit.
[2024-05-28 09:42:11] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-28 09:42:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:11] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:42:11] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:42:11] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 09:42:11] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:42:11] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:42:11] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:42:11] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 09:42:11] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:42:11] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:42:11] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:42:12] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:42:12] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-28 09:42:12] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:42:12] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:42:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:42:12] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:12] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 1/126 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:13] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:42:13] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:42:13] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 122/248 variables, 126/191 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:14] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:42:14] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:42:14] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:42:14] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-28 09:42:14] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:42:14] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:42:14] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:42:14] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:42:14] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:14] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 09:42:14] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:42:15] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:42:15] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:15] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:42:15] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:42:15] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:42:16] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:42:16] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:42:16] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:42:16] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:42:16] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:42:16] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 09:42:16] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:16] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:18] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/248 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:18] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 16 (OVERLAPS) 0/248 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 217 constraints, problems are : Problem set: 0 solved, 120 unsolved in 9053 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 42/86 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:20] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:42:20] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:42:20] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 1/126 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 122/248 variables, 126/220 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 120/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 340 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4583 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 49/49 constraints]
After SMT, in 13657ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 13658ms
Starting structural reductions in LI_LTL mode, iteration 1 : 126/278 places, 122/273 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 13850 ms. Remains : 126/278 places, 122/273 transitions.
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-10
Product exploration explored 100000 steps with 1911 reset in 209 ms.
Product exploration explored 100000 steps with 1853 reset in 230 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 : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 7 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 09:42:25] [INFO ] Invariant cache hit.
[2024-05-28 09:42:25] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 09:42:26] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-28 09:42:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:42:26] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 09:42:26] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-28 09:42:26] [INFO ] Computed and/alt/rep : 120/296/120 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-28 09:42:26] [INFO ] Added : 119 causal constraints over 24 iterations in 268 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-05-28 09:42:26] [INFO ] Invariant cache hit.
[2024-05-28 09:42:26] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 09:42:26] [INFO ] Invariant cache hit.
[2024-05-28 09:42:26] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-28 09:42:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:26] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:27] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 1/126 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:28] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:42:28] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:42:28] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 122/248 variables, 126/191 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:29] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:42:29] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-28 09:42:29] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:42:29] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:42:29] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:42:29] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:42:29] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:42:30] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:42:30] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:30] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:42:30] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:42:30] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:42:30] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:31] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:42:31] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:42:31] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:42:31] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:42:31] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:42:31] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:42:31] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:42:31] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-28 09:42:31] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:42:32] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:32] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:33] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/248 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:34] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 16 (OVERLAPS) 0/248 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 217 constraints, problems are : Problem set: 0 solved, 120 unsolved in 9053 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 42/86 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:42:35] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:42:35] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-28 09:42:35] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 1/126 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 122/248 variables, 126/220 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 120/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 340 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4454 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 49/49 constraints]
After SMT, in 13524ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 13525ms
Finished structural reductions in LTL mode , in 1 iterations and 13698 ms. Remains : 126/126 places, 122/122 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 : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (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 : [(F p0)]
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 09:42:40] [INFO ] Invariant cache hit.
[2024-05-28 09:42:40] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 09:42:40] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-28 09:42:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 09:42:41] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 09:42:41] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-28 09:42:41] [INFO ] Computed and/alt/rep : 120/296/120 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-28 09:42:41] [INFO ] Added : 119 causal constraints over 24 iterations in 282 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1924 reset in 208 ms.
Product exploration explored 100000 steps with 2074 reset in 230 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-05-28 09:42:42] [INFO ] Redundant transitions in 22 ms returned [121]
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 119 sub problems to find dead transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 09:42:42] [INFO ] Computed 45 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:42:42] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-28 09:42:42] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:42:42] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:42:42] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-28 09:42:42] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:42:42] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:42:42] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:42:42] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 09:42:42] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 09:42:43] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:42:43] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:42:43] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:42:43] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2024-05-28 09:42:43] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:42:43] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:42:43] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 1/126 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:42:44] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:42:44] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:42:44] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 121/247 variables, 126/190 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:42:45] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:42:45] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:42:45] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 09:42:45] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:42:45] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:42:45] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 6/196 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:42:45] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-28 09:42:45] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-28 09:42:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:42:46] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-28 09:42:46] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:42:46] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:42:46] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-28 09:42:47] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (OVERLAPS) 0/247 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 204 constraints, problems are : Problem set: 0 solved, 119 unsolved in 6314 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 27/71 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 6/78 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:42:49] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:42:49] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:42:49] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 121/247 variables, 126/207 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 119/326 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-28 09:42:51] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/247 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (OVERLAPS) 0/247 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 247/247 variables, and 327 constraints, problems are : Problem set: 0 solved, 119 unsolved in 7654 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 37/37 constraints]
After SMT, in 13985ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 13987ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/126 places, 121/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14030 ms. Remains : 126/126 places, 121/122 transitions.
Built C files in :
/tmp/ltsmin15394796027845462182
[2024-05-28 09:42:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15394796027845462182
Running compilation step : cd /tmp/ltsmin15394796027845462182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 264 ms.
Running link step : cd /tmp/ltsmin15394796027845462182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15394796027845462182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2528408904633319793.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 126 cols
[2024-05-28 09:43:11] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 09:43:11] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 09:43:11] [INFO ] Invariant cache hit.
[2024-05-28 09:43:11] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-28 09:43:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:43:11] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:43:11] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:43:11] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-28 09:43:11] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:43:12] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:43:12] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 09:43:12] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-28 09:43:12] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-28 09:43:12] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 09:43:12] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:43:12] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 09:43:12] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2024-05-28 09:43:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:43:12] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 09:43:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-28 09:43:12] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:43:12] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 1/126 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:43:13] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 09:43:13] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-28 09:43:13] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 122/248 variables, 126/191 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:43:14] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:43:14] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:43:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 09:43:14] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-28 09:43:14] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:43:14] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-05-28 09:43:14] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:43:14] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-28 09:43:15] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 9/200 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:43:15] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:43:15] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 09:43:15] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 09:43:15] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 4/204 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:43:16] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 09:43:16] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 09:43:16] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-28 09:43:16] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 09:43:16] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 09:43:16] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 09:43:16] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-28 09:43:16] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 09:43:16] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-28 09:43:16] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/248 variables, 10/214 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:43:17] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/248 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:43:18] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/248 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:43:19] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/248 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/248 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 16 (OVERLAPS) 0/248 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 217 constraints, problems are : Problem set: 0 solved, 120 unsolved in 9097 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 42/86 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-28 09:43:20] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 09:43:20] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-28 09:43:20] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 1/126 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 122/248 variables, 126/220 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/248 variables, 120/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/248 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (OVERLAPS) 0/248 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 340 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4533 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 49/49 constraints]
After SMT, in 13646ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 13648ms
Finished structural reductions in LTL mode , in 1 iterations and 13843 ms. Remains : 126/126 places, 122/122 transitions.
Built C files in :
/tmp/ltsmin13449648860727321608
[2024-05-28 09:43:25] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13449648860727321608
Running compilation step : cd /tmp/ltsmin13449648860727321608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 263 ms.
Running link step : cd /tmp/ltsmin13449648860727321608;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13449648860727321608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6030147137128768386.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 09:43:40] [INFO ] Flatten gal took : 5 ms
[2024-05-28 09:43:40] [INFO ] Flatten gal took : 9 ms
[2024-05-28 09:43:40] [INFO ] Time to serialize gal into /tmp/LTL8820441280650316816.gal : 1 ms
[2024-05-28 09:43:40] [INFO ] Time to serialize properties into /tmp/LTL12138601766346653038.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8820441280650316816.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17305545019686539572.hoa' '-atoms' '/tmp/LTL12138601766346653038.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12138601766346653038.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17305545019686539572.hoa
Detected timeout of ITS tools.
[2024-05-28 09:43:55] [INFO ] Flatten gal took : 7 ms
[2024-05-28 09:43:55] [INFO ] Flatten gal took : 4 ms
[2024-05-28 09:43:55] [INFO ] Time to serialize gal into /tmp/LTL16900348929496882472.gal : 1 ms
[2024-05-28 09:43:55] [INFO ] Time to serialize properties into /tmp/LTL2284020180190559885.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16900348929496882472.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2284020180190559885.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(p99==1)"))))))
Formula 0 simplified : XXXG!"(p99==1)"
Detected timeout of ITS tools.
[2024-05-28 09:44:10] [INFO ] Flatten gal took : 9 ms
[2024-05-28 09:44:10] [INFO ] Applying decomposition
[2024-05-28 09:44:10] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18292855597121969954.txt' '-o' '/tmp/graph18292855597121969954.bin' '-w' '/tmp/graph18292855597121969954.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18292855597121969954.bin' '-l' '-1' '-v' '-w' '/tmp/graph18292855597121969954.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:44:10] [INFO ] Decomposing Gal with order
[2024-05-28 09:44:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:44:10] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-28 09:44:10] [INFO ] Flatten gal took : 10 ms
[2024-05-28 09:44:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 2 ms.
[2024-05-28 09:44:10] [INFO ] Time to serialize gal into /tmp/LTL10372422577241342244.gal : 2 ms
[2024-05-28 09:44:10] [INFO ] Time to serialize properties into /tmp/LTL14974340866655629110.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10372422577241342244.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14974340866655629110.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("(i1.i1.u15.p99==1)"))))))
Formula 0 simplified : XXXG!"(i1.i1.u15.p99==1)"
Detected timeout of ITS tools.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-10 finished in 134848 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)))'
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)))))'
[2024-05-28 09:44:25] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin378834388452572182
[2024-05-28 09:44:25] [INFO ] Computing symmetric may disable matrix : 273 transitions.
[2024-05-28 09:44:25] [INFO ] Applying decomposition
[2024-05-28 09:44:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:44:25] [INFO ] Computing symmetric may enable matrix : 273 transitions.
[2024-05-28 09:44:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:44:25] [INFO ] Flatten gal took : 16 ms
[2024-05-28 09:44:25] [INFO ] Computing Do-Not-Accords matrix : 273 transitions.
[2024-05-28 09:44:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 09:44:25] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin378834388452572182
Running compilation step : cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6762281795966427320.txt' '-o' '/tmp/graph6762281795966427320.bin' '-w' '/tmp/graph6762281795966427320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6762281795966427320.bin' '-l' '-1' '-v' '-w' '/tmp/graph6762281795966427320.weights' '-q' '0' '-e' '0.001'
[2024-05-28 09:44:25] [INFO ] Decomposing Gal with order
[2024-05-28 09:44:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 09:44:25] [INFO ] Removed a total of 115 redundant transitions.
[2024-05-28 09:44:25] [INFO ] Flatten gal took : 12 ms
[2024-05-28 09:44:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 09:44:25] [INFO ] Time to serialize gal into /tmp/LTLFireability12070102653987406490.gal : 3 ms
[2024-05-28 09:44:25] [INFO ] Time to serialize properties into /tmp/LTLFireability15724092261503760632.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12070102653987406490.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15724092261503760632.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 6 LTL properties
Checking formula 0 : !((((F("(i1.i1.i1.u35.p100==1)"))U("(i1.i0.i0.u36.p101==1)"))||(G("(((i9.u89.p267==0)||(i9.u94.p286==0))||(i8.u97.p297==0))"))))
Formula 0 simplified : (G!"(i1.i1.i1.u35.p100==1)" R !"(i1.i0.i0.u36.p101==1)") & F!"(((i9.u89.p267==0)||(i9.u94.p286==0))||(i8.u97.p297==0))"
Compilation finished in 750 ms.
Running link step : cd /tmp/ltsmin378834388452572182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((<>((LTLAPp0==true)) U (LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((<>((LTLAPp0==true)) U (LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp3==true)))||[]((LTLAPp4==true))||<>((LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp3==true)))||[]((LTLAPp4==true))||<>((LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp6==true)) U []((LTLAPp7==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp6==true)) U []((LTLAPp7==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp8==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp8==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp9==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp9==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp10==true)||[]((LTLAPp11==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>100 s) on command cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp10==true)||[]((LTLAPp11==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((<>((LTLAPp0==true)) U (LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>800 s) on command cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((<>((LTLAPp0==true)) U (LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin378834388452572182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp3==true)))||[]((LTLAPp4==true))||<>((LTLAPp5==true)))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-005B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-005B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r356-tall-171683760300076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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