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-171683761800746.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 ShieldRVs-PT-003B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761800746
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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 Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 17:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 12 17:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 17:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 17:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 36K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-003B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717033182113

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-003B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 01:39:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 01:39:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:39:43] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-30 01:39:43] [INFO ] Transformed 123 places.
[2024-05-30 01:39:43] [INFO ] Transformed 138 transitions.
[2024-05-30 01:39:43] [INFO ] Found NUPN structural information;
[2024-05-30 01:39:43] [INFO ] Parsed PT model containing 123 places and 138 transitions and 432 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 91 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 122 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 122 transition count 137
Applied a total of 2 rules in 23 ms. Remains 122 /123 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 122 cols
[2024-05-30 01:39:43] [INFO ] Computed 13 invariants in 17 ms
[2024-05-30 01:39:43] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-30 01:39:43] [INFO ] Invariant cache hit.
[2024-05-30 01:39:43] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-30 01:39:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:39:44] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 10 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:39:45] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 27 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2024-05-30 01:39:46] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:39:47] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:39:47] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:39:47] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:39:47] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:39:47] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:39:47] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:39:47] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:39:47] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:39:47] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:39:47] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:39:47] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 2 ms to minimize.
[2024-05-30 01:39:47] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 3 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:39:48] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:39:49] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:39:50] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:39:51] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 20/133 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:39:52] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:39:53] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:39:53] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:39:53] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 20/153 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:39:53] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:39:53] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:39:53] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
[2024-05-30 01:39:53] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:39:53] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:39:53] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:39:53] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:39:53] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:39:53] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-30 01:39:53] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:39:53] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 11 ms to minimize.
[2024-05-30 01:39:54] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:39:54] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:39:54] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 14/167 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:39:54] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:39:54] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:39:54] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:39:54] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:39:55] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:39:55] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:39:55] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:39:55] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:39:55] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:39:55] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:39:55] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:39:55] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:39:55] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:39:55] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:39:55] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-30 01:39:55] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-30 01:39:55] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-30 01:39:55] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 18/185 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 3 ms to minimize.
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 0 ms to minimize.
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:39:56] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:39:57] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:39:57] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:39:57] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 18/203 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:39:57] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:39:57] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-05-30 01:39:57] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:39:57] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:39:57] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:39:57] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:39:57] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:39:58] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:39:58] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 9/212 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:39:58] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 2 ms to minimize.
[2024-05-30 01:39:58] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:39:58] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:39:58] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:39:59] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:39:59] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:39:59] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:39:59] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:39:59] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:39:59] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:39:59] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:39:59] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/122 variables, 12/224 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:39:59] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:39:59] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:39:59] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 4/228 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:40:00] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:40:01] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:40:01] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/122 variables, 17/245 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:01] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-30 01:40:01] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:40:02] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:40:02] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:40:02] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/122 variables, 5/250 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:02] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:40:02] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:40:02] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/122 variables, 3/253 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/122 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 19 (OVERLAPS) 137/259 variables, 122/375 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:04] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:40:04] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:40:04] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:40:04] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:40:04] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:40:04] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:40:04] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:40:04] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:40:04] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:40:04] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:40:04] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:40:04] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 3 ms to minimize.
[2024-05-30 01:40:04] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/259 variables, 13/388 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:05] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:40:05] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 5 ms to minimize.
[2024-05-30 01:40:05] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/259 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:07] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:40:07] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/259 variables, 2/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/259 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:09] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:40:09] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 4 ms to minimize.
[2024-05-30 01:40:09] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 0 ms to minimize.
[2024-05-30 01:40:09] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:40:09] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:40:09] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:40:09] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:40:09] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/259 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:10] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:40:10] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2024-05-30 01:40:10] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:40:11] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:40:11] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:40:11] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:40:11] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:40:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/259 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:12] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/259 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:12] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:40:12] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:40:12] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:40:12] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:40:12] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:40:12] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:40:13] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:40:13] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:40:13] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/259 variables, 9/419 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 259/259 variables, and 419 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 284/284 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 284/297 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:15] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:15] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-05-30 01:40:15] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 2/300 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:16] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:40:16] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:16] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:40:16] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:40:16] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:17] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:40:17] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:40:17] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:18] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:40:18] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:40:18] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:40:18] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:40:18] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:40:18] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:40:18] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:40:18] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:40:18] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:40:18] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:40:18] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 11/319 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:18] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:40:19] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:19] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:40:19] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:40:19] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:40:19] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:40:19] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:40:19] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:40:19] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:40:19] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 12 (OVERLAPS) 137/259 variables, 122/451 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 136/587 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:23] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:40:23] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:40:24] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 3/590 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:29] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:40:29] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:40:30] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 3/593 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:33] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:40:35] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:40:35] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/259 variables, 3/596 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 01:40:41] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/259 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 259/259 variables, and 597 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 326/326 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 137/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60510 ms. Remains : 122/123 places, 137/138 transitions.
Support contains 91 out of 122 places after structural reductions.
[2024-05-30 01:40:44] [INFO ] Flatten gal took : 41 ms
[2024-05-30 01:40:44] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:40:44] [INFO ] Input system was already deterministic with 137 transitions.
RANDOM walk for 40000 steps (266 resets) in 1534 ms. (26 steps per ms) remains 8/83 properties
BEST_FIRST walk for 40004 steps (54 resets) in 125 ms. (317 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (56 resets) in 186 ms. (213 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (41 resets) in 177 ms. (224 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (59 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (56 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (63 resets) in 73 ms. (540 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (53 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
[2024-05-30 01:40:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 1 (OVERLAPS) 90/122 variables, 13/13 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 137/259 variables, 122/135 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-30 01:40:46] [INFO ] Deduced a trap composed of 16 places in 422 ms of which 1 ms to minimize.
[2024-05-30 01:40:46] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
Problem AtomicPropp50 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 2/137 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/137 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 137 constraints, problems are : Problem set: 4 solved, 1 unsolved in 957 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
Problem AtomicPropp28 is UNSAT
After SMT solving in domain Int declared 122/259 variables, and 13 constraints, problems are : Problem set: 5 solved, 0 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/122 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 0/2 constraints]
After SMT, in 1004ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-003B-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:40:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 01:40:46] [INFO ] Flatten gal took : 11 ms
FORMULA ShieldRVs-PT-003B-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:40:46] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:40:46] [INFO ] Input system was already deterministic with 137 transitions.
Support contains 76 out of 122 places (down from 79) after GAL structural reductions.
Computed a total of 36 stabilizing places and 36 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 103 transition count 118
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 103 transition count 118
Applied a total of 38 rules in 7 ms. Remains 103 /122 variables (removed 19) and now considering 118/137 (removed 19) transitions.
// Phase 1: matrix 118 rows 103 cols
[2024-05-30 01:40:46] [INFO ] Computed 13 invariants in 2 ms
[2024-05-30 01:40:46] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-30 01:40:46] [INFO ] Invariant cache hit.
[2024-05-30 01:40:46] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-30 01:40:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:47] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:40:47] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:40:47] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:40:47] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:40:47] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:40:47] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:40:47] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:40:47] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:40:47] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:40:47] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:40:47] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:40:47] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:40:47] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:40:47] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:40:48] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:40:49] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:40:49] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:40:49] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:40:49] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:40:49] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:40:49] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:40:49] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:49] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:40:49] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:40:49] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:40:49] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:40:49] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 2 ms to minimize.
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:40:50] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2024-05-30 01:40:51] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:40:51] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
[2024-05-30 01:40:51] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:40:51] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:51] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:40:51] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:40:51] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:40:51] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:40:51] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:40:51] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:40:52] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:40:52] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:40:52] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:52] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:40:52] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 118/221 variables, 103/191 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:53] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:53] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:40:54] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:40:54] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:40:54] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:54] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:40:54] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:55] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:55] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:40:55] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:40:55] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:40:55] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:40:55] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:40:55] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:56] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:40:56] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:40:56] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:40:56] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/221 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:57] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:40:57] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:40:57] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:40:57] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:40:58] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/221 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:58] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/221 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/221 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:40:59] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:40:59] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:40:59] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:41:00] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/221 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/221 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 23 (OVERLAPS) 0/221 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 219 constraints, problems are : Problem set: 0 solved, 117 unsolved in 14772 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 103/103 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 103/116 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:41:01] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:41:01] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:41:02] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:41:02] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:41:02] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:41:02] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:41:02] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:41:02] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:41:02] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:41:02] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:41:02] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:41:03] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:41:03] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:41:03] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:41:03] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:41:03] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:41:03] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 10/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 118/221 variables, 103/236 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 117/353 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:41:04] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:41:04] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:41:04] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:41:12] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/221 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 13 (OVERLAPS) 0/221 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 357 constraints, problems are : Problem set: 0 solved, 117 unsolved in 18090 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 124/124 constraints]
After SMT, in 32881ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 32883ms
Starting structural reductions in LTL mode, iteration 1 : 103/122 places, 118/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33181 ms. Remains : 103/122 places, 118/137 transitions.
[2024-05-30 01:41:19] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:41:19] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:41:19] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-30 01:41:19] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:41:19] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:41:19] [INFO ] Time to serialize gal into /tmp/CTLFireability1691813665786237042.gal : 3 ms
[2024-05-30 01:41:19] [INFO ] Time to serialize properties into /tmp/CTLFireability11368427960589759152.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1691813665786237042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11368427960589759152.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.48472e+09,0.69378,28556,2,6286,5,71056,6,0,532,170426,0


Converting to forward existential form...Done !
original formula: (EX((AF(AX(((p89==1)||(((p67==1)&&(p81==1))&&(p104==1))))) * E(E((p89!=1) U E((p9==1) U ((p106==1)&&(p117==1)))) U EG((((p55==1)&&(p61==1...188
=> equivalent forward existential formula: ([(Init * !(EX((!(EG(!(!(EX(!(((p89==1)||(((p67==1)&&(p81==1))&&(p104==1))))))))) * E(E((p89!=1) U E((p9==1) U (...267
Hit Full ! (commute/partial/dont) 116/0/2
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...341
Detected timeout of ITS tools.
[2024-05-30 01:41:49] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:41:49] [INFO ] Applying decomposition
[2024-05-30 01:41:49] [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/graph3072608769304367789.txt' '-o' '/tmp/graph3072608769304367789.bin' '-w' '/tmp/graph3072608769304367789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3072608769304367789.bin' '-l' '-1' '-v' '-w' '/tmp/graph3072608769304367789.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:41:49] [INFO ] Decomposing Gal with order
[2024-05-30 01:41:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:41:49] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-30 01:41:49] [INFO ] Flatten gal took : 37 ms
[2024-05-30 01:41:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 01:41:49] [INFO ] Time to serialize gal into /tmp/CTLFireability6509103774708857677.gal : 15 ms
[2024-05-30 01:41:49] [INFO ] Time to serialize properties into /tmp/CTLFireability5737544511537183287.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6509103774708857677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5737544511537183287.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.48472e+09,0.2891,14792,942,45,20899,208,324,39516,44,629,0


Converting to forward existential form...Done !
original formula: (EX((AF(AX(((i7.u29.p89==1)||(((i5.u21.p67==1)&&(i6.u25.p81==1))&&(i8.i1.u33.p104==1))))) * E(E((i7.u29.p89!=1) U E((i1.i0.u3.p9==1) U ((...280
=> equivalent forward existential formula: ([(Init * !(EX((!(EG(!(!(EX(!(((i7.u29.p89==1)||(((i5.u21.p67==1)&&(i6.u25.p81==1))&&(i8.i1.u33.p104==1)))))))))...359
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Reverse transition relation is NOT exact ! Due to transitions i0.u1.t76, i0.u4.t73, i0.u5.t0, i0.u5.t1, i0.u5.t2, i1.i1.u9.t3, i1.i1.u9.t4, i1.i1.u9.t5, i1...618
(forward)formula 0,0,11.6503,354704,1,0,692303,443,2134,965412,249,1320,729498
FORMULA ShieldRVs-PT-003B-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 103 transition count 118
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 103 transition count 118
Applied a total of 38 rules in 13 ms. Remains 103 /122 variables (removed 19) and now considering 118/137 (removed 19) transitions.
[2024-05-30 01:42:01] [INFO ] Invariant cache hit.
[2024-05-30 01:42:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 01:42:01] [INFO ] Invariant cache hit.
[2024-05-30 01:42:01] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-30 01:42:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:02] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:42:02] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:42:02] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:42:02] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:42:02] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2024-05-30 01:42:02] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:42:02] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:42:02] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:42:02] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:42:02] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 0 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2024-05-30 01:42:03] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:42:04] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:42:04] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:42:04] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2024-05-30 01:42:04] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:42:04] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:42:04] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:42:04] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:42:04] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:42:04] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:42:04] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:42:04] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:42:04] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:42:04] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:42:04] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:05] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:42:05] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:42:05] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:42:05] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:42:05] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:05] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 0 ms to minimize.
[2024-05-30 01:42:05] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:42:05] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:42:05] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:42:05] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:42:05] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-30 01:42:05] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
[2024-05-30 01:42:06] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:42:06] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:42:06] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-30 01:42:06] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:42:06] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:06] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:42:06] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-30 01:42:06] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 11 ms to minimize.
[2024-05-30 01:42:06] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2024-05-30 01:42:06] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:42:06] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:42:07] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:07] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:42:07] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:42:07] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:42:07] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:42:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:42:07] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:42:07] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:42:07] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:42:07] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:08] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:42:08] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (OVERLAPS) 118/221 variables, 103/191 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:09] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:09] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:42:09] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:42:09] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:42:10] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:10] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:42:10] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:11] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:42:11] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-30 01:42:11] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:42:11] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:42:11] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:42:11] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:12] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:42:12] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:42:12] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:42:12] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/221 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:13] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:42:13] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:42:14] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:42:14] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:42:14] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/221 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:15] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/221 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/221 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:15] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:42:15] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:42:16] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:42:16] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/221 variables, 4/219 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/221 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 23 (OVERLAPS) 0/221 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 219 constraints, problems are : Problem set: 0 solved, 117 unsolved in 15876 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 103/103 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 103/116 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:18] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:42:18] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:42:18] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:42:18] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:42:18] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:42:18] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:18] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:19] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:42:19] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 5 ms to minimize.
[2024-05-30 01:42:19] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:42:19] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:42:19] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:42:19] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:42:19] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:42:19] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:42:19] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:42:19] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 10/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 118/221 variables, 103/236 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 117/353 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:20] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:42:20] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:42:21] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:42:28] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/221 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 13 (OVERLAPS) 0/221 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 357 constraints, problems are : Problem set: 0 solved, 117 unsolved in 18225 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 124/124 constraints]
After SMT, in 34135ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 34136ms
Starting structural reductions in LTL mode, iteration 1 : 103/122 places, 118/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34337 ms. Remains : 103/122 places, 118/137 transitions.
[2024-05-30 01:42:35] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:42:36] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:42:36] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-30 01:42:36] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:42:36] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:42:36] [INFO ] Time to serialize gal into /tmp/CTLFireability12953288806447894243.gal : 2 ms
[2024-05-30 01:42:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3390315723758188762.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12953288806447894243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3390315723758188762.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.48472e+09,0.686954,28616,2,6286,5,71056,6,0,532,170426,0


Converting to forward existential form...Done !
original formula: AX(EG(A(!(EG((p73==1))) U (AG((p108==1)) * E((p89==1) U (((p95==1)&&(p100==1))&&(p108==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((E(!((!(E(TRUE U !((p108==1)))) * E((p89==1) U (((p95==1)&&(p100==1))&&(p108==1))))) U (!(!(...357
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...341
Detected timeout of ITS tools.
[2024-05-30 01:43:06] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:43:06] [INFO ] Applying decomposition
[2024-05-30 01:43: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/graph8754630571772059304.txt' '-o' '/tmp/graph8754630571772059304.bin' '-w' '/tmp/graph8754630571772059304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8754630571772059304.bin' '-l' '-1' '-v' '-w' '/tmp/graph8754630571772059304.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:43:06] [INFO ] Decomposing Gal with order
[2024-05-30 01:43:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:43:06] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-30 01:43:06] [INFO ] Flatten gal took : 27 ms
[2024-05-30 01:43:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2024-05-30 01:43:06] [INFO ] Time to serialize gal into /tmp/CTLFireability3855322378875096620.gal : 3 ms
[2024-05-30 01:43:06] [INFO ] Time to serialize properties into /tmp/CTLFireability8075580483615780342.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3855322378875096620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8075580483615780342.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.48472e+09,0.308233,15092,995,43,21273,221,316,39159,42,723,0


Converting to forward existential form...Done !
original formula: AX(EG(A(!(EG((i6.u23.p73==1))) U (AG((i8.i1.u33.p108==1)) * E((i7.u29.p89==1) U (((i7.u29.p95==1)&&(i8.i0.u31.p100==1))&&(i8.i1.u33.p108=...164
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((E(!((!(E(TRUE U !((i8.i1.u33.p108==1)))) * E((i7.u29.p89==1) U (((i7.u29.p95==1)&&(i8.i0.u3...496
Reverse transition relation is NOT exact ! Due to transitions i1.u1.t76, i1.u4.t73, i1.u5.t0, i1.u5.t1, i1.u5.t2, i2.i1.u8.t68, i2.i2.u9.t3, i2.i2.u9.t4, i...618
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,25.0864,699416,1,0,1.22539e+06,428,1855,2.0539e+06,221,1356,1265486
FORMULA ShieldRVs-PT-003B-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 108 transition count 123
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 108 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 107 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 107 transition count 122
Applied a total of 30 rules in 12 ms. Remains 107 /122 variables (removed 15) and now considering 122/137 (removed 15) transitions.
// Phase 1: matrix 122 rows 107 cols
[2024-05-30 01:43:31] [INFO ] Computed 13 invariants in 3 ms
[2024-05-30 01:43:31] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-30 01:43:31] [INFO ] Invariant cache hit.
[2024-05-30 01:43:31] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-30 01:43:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 0 ms to minimize.
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-30 01:43:32] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:43:33] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:43:34] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2024-05-30 01:43:34] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:43:34] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:43:34] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:43:34] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:43:34] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:43:34] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:43:34] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:43:34] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-30 01:43:34] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:34] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 0 ms to minimize.
[2024-05-30 01:43:34] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:43:34] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:43:35] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:36] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:43:36] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:43:36] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:43:36] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:43:36] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:43:36] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:36] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:43:36] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:43:36] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:43:36] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:43:36] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:43:37] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:43:37] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:43:37] [INFO ] Deduced a trap composed of 32 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 8/87 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:37] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:43:37] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2024-05-30 01:43:37] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:43:37] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:43:37] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:43:37] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:43:37] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:43:38] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:38] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:43:38] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:43:38] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:43:38] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:43:38] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:43:38] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:43:38] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:43:38] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 8/103 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:39] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:43:39] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:39] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:43:39] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 0 ms to minimize.
[2024-05-30 01:43:39] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2024-05-30 01:43:39] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:43:39] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:43:40] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 0 ms to minimize.
[2024-05-30 01:43:41] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:43:41] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:43:41] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:43:41] [INFO ] Deduced a trap composed of 16 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:43:41] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:43:41] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:43:41] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:43:41] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:43:41] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/107 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/107 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (OVERLAPS) 122/229 variables, 107/244 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:42] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:43:42] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:43:42] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:43:42] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/229 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:43] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/229 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:44] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:43:44] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/229 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:44] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/229 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:45] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:43:45] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:43:45] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/229 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:46] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:43:46] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:43:46] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:43:46] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:43:46] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-30 01:43:46] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:43:46] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:43:46] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/229 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/229 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:47] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/229 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/229 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:49] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-30 01:43:49] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:43:49] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:43:49] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:43:49] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 3 ms to minimize.
[2024-05-30 01:43:49] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:43:49] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:43:49] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:43:49] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:43:49] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:43:49] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/229 variables, 11/275 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:50] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2024-05-30 01:43:50] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:43:50] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/229 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:51] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2024-05-30 01:43:51] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:43:51] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2024-05-30 01:43:51] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-30 01:43:51] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:43:51] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/229 variables, 6/284 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:52] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:43:52] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:43:52] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:43:52] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/229 variables, 4/288 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/229 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:54] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 28 (OVERLAPS) 0/229 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:54] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:43:54] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/229 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:55] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:43:55] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:43:55] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:43:55] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:43:55] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/229 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:56] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:43:56] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:43:56] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:43:56] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:43:56] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/229 variables, 5/301 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/229 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:58] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:43:58] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:43:58] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:43:58] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:43:58] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
At refinement iteration 33 (OVERLAPS) 0/229 variables, 5/306 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/229 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:43:59] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:43:59] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
At refinement iteration 35 (OVERLAPS) 0/229 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:44:00] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:44:00] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:44:00] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/229 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 229/229 variables, and 311 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 191/191 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 191/204 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 122/229 variables, 107/311 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 121/432 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:44:03] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:44:03] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:44:04] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:44:06] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:44:06] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:44:06] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:44:06] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:44:07] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 5/440 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:44:10] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:44:10] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:44:10] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:44:10] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:44:10] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:44:10] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:44:10] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:44:11] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:44:11] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 9/449 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:44:17] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/229 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:44:21] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 1/451 constraints. Problems are: Problem set: 0 solved, 121 unsolved
[2024-05-30 01:44:24] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:44:25] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/229 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 229/229 variables, and 453 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 212/212 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 107/122 places, 122/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60176 ms. Remains : 107/122 places, 122/137 transitions.
[2024-05-30 01:44:31] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:44:31] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:44:31] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-30 01:44:31] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:44:31] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:44:31] [INFO ] Time to serialize gal into /tmp/CTLFireability11551645297546301622.gal : 15 ms
[2024-05-30 01:44:31] [INFO ] Time to serialize properties into /tmp/CTLFireability18176729709090638263.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11551645297546301622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18176729709090638263.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77711e+09,0.770737,31240,2,6508,5,75807,6,0,552,191504,0


Converting to forward existential form...Done !
original formula: E((EF((p29!=1)) * (AG((!(E((p11==1) U (p39==1))) * !(EG((p86==1))))) + (E((p0==1) U !(AG((p60==1)))) * AX((AG((p99==1)) * ((p0==1)||(p64=...338
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U (p29!=1)) * (!(E(TRUE U !((!(E((p11==1) U (p39==1))) * !(EG((p86==1))))))) + (E((p0==1) U ...444
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...376
Detected timeout of ITS tools.
[2024-05-30 01:45:01] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:45:01] [INFO ] Applying decomposition
[2024-05-30 01:45:01] [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/graph8636691655071414016.txt' '-o' '/tmp/graph8636691655071414016.bin' '-w' '/tmp/graph8636691655071414016.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8636691655071414016.bin' '-l' '-1' '-v' '-w' '/tmp/graph8636691655071414016.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:45:01] [INFO ] Decomposing Gal with order
[2024-05-30 01:45:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:45:01] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-30 01:45:01] [INFO ] Flatten gal took : 35 ms
[2024-05-30 01:45:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 01:45:01] [INFO ] Time to serialize gal into /tmp/CTLFireability1024286663831153079.gal : 3 ms
[2024-05-30 01:45:01] [INFO ] Time to serialize properties into /tmp/CTLFireability17883197318058223490.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1024286663831153079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17883197318058223490.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.77711e+09,0.309865,15392,1030,57,20709,226,352,43091,49,1043,0


Converting to forward existential form...Done !
original formula: E((EF((i2.i1.u9.p29!=1)) * (AG((!(E((i1.i0.u6.p11==1) U (i3.u12.p39==1))) * !(EG((i7.u27.p86==1))))) + (E((i0.u0.p0==1) U !(AG((i4.i0.u19...511
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U (i2.i1.u9.p29!=1)) * (!(E(TRUE U !((!(E((i1.i0.u6.p11==1) U (i3.u12.p39==1))) * !(EG((i7.u...617
Reverse transition relation is NOT exact ! Due to transitions i1.i0.t78, i1.i0.u6.t80, i1.i1.u1.t81, i1.i1.u5.t0, i1.i1.u5.t1, i1.i1.u5.t2, i2.i1.u9.t3, i2...716
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 104 transition count 119
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 104 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 103 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 103 transition count 118
Applied a total of 38 rules in 9 ms. Remains 103 /122 variables (removed 19) and now considering 118/137 (removed 19) transitions.
// Phase 1: matrix 118 rows 103 cols
[2024-05-30 01:45:31] [INFO ] Computed 13 invariants in 3 ms
[2024-05-30 01:45:31] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 01:45:31] [INFO ] Invariant cache hit.
[2024-05-30 01:45:31] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-30 01:45:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:32] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:45:32] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:45:32] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:45:32] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:45:32] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:45:32] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:45:32] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 0 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 3 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:45:33] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:45:34] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:35] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:45:35] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:45:35] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2024-05-30 01:45:35] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:45:35] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:45:35] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-30 01:45:35] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:45:35] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:35] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:45:35] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:45:36] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:45:36] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2024-05-30 01:45:36] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:45:36] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:45:36] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:36] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2024-05-30 01:45:36] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:45:36] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:45:36] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:45:36] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:45:36] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:37] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:45:37] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 118/221 variables, 103/179 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:38] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:45:38] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2024-05-30 01:45:38] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:45:38] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:45:38] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:45:38] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:38] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:45:39] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:45:39] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:40] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:45:40] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:45:40] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/221 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:40] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:45:41] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:45:41] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:41] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:45:41] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-30 01:45:41] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:45:41] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:42] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:43] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:45:43] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:45:43] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:45:43] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:45:43] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-05-30 01:45:43] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/221 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:43] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:45:43] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:45:44] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/221 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:44] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/221 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:45] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:45:45] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:45:45] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:45:45] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:45:45] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/221 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/221 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:46] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/221 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:47] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 3 ms to minimize.
[2024-05-30 01:45:47] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/221 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:47] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:45:47] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:45:47] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:45:47] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-30 01:45:48] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:45:48] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:45:48] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2024-05-30 01:45:48] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/221 variables, 8/225 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/221 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 26 (OVERLAPS) 0/221 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 225 constraints, problems are : Problem set: 0 solved, 117 unsolved in 17941 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 109/122 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:50] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2024-05-30 01:45:50] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:50] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:51] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:45:51] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:45:51] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:45:51] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 118/221 variables, 103/232 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 117/349 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:52] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:45:52] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:45:52] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:45:52] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-30 01:45:53] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:45:53] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:54] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:45:54] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:45:57] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:46:00] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:46:00] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:46:00] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-30 01:46:00] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:46:03] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:46:03] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:46:08] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/221 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 17 (OVERLAPS) 0/221 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 365 constraints, problems are : Problem set: 0 solved, 117 unsolved in 26993 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 132/132 constraints]
After SMT, in 44965ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 44966ms
Starting structural reductions in LTL mode, iteration 1 : 103/122 places, 118/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45109 ms. Remains : 103/122 places, 118/137 transitions.
[2024-05-30 01:46:16] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:46:16] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:46:16] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-30 01:46:16] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:46:16] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:46:16] [INFO ] Time to serialize gal into /tmp/CTLFireability8619936279779207787.gal : 1 ms
[2024-05-30 01:46:16] [INFO ] Time to serialize properties into /tmp/CTLFireability13603218404044291633.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8619936279779207787.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13603218404044291633.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.73191e+09,0.686369,28224,2,5404,5,69373,6,0,532,167818,0


Converting to forward existential form...Done !
original formula: AF(E((!(EG((p41==1))) * (!(AX((((p17==1)&&(p22==1))&&(p31==1)))) + (p108==1))) U !((EF((p19!=1)) + ((p11==1)&&(p116!=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E((!(EG((p41==1))) * (!(!(EX(!((((p17==1)&&(p22==1))&&(p31==1)))))) + (p108==1))) U !((E(TRUE U (p1...199
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...346
Detected timeout of ITS tools.
[2024-05-30 01:46:47] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:46:47] [INFO ] Applying decomposition
[2024-05-30 01:46:47] [INFO ] Flatten gal took : 9 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/graph16122504868877170671.txt' '-o' '/tmp/graph16122504868877170671.bin' '-w' '/tmp/graph16122504868877170671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16122504868877170671.bin' '-l' '-1' '-v' '-w' '/tmp/graph16122504868877170671.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:46:47] [INFO ] Decomposing Gal with order
[2024-05-30 01:46:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:46:47] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-30 01:46:47] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:46:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 01:46:47] [INFO ] Time to serialize gal into /tmp/CTLFireability11951616179602607864.gal : 2 ms
[2024-05-30 01:46:47] [INFO ] Time to serialize properties into /tmp/CTLFireability8992331005597218771.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11951616179602607864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8992331005597218771.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.73191e+09,0.358874,14816,948,49,20074,216,358,39362,52,711,0


Converting to forward existential form...Done !
original formula: AF(E((!(EG((i3.i0.u12.p41==1))) * (!(AX((((i1.u5.p17==1)&&(i2.i1.u7.p22==1))&&(i2.i2.u10.p31==1)))) + (i8.u32.p108==1))) U !((EF((i1.u6.p...203
=> equivalent forward existential formula: [FwdG(Init,!(E((!(EG((i3.i0.u12.p41==1))) * (!(!(EX(!((((i1.u5.p17==1)&&(i2.i1.u7.p22==1))&&(i2.i2.u10.p31==1)))...260
Reverse transition relation is NOT exact ! Due to transitions i1.t74, i1.u4.t0, i1.u4.t1, i1.u4.t2, i1.u5.t76, i2.i1.u9.t3, i2.i1.u9.t4, i2.i1.u9.t5, i2.i2...629
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,17.939,496476,1,0,896215,552,2264,1.23397e+06,285,1611,883261
FORMULA ShieldRVs-PT-003B-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 107 transition count 122
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 107 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 106 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 106 transition count 121
Applied a total of 32 rules in 23 ms. Remains 106 /122 variables (removed 16) and now considering 121/137 (removed 16) transitions.
// Phase 1: matrix 121 rows 106 cols
[2024-05-30 01:47:05] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:47:05] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-30 01:47:05] [INFO ] Invariant cache hit.
[2024-05-30 01:47:05] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-05-30 01:47:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:47:05] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 0 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2024-05-30 01:47:06] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 0 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:47:07] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:47:08] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 19/72 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 2 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:47:09] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 0 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:47:10] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:11] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:47:11] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:47:11] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:47:11] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:47:11] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:47:11] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:47:12] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 11 (OVERLAPS) 121/227 variables, 106/212 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:13] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:47:13] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:14] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:47:14] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:47:14] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2024-05-30 01:47:14] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:47:14] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:47:14] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:47:15] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 13/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:16] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:47:16] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:47:16] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/227 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:17] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:47:17] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/227 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/227 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:18] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:47:18] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/227 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/227 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:19] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:47:20] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:47:20] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:47:20] [INFO ] Deduced a trap composed of 36 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:47:20] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/227 variables, 5/239 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:20] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:47:20] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/227 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:21] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2024-05-30 01:47:21] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:47:22] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:47:22] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-05-30 01:47:22] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:47:22] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 0 ms to minimize.
[2024-05-30 01:47:22] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/227 variables, 7/248 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:22] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/227 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:23] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:47:23] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/227 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:24] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:47:24] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:47:24] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:47:24] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/227 variables, 4/255 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/227 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:25] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 27 (OVERLAPS) 0/227 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:26] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/227 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:26] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:47:26] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:47:26] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:47:27] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:47:27] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/227 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:27] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:47:27] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2024-05-30 01:47:27] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:47:27] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/227 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:28] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:47:28] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:47:28] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:47:28] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:47:29] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:47:29] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:47:29] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/227 variables, 7/273 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/227 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 33 (OVERLAPS) 0/227 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 273 constraints, problems are : Problem set: 0 solved, 120 unsolved in 25620 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 154/154 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 154/167 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:31] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 121/227 variables, 106/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 120/394 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:35] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:47:35] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:47:35] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/227 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:38] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:42] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:45] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:48] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:52] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:55] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:47:55] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/227 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 120 unsolved
[2024-05-30 01:47:58] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:47:58] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:47:59] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:47:59] [INFO ] Deduced a trap composed of 30 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:47:59] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:47:59] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:47:59] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:47:59] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:47:59] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:47:59] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:48:00] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/227 variables, 11/415 constraints. Problems are: Problem set: 0 solved, 120 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 227/227 variables, and 415 constraints, problems are : Problem set: 0 solved, 120 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 176/176 constraints]
After SMT, in 55671ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 55673ms
Starting structural reductions in LTL mode, iteration 1 : 106/122 places, 121/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55817 ms. Remains : 106/122 places, 121/137 transitions.
[2024-05-30 01:48:00] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:48:01] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:48:01] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-30 01:48:01] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:48:01] [INFO ] Flatten gal took : 26 ms
[2024-05-30 01:48:01] [INFO ] Time to serialize gal into /tmp/CTLFireability14754836606922363761.gal : 1 ms
[2024-05-30 01:48:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2889385808676078666.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14754836606922363761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2889385808676078666.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.10795e+09,0.824617,31980,2,5714,5,79474,6,0,547,195125,0


Converting to forward existential form...Done !
original formula: AG((EX(((((p94==0)||(p100==0))||(p109==0))&&(((p67==0)||(p78==0))||(p104==0)))) * ((EG((((EG((p11==1)) + EG((p54==1))) * (p37==0)) * (p46...247
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(((((p94==0)||(p100==0))||(p109==0))&&(((p67==0)||(p78==0))||(p104==0))))))] = FALSE * ...515
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...361
Detected timeout of ITS tools.
[2024-05-30 01:48:31] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:48:31] [INFO ] Applying decomposition
[2024-05-30 01:48:31] [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/graph14457345139565059251.txt' '-o' '/tmp/graph14457345139565059251.bin' '-w' '/tmp/graph14457345139565059251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14457345139565059251.bin' '-l' '-1' '-v' '-w' '/tmp/graph14457345139565059251.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:48:31] [INFO ] Decomposing Gal with order
[2024-05-30 01:48:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:48:31] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-30 01:48:31] [INFO ] Flatten gal took : 22 ms
[2024-05-30 01:48:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 01:48:31] [INFO ] Time to serialize gal into /tmp/CTLFireability221169000092079352.gal : 11 ms
[2024-05-30 01:48:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15266692756724303033.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability221169000092079352.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15266692756724303033.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.10795e+09,0.393155,18220,1054,59,26371,203,318,63662,45,1124,0


Converting to forward existential form...Done !
original formula: AG((EX(((((i8.u28.p94==0)||(i8.u30.p100==0))||(i9.u33.p109==0))&&(((i6.u21.p67==0)||(i7.u24.p78==0))||(i9.u32.p104==0)))) * ((EG((((EG((i...351
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(((((i8.u28.p94==0)||(i8.u30.p100==0))||(i9.u33.p109==0))&&(((i6.u21.p67==0)||(i7.u24.p...659
Reverse transition relation is NOT exact ! Due to transitions i0.u1.t80, i0.u11.t6, i0.u11.t7, i0.u11.t8, i2.t77, i2.u4.t0, i2.u4.t1, i2.u4.t2, i2.u5.t79, ...638
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 121 transition count 123
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 108 transition count 123
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 26 place count 108 transition count 109
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 54 place count 94 transition count 109
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 73 place count 75 transition count 90
Iterating global reduction 2 with 19 rules applied. Total rules applied 92 place count 75 transition count 90
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 92 place count 75 transition count 81
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 110 place count 66 transition count 81
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 150 place count 46 transition count 61
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 44 transition count 59
Applied a total of 152 rules in 53 ms. Remains 44 /122 variables (removed 78) and now considering 59/137 (removed 78) transitions.
// Phase 1: matrix 59 rows 44 cols
[2024-05-30 01:49:01] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:49:01] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 01:49:01] [INFO ] Invariant cache hit.
[2024-05-30 01:49:01] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-30 01:49:01] [INFO ] Redundant transitions in 25 ms returned [58]
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 57 sub problems to find dead transitions.
// Phase 1: matrix 58 rows 44 cols
[2024-05-30 01:49:01] [INFO ] Computed 13 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:49:01] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:49:01] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:49:01] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:49:01] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:49:01] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:49:01] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:49:01] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:49:01] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:49:01] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:49:02] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 58/102 variables, 44/86 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:49:03] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-05-30 01:49:03] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:49:03] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-30 01:49:03] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-05-30 01:49:03] [INFO ] Deduced a trap composed of 11 places in 411 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:49:04] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:49:04] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:49:04] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:49:04] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:49:04] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:49:04] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:49:04] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:49:05] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:49:05] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/102 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 14 (OVERLAPS) 0/102 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 100 constraints, problems are : Problem set: 0 solved, 57 unsolved in 4070 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 43/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 58/102 variables, 44/100 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 57/157 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:49:05] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:49:06] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-05-30 01:49:06] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 160 constraints, problems are : Problem set: 0 solved, 57 unsolved in 2029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 46/46 constraints]
After SMT, in 6116ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 6117ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/122 places, 58/137 transitions.
Applied a total of 0 rules in 7 ms. Remains 44 /44 variables (removed 0) and now considering 58/58 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 6373 ms. Remains : 44/122 places, 58/137 transitions.
[2024-05-30 01:49:07] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:49:07] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:49:07] [INFO ] Input system was already deterministic with 58 transitions.
[2024-05-30 01:49:07] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:49:07] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:49:07] [INFO ] Time to serialize gal into /tmp/CTLFireability14845841500625167396.gal : 1 ms
[2024-05-30 01:49:07] [INFO ] Time to serialize properties into /tmp/CTLFireability6282546998066118174.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14845841500625167396.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6282546998066118174.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.61448e+06,0.075222,6620,2,933,5,10862,6,0,237,20865,0


Converting to forward existential form...Done !
original formula: AG(AF((p21==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p21==1)))] = FALSE
Hit Full ! (commute/partial/dont) 53/0/5
(forward)formula 0,0,3.25756,117676,1,0,42,439138,20,2,1405,945361,42
FORMULA ShieldRVs-PT-003B-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 106 transition count 121
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 106 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 105 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 105 transition count 120
Applied a total of 34 rules in 4 ms. Remains 105 /122 variables (removed 17) and now considering 120/137 (removed 17) transitions.
// Phase 1: matrix 120 rows 105 cols
[2024-05-30 01:49:10] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:49:10] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 01:49:10] [INFO ] Invariant cache hit.
[2024-05-30 01:49:11] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-30 01:49:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:11] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:49:11] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:49:11] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:49:11] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:49:11] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:49:11] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:49:11] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:49:11] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:49:11] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:49:11] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 0 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-05-30 01:49:12] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:49:13] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-05-30 01:49:13] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-30 01:49:13] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:49:13] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:49:13] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:49:13] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:49:13] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:49:13] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:13] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:49:13] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:49:13] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:49:13] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:49:14] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:49:14] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:49:14] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:49:14] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:49:14] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:14] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:49:14] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-30 01:49:14] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:49:14] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:49:14] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:49:14] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:49:14] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:49:14] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:49:15] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:49:15] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 120/225 variables, 105/174 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:15] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:49:15] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:49:15] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:49:16] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 4 ms to minimize.
[2024-05-30 01:49:16] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 4 ms to minimize.
[2024-05-30 01:49:16] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:49:16] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:49:16] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:49:16] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:49:16] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 10/184 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:16] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 2 ms to minimize.
[2024-05-30 01:49:16] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:49:16] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:49:17] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:49:17] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:49:17] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 6/190 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:18] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:18] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:49:18] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:49:18] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:18] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:49:19] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:49:19] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:19] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:49:20] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-30 01:49:20] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:49:20] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:49:20] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:49:20] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:49:20] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:49:20] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2024-05-30 01:49:20] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:49:20] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:49:20] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 11/208 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:21] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:49:21] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:49:21] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:49:21] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:49:21] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:49:21] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:49:21] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/225 variables, 7/215 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:21] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:49:22] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:22] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:49:22] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:23] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/225 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:24] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:49:24] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:49:24] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/225 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:25] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:49:25] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2024-05-30 01:49:25] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 5 ms to minimize.
[2024-05-30 01:49:25] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:49:25] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:49:25] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/225 variables, 6/229 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/225 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 22 (OVERLAPS) 0/225 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 229 constraints, problems are : Problem set: 0 solved, 119 unsolved in 16347 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 111/111 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 111/124 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:27] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:49:27] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:49:28] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/225 variables, 105/232 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 119/351 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:29] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2024-05-30 01:49:29] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:49:29] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:49:29] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:49:29] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:49:29] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:49:30] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2024-05-30 01:49:30] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:49:30] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:49:30] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 10/361 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:32] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:49:32] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 2/363 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:35] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:40] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:49:40] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:49:40] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:49:40] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/225 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:49:43] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 14 (OVERLAPS) 0/225 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 369 constraints, problems are : Problem set: 0 solved, 119 unsolved in 25344 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 132/132 constraints]
After SMT, in 41731ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 41733ms
Starting structural reductions in LTL mode, iteration 1 : 105/122 places, 120/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41861 ms. Remains : 105/122 places, 120/137 transitions.
[2024-05-30 01:49:52] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:49:52] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:49:52] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-30 01:49:52] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:49:52] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:49:52] [INFO ] Time to serialize gal into /tmp/CTLFireability11636621979998938551.gal : 2 ms
[2024-05-30 01:49:52] [INFO ] Time to serialize properties into /tmp/CTLFireability14471848137138059711.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11636621979998938551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14471848137138059711.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.83913e+09,0.761329,30572,2,5770,5,75335,6,0,542,184077,0


Converting to forward existential form...Done !
original formula: AG(((!(E((p58==1) U !(E((p33==1) U ((p62==1)&&(p75==1)))))) + (p37==0)) + !(A((AF((p15==1)) + EX((p27==1))) U EF((p16==1))))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(!(!((E(!(E(TRUE U (p16==1))) U (!((!(EG(!((p15==1)))) + EX((p27==1)))) * !(E(TRUE U...276
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...356
Detected timeout of ITS tools.
[2024-05-30 01:50:22] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:50:22] [INFO ] Applying decomposition
[2024-05-30 01:50:22] [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/graph13397197600429338942.txt' '-o' '/tmp/graph13397197600429338942.bin' '-w' '/tmp/graph13397197600429338942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13397197600429338942.bin' '-l' '-1' '-v' '-w' '/tmp/graph13397197600429338942.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:50:22] [INFO ] Decomposing Gal with order
[2024-05-30 01:50:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:50:22] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-30 01:50:22] [INFO ] Flatten gal took : 27 ms
[2024-05-30 01:50:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 01:50:22] [INFO ] Time to serialize gal into /tmp/CTLFireability6691073802506058843.gal : 2 ms
[2024-05-30 01:50:22] [INFO ] Time to serialize properties into /tmp/CTLFireability17157813259201999102.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6691073802506058843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17157813259201999102.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.83913e+09,0.341943,17444,1015,58,25090,260,335,57852,49,1150,0


Converting to forward existential form...Done !
original formula: AG(((!(E((i4.u17.p58==1) U !(E((i2.i2.u10.p33==1) U ((i5.u18.p62==1)&&(i6.u23.p75==1)))))) + (i3.u12.p37==0)) + !(A((AF((i1.u5.p15==1)) +...203
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(!(!((E(!(E(TRUE U (i1.u5.p16==1))) U (!((!(EG(!((i1.u5.p15==1)))) + EX((i2.i1.u8.p2...347
Reverse transition relation is NOT exact ! Due to transitions i1.u4.t76, i1.u5.t0, i1.u5.t1, i1.u5.t2, i1.u5.t3, i2.i1.u8.t4, i2.i1.u8.t5, i2.i1.u8.t6, i2....642
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 106 transition count 121
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 106 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 105 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 105 transition count 120
Applied a total of 34 rules in 10 ms. Remains 105 /122 variables (removed 17) and now considering 120/137 (removed 17) transitions.
// Phase 1: matrix 120 rows 105 cols
[2024-05-30 01:50:53] [INFO ] Computed 13 invariants in 0 ms
[2024-05-30 01:50:53] [INFO ] Implicit Places using invariants in 556 ms returned []
[2024-05-30 01:50:53] [INFO ] Invariant cache hit.
[2024-05-30 01:50:53] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-05-30 01:50:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:50:54] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:50:54] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:50:54] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:50:54] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:50:54] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:50:54] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:50:54] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:50:54] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2024-05-30 01:50:54] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:50:54] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:50:54] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2024-05-30 01:50:54] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:50:54] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:50:54] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:50:55] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:50:56] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:50:56] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:50:56] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 4 ms to minimize.
[2024-05-30 01:50:56] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-30 01:50:56] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:50:56] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:50:56] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:50:56] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:50:56] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:50:56] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:50:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:50:56] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:50:57] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:50:58] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-30 01:50:58] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:50:58] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:50:58] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-30 01:50:58] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:50:58] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:50:58] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:50:58] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:50:58] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:50:58] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:50:59] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:50:59] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:50:59] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:50:59] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:50:59] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:00] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:00] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:51:00] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:51:00] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:51:00] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:51:00] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:51:00] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:51:00] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 120/225 variables, 105/198 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:02] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/225 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:02] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:51:03] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:51:03] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:51:03] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:51:03] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:51:03] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:51:03] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:51:03] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/225 variables, 8/207 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:04] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/225 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:05] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:51:05] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:51:05] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:06] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:51:06] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/225 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/225 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:07] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:51:07] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:51:07] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/225 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:08] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:51:08] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:51:08] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:51:08] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:51:08] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:51:08] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:51:09] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:51:09] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/225 variables, 8/224 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/225 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:09] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:51:10] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:51:10] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 0 ms to minimize.
[2024-05-30 01:51:10] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 0 ms to minimize.
[2024-05-30 01:51:10] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:51:10] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:51:10] [INFO ] Deduced a trap composed of 31 places in 27 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/225 variables, 7/231 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:11] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/225 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/225 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 27 (OVERLAPS) 0/225 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 232 constraints, problems are : Problem set: 0 solved, 119 unsolved in 19359 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 114/114 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 114/127 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:13] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:51:13] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:51:13] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-05-30 01:51:13] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:51:13] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:51:13] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:51:13] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:51:13] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:14] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-30 01:51:14] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:51:14] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:51:14] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 4/139 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/225 variables, 105/244 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 119/363 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:15] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:51:15] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:51:16] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:51:16] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:51:16] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:51:16] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 6/369 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:18] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:51:18] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:51:18] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:51:19] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/225 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:21] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:51:21] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:23] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:51:23] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:51:23] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 3/378 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:26] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:29] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:51:30] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:32] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:51:32] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:51:32] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
[2024-05-30 01:51:32] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:51:32] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/225 variables, 5/386 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:35] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-05-30 01:51:37] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:51:37] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2024-05-30 01:51:37] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:51:37] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:51:38] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 5/392 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 225/225 variables, and 392 constraints, problems are : Problem set: 0 solved, 119 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 155/155 constraints]
After SMT, in 49399ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 49401ms
Starting structural reductions in LTL mode, iteration 1 : 105/122 places, 120/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50045 ms. Remains : 105/122 places, 120/137 transitions.
[2024-05-30 01:51:43] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:51:43] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:51:43] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-30 01:51:43] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:51:43] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:51:43] [INFO ] Time to serialize gal into /tmp/CTLFireability398016603326464843.gal : 2 ms
[2024-05-30 01:51:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8600556423510489465.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability398016603326464843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8600556423510489465.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.90521e+09,0.809758,31648,2,5706,5,77493,6,0,542,193052,0


Converting to forward existential form...Done !
original formula: AX((EG(EF(((p71==0)&&((p106==0)||(p120==0))))) * (E(EX(((p27==1)||(p68==1))) U !(AF((((p51==1)&&(p92==1))&&(p120==1))))) + (EX(EG((p37==1...258
=> equivalent forward existential formula: ([(EY(Init) * !(EG(E(TRUE U ((p71==0)&&((p106==0)||(p120==0)))))))] = FALSE * [((EY(Init) * !((EX(EG((p37==1))) ...346
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...356
Detected timeout of ITS tools.
[2024-05-30 01:52:13] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:52:13] [INFO ] Applying decomposition
[2024-05-30 01:52:13] [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/graph14084195428300320865.txt' '-o' '/tmp/graph14084195428300320865.bin' '-w' '/tmp/graph14084195428300320865.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14084195428300320865.bin' '-l' '-1' '-v' '-w' '/tmp/graph14084195428300320865.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:52:13] [INFO ] Decomposing Gal with order
[2024-05-30 01:52:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:52:13] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-30 01:52:13] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:52:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 01:52:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13413076574032798271.gal : 1 ms
[2024-05-30 01:52:13] [INFO ] Time to serialize properties into /tmp/CTLFireability10663225835711144358.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13413076574032798271.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10663225835711144358.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.90521e+09,0.309983,14808,966,59,21357,232,344,44917,45,1161,0


Converting to forward existential form...Done !
original formula: AX((EG(EF(((i5.u22.p71==0)&&((i8.u32.p106==0)||(i9.u35.p120==0))))) * (E(EX(((i1.i1.u9.p27==1)||(i5.u21.p68==1))) U !(AF((((i4.u17.p51==1...378
=> equivalent forward existential formula: ([(EY(Init) * !(EG(E(TRUE U ((i5.u22.p71==0)&&((i8.u32.p106==0)||(i9.u35.p120==0)))))))] = FALSE * [((EY(Init) *...466
Reverse transition relation is NOT exact ! Due to transitions t40, i1.i1.u9.t3, i1.i1.u9.t4, i1.i1.u9.t5, i1.i1.u9.t6, i1.i2.u8.t70, i2.t76, i2.u5.t0, i2.u...633
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,29.895,866008,1,0,1.45646e+06,480,2061,2.5726e+06,246,1500,1301390
FORMULA ShieldRVs-PT-003B-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 121 transition count 124
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 109 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 108 transition count 123
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 26 place count 108 transition count 110
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 52 place count 95 transition count 110
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 68 place count 79 transition count 94
Iterating global reduction 3 with 16 rules applied. Total rules applied 84 place count 79 transition count 94
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 84 place count 79 transition count 86
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 100 place count 71 transition count 86
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 140 place count 51 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 49 transition count 64
Applied a total of 142 rules in 23 ms. Remains 49 /122 variables (removed 73) and now considering 64/137 (removed 73) transitions.
// Phase 1: matrix 64 rows 49 cols
[2024-05-30 01:52:43] [INFO ] Computed 13 invariants in 0 ms
[2024-05-30 01:52:43] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 01:52:43] [INFO ] Invariant cache hit.
[2024-05-30 01:52:43] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-30 01:52:43] [INFO ] Redundant transitions in 58 ms returned [63]
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 62 sub problems to find dead transitions.
// Phase 1: matrix 63 rows 49 cols
[2024-05-30 01:52:43] [INFO ] Computed 13 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-30 01:52:43] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:52:43] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:52:43] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:52:43] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 7 ms to minimize.
[2024-05-30 01:52:43] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:52:44] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:52:44] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:52:44] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:52:44] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:52:44] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:52:44] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:52:44] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:52:44] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:52:44] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:52:44] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:52:44] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-30 01:52:44] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:52:44] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-05-30 01:52:44] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 1/49 variables, 3/32 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 9 places in 370 ms of which 20 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 0 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:52:45] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-30 01:52:46] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:52:46] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 63/112 variables, 49/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-30 01:52:46] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:52:46] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:52:46] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:52:46] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 4/103 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-30 01:52:46] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:52:46] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:52:46] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:52:46] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:52:46] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:52:46] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:52:47] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 7/110 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-30 01:52:47] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 11 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/112 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/112 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-30 01:52:47] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:52:47] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/112 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/112 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 16 (OVERLAPS) 0/112 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 113 constraints, problems are : Problem set: 0 solved, 62 unsolved in 4598 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/49 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 63/112 variables, 49/113 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 62/175 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-30 01:52:48] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-30 01:52:48] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 177 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2003 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 53/53 constraints]
After SMT, in 6645ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 6645ms
Starting structural reductions in SI_CTL mode, iteration 1 : 49/122 places, 63/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 6886 ms. Remains : 49/122 places, 63/137 transitions.
[2024-05-30 01:52:50] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:52:50] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:52:50] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-30 01:52:50] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:52:50] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:52:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1541625213360681138.gal : 1 ms
[2024-05-30 01:52:50] [INFO ] Time to serialize properties into /tmp/CTLFireability1577875929806285418.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1541625213360681138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1577875929806285418.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.02704e+06,0.078964,7112,2,1542,5,12115,6,0,261,23097,0


Converting to forward existential form...Done !
original formula: EG((!(E((p102!=1) U ((p15==1)&&(p98==1)))) + (p21==1)))
=> equivalent forward existential formula: [FwdG(Init,(!(E((p102!=1) U ((p15==1)&&(p98==1)))) + (p21==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21...390
(forward)formula 0,1,4.69941,170232,1,0,484,668123,153,226,2033,1.4869e+06,401
FORMULA ShieldRVs-PT-003B-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 121 transition count 125
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 110 transition count 125
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 22 place count 110 transition count 109
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 54 place count 94 transition count 109
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 73 place count 75 transition count 90
Iterating global reduction 2 with 19 rules applied. Total rules applied 92 place count 75 transition count 90
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 92 place count 75 transition count 81
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 110 place count 66 transition count 81
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 142 place count 50 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 48 transition count 63
Applied a total of 144 rules in 18 ms. Remains 48 /122 variables (removed 74) and now considering 63/137 (removed 74) transitions.
// Phase 1: matrix 63 rows 48 cols
[2024-05-30 01:52:54] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:52:55] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 01:52:55] [INFO ] Invariant cache hit.
[2024-05-30 01:52:55] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-30 01:52:55] [INFO ] Redundant transitions in 236 ms returned [62]
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 59 sub problems to find dead transitions.
// Phase 1: matrix 62 rows 48 cols
[2024-05-30 01:52:55] [INFO ] Computed 13 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:52:55] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:52:55] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:52:55] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:52:55] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:52:55] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:52:55] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:52:55] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:52:55] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 16/30 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:52:56] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:52:57] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:52:58] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:52:58] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:52:58] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:52:58] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:52:58] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:52:58] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:52:58] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:52:58] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:52:58] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (OVERLAPS) 62/110 variables, 48/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:52:58] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:52:58] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:52:58] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:52:59] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:52:59] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 5/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:52:59] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/110 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:52:59] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:52:59] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:52:59] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:52:59] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:52:59] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:52:59] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:52:59] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/110 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:52:59] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:52:59] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/110 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 18 (OVERLAPS) 0/110 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 138 constraints, problems are : Problem set: 0 solved, 59 unsolved in 4990 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 48/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 29/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 62/110 variables, 48/138 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 59/197 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:53:00] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:53:01] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:53:02] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/110 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 0/110 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 200 constraints, problems are : Problem set: 0 solved, 59 unsolved in 3765 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 48/48 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 80/80 constraints]
After SMT, in 8783ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 8783ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/122 places, 62/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 9170 ms. Remains : 48/122 places, 62/137 transitions.
[2024-05-30 01:53:04] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:53:04] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:53:04] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-30 01:53:04] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:53:04] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:53:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14680252828410119233.gal : 1 ms
[2024-05-30 01:53:04] [INFO ] Time to serialize properties into /tmp/CTLFireability11522109085118303461.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14680252828410119233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11522109085118303461.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.42371e+06,0.102982,6584,2,972,5,10979,6,0,255,20288,0


Converting to forward existential form...Done !
original formula: AF(((EG((p91==1)) + (p8==1)) + (p46==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((EG((p91==1)) + (p8==1)) + (p46==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t35, t36...380
(forward)formula 0,1,1.89141,70668,1,0,435,336389,152,162,2035,530761,430
FORMULA ShieldRVs-PT-003B-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 104 transition count 119
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 104 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 103 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 103 transition count 118
Applied a total of 38 rules in 3 ms. Remains 103 /122 variables (removed 19) and now considering 118/137 (removed 19) transitions.
// Phase 1: matrix 118 rows 103 cols
[2024-05-30 01:53:06] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:53:06] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-30 01:53:06] [INFO ] Invariant cache hit.
[2024-05-30 01:53:06] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-05-30 01:53:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:53:07] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:53:08] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:53:09] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-30 01:53:09] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:53:09] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:53:09] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:53:09] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:53:09] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:53:09] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-30 01:53:09] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-30 01:53:09] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:09] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:53:09] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:53:09] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:53:10] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:53:10] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:53:10] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:53:10] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:53:10] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:10] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:53:10] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2024-05-30 01:53:10] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:53:10] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2024-05-30 01:53:10] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:53:10] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:53:10] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:11] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:53:11] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:53:11] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:53:11] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-30 01:53:11] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:53:11] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:11] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:53:12] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 118/221 variables, 103/179 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:12] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-05-30 01:53:12] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-30 01:53:13] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-05-30 01:53:13] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:53:13] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-30 01:53:13] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 6/185 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:13] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:53:13] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:53:13] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:14] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:53:14] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:53:15] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/221 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:15] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:53:15] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2024-05-30 01:53:15] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:16] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:53:16] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:53:16] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:53:16] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:17] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:17] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:53:17] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:53:17] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:53:17] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:53:17] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:53:17] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/221 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:18] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:53:18] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:53:18] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/221 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:19] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/221 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:19] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:53:19] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:53:19] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:53:19] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:53:20] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/221 variables, 5/214 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/221 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:21] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/221 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:21] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:53:21] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 0 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/221 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:22] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:53:22] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:53:22] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:53:22] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:53:22] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2024-05-30 01:53:22] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:53:22] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:53:22] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/221 variables, 8/225 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/221 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 26 (OVERLAPS) 0/221 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 225 constraints, problems are : Problem set: 0 solved, 117 unsolved in 17808 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/103 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 109/122 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:24] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:53:24] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:25] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:25] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:53:25] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:53:25] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:53:25] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 118/221 variables, 103/232 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 117/349 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:27] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:53:27] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-30 01:53:27] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-30 01:53:27] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-30 01:53:27] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-30 01:53:27] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 6/355 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:29] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:53:29] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:31] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:34] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:53:34] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:53:34] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:53:34] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:37] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:53:37] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/221 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-05-30 01:53:42] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/221 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 17 (OVERLAPS) 0/221 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 365 constraints, problems are : Problem set: 0 solved, 117 unsolved in 25584 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 132/132 constraints]
After SMT, in 43414ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 43415ms
Starting structural reductions in LTL mode, iteration 1 : 103/122 places, 118/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43957 ms. Remains : 103/122 places, 118/137 transitions.
[2024-05-30 01:53:49] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:53:49] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:53:50] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-30 01:53:50] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:53:50] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:53:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4835147444923714955.gal : 1 ms
[2024-05-30 01:53:50] [INFO ] Time to serialize properties into /tmp/CTLFireability4057789924921712467.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4835147444923714955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4057789924921712467.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.73191e+09,0.688044,28232,2,5404,5,69373,6,0,532,167818,0


Converting to forward existential form...Done !
original formula: !(A(AX(EG(EF((p118==1)))) U !(AG(AX((p11!=1))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(!(!(E(TRUE U !(!(EX(!((p11!=1)))))))))) * !(!(EX(!(EG(E(TRUE U (p118==1)))))))) * !(E(TRUE U !(!...252
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...346
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-30 01:54:20] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:54:20] [INFO ] Applying decomposition
[2024-05-30 01:54:20] [INFO ] Flatten gal took : 7 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/graph15108212478941613160.txt' '-o' '/tmp/graph15108212478941613160.bin' '-w' '/tmp/graph15108212478941613160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15108212478941613160.bin' '-l' '-1' '-v' '-w' '/tmp/graph15108212478941613160.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:54:20] [INFO ] Decomposing Gal with order
[2024-05-30 01:54:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:54:20] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-30 01:54:20] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:54:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 01:54:20] [INFO ] Time to serialize gal into /tmp/CTLFireability5870660134285840398.gal : 10 ms
[2024-05-30 01:54:20] [INFO ] Time to serialize properties into /tmp/CTLFireability6305746141801688982.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5870660134285840398.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6305746141801688982.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.73191e+09,0.220755,12412,885,45,16321,175,329,30952,50,591,0


Converting to forward existential form...Done !
original formula: !(A(AX(EG(EF((i9.u35.p118==1)))) U !(AG(AX((i0.i1.u6.p11!=1))))))
=> equivalent forward existential formula: ([((FwdU(Init,!(!(!(E(TRUE U !(!(EX(!((i0.i1.u6.p11!=1)))))))))) * !(!(EX(!(EG(E(TRUE U (i9.u35.p118==1)))))))) ...286
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u1.t77, i0.i0.u5.t0, i0.i0.u5.t1, i0.i0.u5.t2, i0.i1.t74, i0.i1.u6.t76, i1.u8.t68, i1.u...620
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,15.7064,458596,1,0,822997,478,1964,1.3613e+06,257,1263,822184
FORMULA ShieldRVs-PT-003B-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 121 transition count 125
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 110 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 109 transition count 124
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 24 place count 109 transition count 108
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 56 place count 93 transition count 108
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 74 place count 75 transition count 90
Iterating global reduction 3 with 18 rules applied. Total rules applied 92 place count 75 transition count 90
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 92 place count 75 transition count 82
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 108 place count 67 transition count 82
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 148 place count 47 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 46 transition count 61
Applied a total of 149 rules in 18 ms. Remains 46 /122 variables (removed 76) and now considering 61/137 (removed 76) transitions.
// Phase 1: matrix 61 rows 46 cols
[2024-05-30 01:54:35] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:54:35] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 01:54:36] [INFO ] Invariant cache hit.
[2024-05-30 01:54:36] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-30 01:54:36] [INFO ] Redundant transitions in 43 ms returned [60]
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 59 sub problems to find dead transitions.
// Phase 1: matrix 60 rows 46 cols
[2024-05-30 01:54:36] [INFO ] Computed 13 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:54:36] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 1/46 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:54:37] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 12/49 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/46 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/46 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:38] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/46 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/46 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 14 (OVERLAPS) 60/106 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/106 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:39] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:54:39] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:54:39] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:54:39] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-30 01:54:39] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/106 variables, 5/113 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:39] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:54:39] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/106 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/106 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 19 (OVERLAPS) 0/106 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 115 constraints, problems are : Problem set: 0 solved, 59 unsolved in 4086 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:40] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:54:40] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:40] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:54:40] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:54:40] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:40] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:54:40] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 59 unsolved
[2024-05-30 01:54:40] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 60/106 variables, 46/123 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 59/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/106 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 13 (OVERLAPS) 0/106 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 182 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1921 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 64/64 constraints]
After SMT, in 6040ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 6041ms
Starting structural reductions in SI_CTL mode, iteration 1 : 46/122 places, 60/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 6289 ms. Remains : 46/122 places, 60/137 transitions.
[2024-05-30 01:54:42] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:54:42] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:54:42] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-30 01:54:42] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:54:42] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:54:42] [INFO ] Time to serialize gal into /tmp/CTLFireability11410896298921816243.gal : 1 ms
[2024-05-30 01:54:42] [INFO ] Time to serialize properties into /tmp/CTLFireability3645204932122728661.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11410896298921816243.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3645204932122728661.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.33854e+06,0.11211,7628,2,973,5,13401,6,0,246,27640,0


Converting to forward existential form...Done !
original formula: E((p27==1) U AF((p112==1)))
=> equivalent forward existential formula: [(FwdU(Init,(p27==1)) * !(EG(!((p112==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t33...375
Hit Full ! (commute/partial/dont) 57/0/3
(forward)formula 0,1,7.96632,261900,1,0,494,1.15616e+06,150,205,1976,2.24931e+06,517
FORMULA ShieldRVs-PT-003B-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 122 transition count 127
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 112 transition count 127
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 20 place count 112 transition count 110
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 54 place count 95 transition count 110
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 68 place count 81 transition count 96
Iterating global reduction 2 with 14 rules applied. Total rules applied 82 place count 81 transition count 96
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 82 place count 81 transition count 91
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 76 transition count 91
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 124 place count 60 transition count 75
Applied a total of 124 rules in 16 ms. Remains 60 /122 variables (removed 62) and now considering 75/137 (removed 62) transitions.
// Phase 1: matrix 75 rows 60 cols
[2024-05-30 01:54:50] [INFO ] Computed 13 invariants in 2 ms
[2024-05-30 01:54:50] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-30 01:54:50] [INFO ] Invariant cache hit.
[2024-05-30 01:54:50] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-30 01:54:50] [INFO ] Redundant transitions in 14 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-30 01:54:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-30 01:54:50] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:54:50] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:54:50] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:54:50] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:54:50] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:54:50] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:54:50] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:54:50] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:54:50] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:54:51] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:54:52] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:54:52] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-30 01:54:52] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:54:52] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:54:52] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-30 01:54:52] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:54:52] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 01:54:52] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:54:52] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:54:52] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-30 01:54:52] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:54:52] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:54:52] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:54:52] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-30 01:54:53] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:54:53] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-30 01:54:53] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 75/135 variables, 60/120 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-30 01:54:53] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:54:53] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:54:53] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:54:53] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:54:53] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-30 01:54:53] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:54:53] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-30 01:54:54] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:54:54] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 9/129 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-30 01:54:54] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-30 01:54:54] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:54:54] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-30 01:54:54] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:54:54] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 5/134 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-30 01:54:54] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-30 01:54:54] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-30 01:54:54] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:54:54] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2024-05-30 01:54:54] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:54:54] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-30 01:54:55] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:54:55] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:54:55] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:54:55] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:54:55] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/135 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 15 (OVERLAPS) 0/135 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 145 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5622 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-30 01:54:56] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-30 01:54:56] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-30 01:54:56] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 01:54:56] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-30 01:54:56] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:54:56] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-30 01:54:56] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:54:56] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:54:56] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-30 01:54:56] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:54:56] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 9/96 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 75/135 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 74/230 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-30 01:54:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:54:57] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-30 01:54:57] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-30 01:54:57] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 4/234 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 74 unsolved
[2024-05-30 01:54:59] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/135 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 12 (OVERLAPS) 0/135 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 235 constraints, problems are : Problem set: 0 solved, 74 unsolved in 6058 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 88/88 constraints]
After SMT, in 11708ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 11713ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/122 places, 75/137 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11862 ms. Remains : 60/122 places, 75/137 transitions.
[2024-05-30 01:55:02] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:55:02] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:55:02] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-30 01:55:02] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:55:02] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:55:02] [INFO ] Time to serialize gal into /tmp/CTLFireability11715399370325929014.gal : 2 ms
[2024-05-30 01:55:02] [INFO ] Time to serialize properties into /tmp/CTLFireability3769242170013787232.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11715399370325929014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3769242170013787232.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16674e+07,0.194172,10624,2,1564,5,22285,6,0,317,45739,0


Converting to forward existential form...Done !
original formula: E(((!((E((p27!=1) U !(AF((((p51==1)&&(p95==1))&&(p120==1))))) * (p48==1))) + !(EF(((p53==1)||(p96==1))))) + (p116==1)) U ((p64==1) * (E(E...293
=> equivalent forward existential formula: ([(FwdU(FwdU((FwdU(Init,((!((E((p27!=1) U !(!(EG(!((((p51==1)&&(p95==1))&&(p120==1))))))) * (p48==1))) + !(E(TRU...543
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...390
(forward)formula 0,0,29.9091,846648,1,0,935,3.8734e+06,211,408,2482,7.17249e+06,973
FORMULA ShieldRVs-PT-003B-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 122/122 places, 137/137 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 122 transition count 128
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 113 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 112 transition count 127
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 20 place count 112 transition count 113
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 48 place count 98 transition count 113
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 65 place count 81 transition count 96
Iterating global reduction 3 with 17 rules applied. Total rules applied 82 place count 81 transition count 96
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 82 place count 81 transition count 92
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 90 place count 77 transition count 92
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 124 place count 60 transition count 75
Applied a total of 124 rules in 13 ms. Remains 60 /122 variables (removed 62) and now considering 75/137 (removed 62) transitions.
// Phase 1: matrix 75 rows 60 cols
[2024-05-30 01:55:32] [INFO ] Computed 13 invariants in 1 ms
[2024-05-30 01:55:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 01:55:32] [INFO ] Invariant cache hit.
[2024-05-30 01:55:32] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-30 01:55:32] [INFO ] Redundant transitions in 14 ms returned [74]
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 73 sub problems to find dead transitions.
// Phase 1: matrix 74 rows 60 cols
[2024-05-30 01:55:32] [INFO ] Computed 13 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-30 01:55:32] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-30 01:55:32] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-30 01:55:32] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:55:32] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:55:32] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-30 01:55:32] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-30 01:55:32] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:55:32] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:55:32] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:55:33] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:55:34] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-30 01:55:34] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-30 01:55:34] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 74/134 variables, 60/104 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-30 01:55:34] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 01:55:34] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:55:34] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-30 01:55:34] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-30 01:55:34] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-30 01:55:35] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 6/110 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-30 01:55:35] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-30 01:55:35] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-30 01:55:35] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:55:35] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-30 01:55:35] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-30 01:55:35] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-30 01:55:36] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-30 01:55:36] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-30 01:55:36] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-30 01:55:36] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 01:55:36] [INFO ] Deduced a trap composed of 13 places in 15 ms of which 0 ms to minimize.
[2024-05-30 01:55:36] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-30 01:55:36] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-30 01:55:36] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-30 01:55:36] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-30 01:55:36] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/134 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/134 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-30 01:55:37] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-30 01:55:37] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/134 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-30 01:55:37] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-30 01:55:37] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/134 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 73 unsolved
[2024-05-30 01:55:37] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/134 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/134 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 20 (OVERLAPS) 0/134 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 131 constraints, problems are : Problem set: 0 solved, 73 unsolved in 6332 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/134 variables, 60/131 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 73/204 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 204 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1912 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 58/58 constraints]
After SMT, in 8266ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 8266ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/122 places, 74/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 8411 ms. Remains : 60/122 places, 74/137 transitions.
[2024-05-30 01:55:40] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:55:40] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:55:40] [INFO ] Input system was already deterministic with 74 transitions.
[2024-05-30 01:55:40] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:55:40] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:55:40] [INFO ] Time to serialize gal into /tmp/CTLFireability6466556915095556539.gal : 1 ms
[2024-05-30 01:55:40] [INFO ] Time to serialize properties into /tmp/CTLFireability7663942725244030569.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6466556915095556539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7663942725244030569.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.58123e+07,0.139415,9296,2,1464,5,18177,6,0,316,37155,0


Converting to forward existential form...Done !
original formula: E(((AF((((p95==1)&&(p100==1))&&(p109==1))) * !((((p51==1)&&(p95==1))&&(p120==1)))) + (A(AF(((p57==1)&&(p2==1))) U ((p90==1)||((p92==1)&&(...239
=> equivalent forward existential formula: ([(FwdU(Init,((!(EG(!((((p95==1)&&(p100==1))&&(p109==1))))) * !((((p51==1)&&(p95==1))&&(p120==1)))) + (!((E(!(((...709
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...375
Detected timeout of ITS tools.
[2024-05-30 01:56:10] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:56:10] [INFO ] Applying decomposition
[2024-05-30 01:56:10] [INFO ] Flatten gal took : 2 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/graph4814855745152367801.txt' '-o' '/tmp/graph4814855745152367801.bin' '-w' '/tmp/graph4814855745152367801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4814855745152367801.bin' '-l' '-1' '-v' '-w' '/tmp/graph4814855745152367801.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:56:10] [INFO ] Decomposing Gal with order
[2024-05-30 01:56:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:56:10] [INFO ] Removed a total of 86 redundant transitions.
[2024-05-30 01:56:10] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:56:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 8 ms.
[2024-05-30 01:56:10] [INFO ] Time to serialize gal into /tmp/CTLFireability11248222022620831116.gal : 1 ms
[2024-05-30 01:56:10] [INFO ] Time to serialize properties into /tmp/CTLFireability6180553261929048029.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11248222022620831116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6180553261929048029.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.58123e+07,0.269016,13072,520,45,15291,272,250,50960,48,1910,0


Converting to forward existential form...Done !
original formula: E(((AF((((i4.u14.p95==1)&&(i5.i0.u15.p100==1))&&(i5.i0.u17.p109==1))) * !((((i1.u7.p51==1)&&(i4.u14.p95==1))&&(i5.i1.u19.p120==1)))) + (A...369
=> equivalent forward existential formula: ([(FwdU(Init,((!(EG(!((((i4.u14.p95==1)&&(i5.i0.u15.p100==1))&&(i5.i0.u17.p109==1))))) * !((((i1.u7.p51==1)&&(i4...1036
Reverse transition relation is NOT exact ! Due to transitions t46, t47, t55, t60, t61, t65, t66, t68, t69, t72, t73, u12.t12, u12.t13, i0.t52, i0.t50, i0.i...540
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,26.5065,596996,1,0,928371,452,1469,2.14172e+06,232,2516,683001
FORMULA ShieldRVs-PT-003B-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

[2024-05-30 01:56:37] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:56:37] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:56:37] [INFO ] Applying decomposition
[2024-05-30 01:56:37] [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/graph9300489938629948197.txt' '-o' '/tmp/graph9300489938629948197.bin' '-w' '/tmp/graph9300489938629948197.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9300489938629948197.bin' '-l' '-1' '-v' '-w' '/tmp/graph9300489938629948197.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:56:37] [INFO ] Decomposing Gal with order
[2024-05-30 01:56:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:56:37] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-30 01:56:37] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:56:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 01:56:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16147500903181106899.gal : 2 ms
[2024-05-30 01:56:37] [INFO ] Time to serialize properties into /tmp/CTLFireability1681171315814556890.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16147500903181106899.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1681171315814556890.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 3 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.87055e+09,0.45066,19436,1320,80,27801,303,334,58489,52,1480,0


Converting to forward existential form...Done !
original formula: E((EF((i1.i1.u8.p29!=1)) * (AG((!(E((i2.u5.p11==1) U (i3.u13.p39==1))) * !(EG((i7.i0.u27.p86==1))))) + (E((i0.u0.p0==1) U !(AG((i5.i0.u19...508
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U (i1.i1.u8.p29!=1)) * (!(E(TRUE U !((!(E((i2.u5.p11==1) U (i3.u13.p39==1))) * !(EG((i7.i0.u...614
Reverse transition relation is NOT exact ! Due to transitions i1.i0.u7.t89, i1.i0.u7.t90, i1.i1.t85, i1.i1.u8.t4, i1.i1.u8.t5, i1.i1.u8.t6, i1.i1.u8.t7, i1...894
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,64.2986,1368704,1,0,2.07949e+06,825,2147,4.19112e+06,276,3318,1716712
FORMULA ShieldRVs-PT-003B-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG((EX(((((i7.i1.u29.p94==0)||(i7.i0.u31.p100==0))||(i8.u33.p109==0))&&(((i4.u20.p67==0)||(i6.u24.p78==0))||(i8.u34.p104==0)))) * ((EG(((...362
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(((((i7.i1.u29.p94==0)||(i7.i0.u31.p100==0))||(i8.u33.p109==0))&&(((i4.u20.p67==0)||(i6...676
(forward)formula 1,0,123.7,2199100,1,0,3.2269e+06,841,1387,6.49575e+06,160,3414,496767
FORMULA ShieldRVs-PT-003B-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

original formula: AG(((!(E((i5.i1.u16.p58==1) U !(E((i1.i1.u10.p33==1) U ((i5.i0.u19.p62==1)&&(i6.u24.p75==1)))))) + (i3.u13.p37==0)) + !(A((AF((i2.u4.p15=...209
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !(!(!((E(!(E(TRUE U (i2.u4.p16==1))) U (!((!(EG(!((i2.u4.p15==1)))) + EX((i1.i1.u8.p2...353
(forward)formula 2,0,180.381,2199100,1,0,3.2269e+06,862,1585,6.49575e+06,169,3414,2000539
FORMULA ShieldRVs-PT-003B-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

***************************************

Total runtime 1194735 ms.

BK_STOP 1717034378058

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -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="ShieldRVs-PT-003B"
export BK_EXAMINATION="CTLFireability"
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 ShieldRVs-PT-003B, examination is CTLFireability"
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-171683761800746"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-003B.tgz
mv ShieldRVs-PT-003B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;