Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399600489.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399600489
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 16:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 16:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 85K May 18 16:42 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 BusinessProcesses-PT-06-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716333835692

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:23:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:23:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:23:57] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-21 23:23:57] [INFO ] Transformed 376 places.
[2024-05-21 23:23:57] [INFO ] Transformed 297 transitions.
[2024-05-21 23:23:57] [INFO ] Found NUPN structural information;
[2024-05-21 23:23:57] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 118 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 348 transition count 269
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 348 transition count 269
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 338 transition count 259
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 338 transition count 259
Applied a total of 74 rules in 83 ms. Remains 338 /375 variables (removed 37) and now considering 259/296 (removed 37) transitions.
// Phase 1: matrix 259 rows 338 cols
[2024-05-21 23:23:57] [INFO ] Computed 81 invariants in 23 ms
[2024-05-21 23:23:57] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-21 23:23:57] [INFO ] Invariant cache hit.
[2024-05-21 23:23:58] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-21 23:23:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 3/338 variables, 42/73 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 10 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:24:03] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 65 places in 82 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:24:04] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 5 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:05] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 47 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:24:06] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:24:07] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 55 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:24:10] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 8 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:24:11] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 52 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:24:12] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:24:13] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:24:14] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:24:15] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:24:15] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:24:15] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:17] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:24:17] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:24:17] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:24:17] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:24:17] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:24:17] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:24:17] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:24:17] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:24:18] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:24:18] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:24:18] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 3 ms to minimize.
[2024-05-21 23:24:18] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:24:18] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:18] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:24:18] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:24:18] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:24:19] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:24:19] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:24:19] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:24:19] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:19] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:24:19] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:24:20] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:24:20] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:24:20] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:24:20] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:24:20] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:24:20] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:24:20] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:24:20] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:24:20] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:24:20] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 56 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:22] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:24:22] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:24:22] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:24:23] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:24:24] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:24:24] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:24:24] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:24:24] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:24:24] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:24:24] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:24:24] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:24:24] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:24:24] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 20/261 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:24:27] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:24:28] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 338/597 variables, and 270 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/338 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 189/189 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/335 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 3/338 variables, 42/73 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 189/270 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:24:30] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 4 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:24:31] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:24:32] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:24:33] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:24:35] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 20/310 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 4 ms to minimize.
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:24:36] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:24:37] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:24:37] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:24:37] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:24:37] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:24:37] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:24:37] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:24:37] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 80 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:24:38] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 20/330 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 3 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:24:40] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:24:41] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:24:41] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:24:41] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:24:43] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:24:44] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 20/370 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:24:46] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:24:49] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 20/390 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:24:50] [INFO ] Deduced a trap composed of 67 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:24:51] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 20/410 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:24:54] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:24:55] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:24:56] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:24:57] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:24:57] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:24:57] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:24:57] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 4 ms to minimize.
[2024-05-21 23:24:57] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:24:57] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:24:57] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 20/430 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 338/597 variables, and 430 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/338 constraints, PredecessorRefiner: 0/258 constraints, Known Traps: 349/349 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60168ms
Starting structural reductions in LTL mode, iteration 1 : 338/375 places, 259/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60993 ms. Remains : 338/375 places, 259/296 transitions.
Support contains 118 out of 338 places after structural reductions.
[2024-05-21 23:24:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 23:24:58] [INFO ] Flatten gal took : 58 ms
FORMULA BusinessProcesses-PT-06-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:24:58] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:24:58] [INFO ] Input system was already deterministic with 259 transitions.
Support contains 111 out of 338 places (down from 118) after GAL structural reductions.
RANDOM walk for 40000 steps (404 resets) in 2042 ms. (19 steps per ms) remains 11/73 properties
BEST_FIRST walk for 40004 steps (81 resets) in 228 ms. (174 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (73 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (71 resets) in 120 ms. (330 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (80 resets) in 175 ms. (227 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (84 resets) in 130 ms. (305 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (72 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (76 resets) in 38 ms. (1025 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (75 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (69 resets) in 111 ms. (357 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (71 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (65 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
[2024-05-21 23:24:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 196/220 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 37/257 variables, 11/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 81/338 variables, 39/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 259/597 variables, 338/419 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/597 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 419 constraints, problems are : Problem set: 0 solved, 10 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 196/220 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 23:25:00] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:25:00] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:25:00] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:25:00] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:25:00] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:25:00] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:25:00] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:25:00] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 37/257 variables, 11/50 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:01] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 8 (OVERLAPS) 81/338 variables, 39/111 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/111 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 259/597 variables, 338/449 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/597 variables, 7/456 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:25:02] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:25:03] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/597 variables, 15/471 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-21 23:25:04] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:25:04] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/597 variables, 2/473 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-21 23:25:04] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/597 variables, 1/474 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/597 variables, 0/474 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/597 variables, 0/474 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 474 constraints, problems are : Problem set: 3 solved, 7 unsolved in 4430 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 7/10 constraints, Known Traps: 48/48 constraints]
After SMT, in 4894ms problems are : Problem set: 3 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 2289 ms.
Support contains 9 out of 338 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 338/338 places, 259/259 transitions.
Graph (trivial) has 153 edges and 338 vertex of which 6 / 338 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 642 edges and 333 vertex of which 330 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 330 transition count 210
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 83 place count 290 transition count 210
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 83 place count 290 transition count 148
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 215 place count 220 transition count 148
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 234 place count 201 transition count 129
Iterating global reduction 2 with 19 rules applied. Total rules applied 253 place count 201 transition count 129
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 411 place count 118 transition count 54
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 412 place count 118 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 413 place count 117 transition count 53
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 414 place count 117 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 415 place count 116 transition count 52
Applied a total of 415 rules in 79 ms. Remains 116 /338 variables (removed 222) and now considering 52/259 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 116/338 places, 52/259 transitions.
RANDOM walk for 200 steps (0 resets) in 14 ms. (13 steps per ms) remains 0/6 properties
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2024-05-21 23:25:07] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:25:07] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:25:07] [INFO ] Input system was already deterministic with 259 transitions.
Computed a total of 330 stabilizing places and 250 stable transitions
Graph (complete) has 649 edges and 338 vertex of which 335 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 336 transition count 259
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 315 transition count 238
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 315 transition count 238
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 309 transition count 232
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 309 transition count 232
Applied a total of 56 rules in 29 ms. Remains 309 /338 variables (removed 29) and now considering 232/259 (removed 27) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-05-21 23:25:07] [INFO ] Computed 79 invariants in 12 ms
[2024-05-21 23:25:07] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 23:25:07] [INFO ] Invariant cache hit.
[2024-05-21 23:25:07] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-21 23:25:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:25:11] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:25:11] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:25:11] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:25:11] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:25:11] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:25:11] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:25:11] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:25:11] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:25:11] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:25:11] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:25:11] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:25:11] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:25:11] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:25:12] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:25:12] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:25:12] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:25:12] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:25:12] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:25:12] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:25:12] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:25:13] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 3 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:25:14] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:25:15] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:25:16] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:25:17] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:25:19] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:25:20] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:25:21] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:25:22] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:25:23] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:25:24] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 27770 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:25:42] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:25:43] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:25:44] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:25:51] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:25:57] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:25:59] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:25:59] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:25:59] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:26:00] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:26:00] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 725 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 106/106 constraints]
After SMT, in 57829ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 57832ms
Starting structural reductions in LTL mode, iteration 1 : 309/338 places, 232/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58299 ms. Remains : 309/338 places, 232/259 transitions.
[2024-05-21 23:26:05] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:26:05] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:26:05] [INFO ] Input system was already deterministic with 232 transitions.
[2024-05-21 23:26:05] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:26:05] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:26:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality5266310643897508473.gal : 6 ms
[2024-05-21 23:26:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality3579229901607168742.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/CTLCardinality5266310643897508473.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3579229901607168742.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.
Detected timeout of ITS tools.
[2024-05-21 23:26:35] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:26:35] [INFO ] Applying decomposition
[2024-05-21 23:26:35] [INFO ] Flatten gal took : 20 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/graph12435487301956496086.txt' '-o' '/tmp/graph12435487301956496086.bin' '-w' '/tmp/graph12435487301956496086.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12435487301956496086.bin' '-l' '-1' '-v' '-w' '/tmp/graph12435487301956496086.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:26:35] [INFO ] Decomposing Gal with order
[2024-05-21 23:26:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:26:36] [INFO ] Removed a total of 34 redundant transitions.
[2024-05-21 23:26:36] [INFO ] Flatten gal took : 45 ms
[2024-05-21 23:26:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-21 23:26:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality13702535165532462770.gal : 6 ms
[2024-05-21 23:26:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality3706471554488637020.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/CTLCardinality13702535165532462770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3706471554488637020.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.64213e+18,0.43353,23412,4386,30,47305,336,622,73943,43,781,0


Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t153, t161, t173, i0.u59.t101, i0.u57.t104, i0.u90.t33, i0.u102.t38, i1.t105, i1.u53.t112...709
(forward)formula 0,0,2.85525,131376,1,0,349703,336,3102,346593,161,781,830176
FORMULA BusinessProcesses-PT-06-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 336 transition count 259
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 317 transition count 240
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 317 transition count 240
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 311 transition count 234
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 311 transition count 234
Applied a total of 52 rules in 28 ms. Remains 311 /338 variables (removed 27) and now considering 234/259 (removed 25) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-05-21 23:26:38] [INFO ] Computed 79 invariants in 5 ms
[2024-05-21 23:26:39] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 23:26:39] [INFO ] Invariant cache hit.
[2024-05-21 23:26:39] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-05-21 23:26:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:26:42] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:26:43] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 4 ms to minimize.
[2024-05-21 23:26:43] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:26:43] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:26:43] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:26:43] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:26:43] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:26:43] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:26:43] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:43] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:26:43] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:26:43] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:26:44] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:26:44] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:26:44] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:26:44] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:26:44] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:26:44] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:26:44] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:26:45] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:26:46] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 14/113 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:26:47] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:26:47] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:26:47] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:26:47] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:26:47] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:26:47] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:26:47] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:26:48] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:26:48] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 9/122 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 234/545 variables, 311/433 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:26:51] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 3 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:26:52] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:26:53] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:26:54] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 20/453 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:26:56] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:26:56] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:26:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:26:56] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:26:57] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:26:57] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 6/459 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:26:59] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:26:59] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 3/464 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 14 (OVERLAPS) 0/545 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 464 constraints, problems are : Problem set: 0 solved, 233 unsolved in 28962 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 74/153 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 2/169 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (OVERLAPS) 234/545 variables, 311/480 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 233/713 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 4/717 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:27] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:27:38] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 719 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 96/96 constraints]
After SMT, in 59015ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 59018ms
Starting structural reductions in LTL mode, iteration 1 : 311/338 places, 234/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59436 ms. Remains : 311/338 places, 234/259 transitions.
[2024-05-21 23:27:38] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:27:38] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:27:38] [INFO ] Input system was already deterministic with 234 transitions.
[2024-05-21 23:27:38] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:27:38] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:27:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality7758253559236604642.gal : 3 ms
[2024-05-21 23:27:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality18002438654289422153.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/CTLCardinality7758253559236604642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18002438654289422153.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.
Detected timeout of ITS tools.
[2024-05-21 23:28:08] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:28:08] [INFO ] Applying decomposition
[2024-05-21 23:28:08] [INFO ] Flatten gal took : 15 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/graph7190590941912507643.txt' '-o' '/tmp/graph7190590941912507643.bin' '-w' '/tmp/graph7190590941912507643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7190590941912507643.bin' '-l' '-1' '-v' '-w' '/tmp/graph7190590941912507643.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:28:08] [INFO ] Decomposing Gal with order
[2024-05-21 23:28:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:28:08] [INFO ] Removed a total of 34 redundant transitions.
[2024-05-21 23:28:08] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:28:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:28:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality7802935345847118123.gal : 6 ms
[2024-05-21 23:28:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality6430617315956469627.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/CTLCardinality7802935345847118123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6430617315956469627.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,1.64213e+18,5.77065,124140,27596,31,313555,405,658,276098,44,963,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 336 transition count 259
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 317 transition count 240
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 317 transition count 240
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 311 transition count 234
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 311 transition count 234
Applied a total of 52 rules in 22 ms. Remains 311 /338 variables (removed 27) and now considering 234/259 (removed 25) transitions.
// Phase 1: matrix 234 rows 311 cols
[2024-05-21 23:28:38] [INFO ] Computed 79 invariants in 6 ms
[2024-05-21 23:28:38] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-21 23:28:38] [INFO ] Invariant cache hit.
[2024-05-21 23:28:39] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2024-05-21 23:28:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:28:42] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:28:42] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:28:42] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:28:42] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:28:43] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:28:44] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:44] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:28:44] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:28:44] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:28:44] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:28:44] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:28:45] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:28:46] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:28:46] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:28:46] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:28:46] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:28:46] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:28:46] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:28:47] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:28:48] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:28:48] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:28:48] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 8/127 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:28:50] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:28:51] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:28:52] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:28:52] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:28:52] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:28:52] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (OVERLAPS) 234/545 variables, 311/444 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:28:55] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:28:56] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:28:56] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:28:56] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:28:56] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:28:57] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 11/455 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:28:58] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:28:59] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:28:59] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:28:59] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 4/459 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:29:03] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/545 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 15 (OVERLAPS) 0/545 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 460 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 1/311 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/311 variables, 70/149 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:29:10] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:29:11] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:29:12] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 13/162 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:29:13] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:29:14] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:29:16] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (OVERLAPS) 234/545 variables, 311/479 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 233/712 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:29:20] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:29:21] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:29:21] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:29:22] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:29:23] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:29:23] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:29:24] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 8/720 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-21 23:29:32] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 721 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 98/98 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 311/338 places, 234/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60555 ms. Remains : 311/338 places, 234/259 transitions.
[2024-05-21 23:29:39] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:29:39] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:29:39] [INFO ] Input system was already deterministic with 234 transitions.
[2024-05-21 23:29:39] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:29:39] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:29:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality1065759400004727092.gal : 3 ms
[2024-05-21 23:29:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality2547836551827038761.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/CTLCardinality1065759400004727092.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2547836551827038761.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.
Detected timeout of ITS tools.
[2024-05-21 23:30:09] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:30:09] [INFO ] Applying decomposition
[2024-05-21 23:30:09] [INFO ] Flatten gal took : 11 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/graph13817108427482142549.txt' '-o' '/tmp/graph13817108427482142549.bin' '-w' '/tmp/graph13817108427482142549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13817108427482142549.bin' '-l' '-1' '-v' '-w' '/tmp/graph13817108427482142549.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:30:09] [INFO ] Decomposing Gal with order
[2024-05-21 23:30:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:30:09] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-21 23:30:09] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:30:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:30:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality11266062395354461058.gal : 4 ms
[2024-05-21 23:30:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality9460307793164394090.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/CTLCardinality11266062395354461058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9460307793164394090.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.66173e+18,0.74534,26220,4665,30,60420,428,661,56860,41,1192,0


Converting to forward existential form...Done !
original formula: E(!((((AF((i19.i1.u109.p350==1)) * AF((i18.u90.p285==0))) + ((EX((i10.i1.u50.p125==1)) * (i10.i1.u38.p128==1)) * (i19.i1.u109.p358==1))) ...238
=> equivalent forward existential formula: [(FwdU(Init,!((((!(EG(!((i19.i1.u109.p350==1)))) * !(EG(!((i18.u90.p285==0))))) + ((EX((i10.i1.u50.p125==1)) * (...308
Reverse transition relation is NOT exact ! Due to transitions t2, t107, t155, t159, t175, i0.i0.u55.t110, i0.i0.u59.t103, i0.i1.u86.t49, i0.i1.u87.t46, i0....755
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 336 transition count 259
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 23 place count 315 transition count 238
Iterating global reduction 1 with 21 rules applied. Total rules applied 44 place count 315 transition count 238
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 309 transition count 232
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 309 transition count 232
Applied a total of 56 rules in 29 ms. Remains 309 /338 variables (removed 29) and now considering 232/259 (removed 27) transitions.
// Phase 1: matrix 232 rows 309 cols
[2024-05-21 23:30:39] [INFO ] Computed 79 invariants in 2 ms
[2024-05-21 23:30:39] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 23:30:39] [INFO ] Invariant cache hit.
[2024-05-21 23:30:40] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-21 23:30:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:43] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:30:43] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:30:43] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:30:43] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:30:43] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:30:43] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:30:44] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:30:45] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:30:45] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:30:45] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:45] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:45] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:30:45] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:46] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:30:47] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 19/118 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:48] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:30:49] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:30:50] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:30:51] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:30:52] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:30:52] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:30:52] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
[2024-05-21 23:30:52] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:30:52] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:30:52] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:30:52] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:30:52] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:30:52] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:30:52] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:30:52] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:30:52] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:30:53] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:30:54] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:30:55] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:30:56] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:30:57] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 17 ms to minimize.
[2024-05-21 23:30:57] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 8/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 11 (OVERLAPS) 232/541 variables, 309/471 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:31:01] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 474 constraints, problems are : Problem set: 0 solved, 231 unsolved in 28126 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 86/86 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 1/309 variables, 40/72 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 86/165 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 7/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 232/541 variables, 309/481 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/541 variables, 231/712 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 5/717 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 2/719 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:32] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 6/725 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 541/541 variables, and 725 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 309/309 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 106/106 constraints]
After SMT, in 58177ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 58181ms
Starting structural reductions in LTL mode, iteration 1 : 309/338 places, 232/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58701 ms. Remains : 309/338 places, 232/259 transitions.
[2024-05-21 23:31:38] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:31:38] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:31:38] [INFO ] Input system was already deterministic with 232 transitions.
[2024-05-21 23:31:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:31:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:31:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality11610906798968686560.gal : 2 ms
[2024-05-21 23:31:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality12307122198563783428.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/CTLCardinality11610906798968686560.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12307122198563783428.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.
Detected timeout of ITS tools.
[2024-05-21 23:32:08] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:32:08] [INFO ] Applying decomposition
[2024-05-21 23:32:08] [INFO ] Flatten gal took : 14 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/graph14452563932571069892.txt' '-o' '/tmp/graph14452563932571069892.bin' '-w' '/tmp/graph14452563932571069892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14452563932571069892.bin' '-l' '-1' '-v' '-w' '/tmp/graph14452563932571069892.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:32:08] [INFO ] Decomposing Gal with order
[2024-05-21 23:32:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:32:08] [INFO ] Removed a total of 34 redundant transitions.
[2024-05-21 23:32:08] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:32:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-21 23:32:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality13082351020716097848.gal : 5 ms
[2024-05-21 23:32:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality9649084217488343091.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/CTLCardinality13082351020716097848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9649084217488343091.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.64213e+18,0.534674,22708,4301,28,50847,360,609,51266,42,797,0


Converting to forward existential form...Done !
original formula: AG((((EG((i0.u60.p150==1)) + (i13.u82.p238==0)) + ((i5.u12.p32==1) + ((AG(((i9.i0.u45.p111==0)||(i9.i0.u109.p360==1))) * AF((i13.u80.p228...333
=> equivalent forward existential formula: (([(FwdU((((FwdU(Init,TRUE) * !((((i7.i0.u29.p70==0)&&(i1.u55.p136==1))&&((i3.u16.p42==0)||(i4.u91.p286==0))))) ...789
Reverse transition relation is NOT exact ! Due to transitions t2, t105, t113, t149, t157, t165, t169, i0.u60.t101, i0.u86.t48, i0.u87.t45, i0.u88.t42, i1.u...698
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,7.85398,236548,1,0,593689,374,4584,657723,223,1017,1222502
FORMULA BusinessProcesses-PT-06-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 337 transition count 259
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 320 transition count 242
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 320 transition count 242
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 315 transition count 237
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 315 transition count 237
Applied a total of 45 rules in 12 ms. Remains 315 /338 variables (removed 23) and now considering 237/259 (removed 22) transitions.
// Phase 1: matrix 237 rows 315 cols
[2024-05-21 23:32:16] [INFO ] Computed 80 invariants in 6 ms
[2024-05-21 23:32:16] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-21 23:32:16] [INFO ] Invariant cache hit.
[2024-05-21 23:32:16] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-21 23:32:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 2/315 variables, 41/72 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:32:20] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:32:20] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:32:20] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:32:20] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 3 ms to minimize.
[2024-05-21 23:32:20] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:32:21] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 3 ms to minimize.
[2024-05-21 23:32:22] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:32:23] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:32:24] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:32:25] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:32:26] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:32:27] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 4 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:32:28] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:32:29] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 20/140 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:32:31] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 42 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:32:32] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 3 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:32:33] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 6 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:32:34] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 3 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:32:35] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:32:36] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 2 ms to minimize.
[2024-05-21 23:32:37] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:32:38] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:32:39] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 14/186 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:32:41] [INFO ] Deduced a trap composed of 43 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 5/191 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:32:43] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 13 (OVERLAPS) 237/552 variables, 315/509 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 509 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 114/114 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 2/315 variables, 41/72 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 114/194 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:32:48] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:32:49] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 6/200 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:32:50] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 43 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:32:51] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:32:52] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:32:53] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:32:55] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 7/214 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:32:57] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:32:58] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:32:59] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:33:00] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:33:01] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:33:02] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:33:03] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 14 (OVERLAPS) 237/552 variables, 315/544 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 236/780 constraints. Problems are: Problem set: 0 solved, 236 unsolved
[2024-05-21 23:33:08] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:33:09] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:10] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:33:11] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:33:12] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:33:13] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 20/800 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 800 constraints, problems are : Problem set: 0 solved, 236 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 169/169 constraints]
After SMT, in 60059ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 315/338 places, 237/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60508 ms. Remains : 315/338 places, 237/259 transitions.
[2024-05-21 23:33:17] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:33:17] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:33:17] [INFO ] Input system was already deterministic with 237 transitions.
[2024-05-21 23:33:17] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:33:17] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:33:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality1974026513959104609.gal : 3 ms
[2024-05-21 23:33:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality3758139588751961084.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1974026513959104609.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3758139588751961084.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.
Detected timeout of ITS tools.
[2024-05-21 23:33:47] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:33:47] [INFO ] Applying decomposition
[2024-05-21 23:33:47] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8504554072889054339.txt' '-o' '/tmp/graph8504554072889054339.bin' '-w' '/tmp/graph8504554072889054339.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8504554072889054339.bin' '-l' '-1' '-v' '-w' '/tmp/graph8504554072889054339.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:33:47] [INFO ] Decomposing Gal with order
[2024-05-21 23:33:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:33:47] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-21 23:33:47] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:33:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:33:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality11190825277169786861.gal : 4 ms
[2024-05-21 23:33:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality6582633933599675997.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/CTLCardinality11190825277169786861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6582633933599675997.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.69078e+18,1.39109,48316,9212,28,93569,371,637,245395,42,765,0


Converting to forward existential form...Done !
original formula: E(!((EX((i11.u49.p124!=1)) * !((((i0.u20.p58!=1) * EX((i16.u82.p241==1))) * EX(TRUE))))) U (AF((((i10.u58.p149==0)||(i11.u84.p250==1)) * ...422
=> equivalent forward existential formula: ([FwdG(FwdU((FwdU(Init,!((EX((i11.u49.p124!=1)) * !((((i0.u20.p58!=1) * EX((i16.u82.p241==1))) * EX(TRUE)))))) *...1065
Reverse transition relation is NOT exact ! Due to transitions t2, t110, t118, t158, t170, t174, t178, i0.t154, i0.u18.t161, i0.u20.t157, i0.u52.t117, i1.t1...733
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Graph (trivial) has 157 edges and 338 vertex of which 6 / 338 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 643 edges and 333 vertex of which 331 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 330 transition count 211
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 289 transition count 211
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 84 place count 289 transition count 146
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 224 place count 214 transition count 146
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 245 place count 193 transition count 125
Iterating global reduction 2 with 21 rules applied. Total rules applied 266 place count 193 transition count 125
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 420 place count 112 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 422 place count 111 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 423 place count 110 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 424 place count 109 transition count 50
Applied a total of 424 rules in 56 ms. Remains 109 /338 variables (removed 229) and now considering 50/259 (removed 209) transitions.
// Phase 1: matrix 50 rows 109 cols
[2024-05-21 23:34:17] [INFO ] Computed 60 invariants in 1 ms
[2024-05-21 23:34:17] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 23:34:17] [INFO ] Invariant cache hit.
[2024-05-21 23:34:17] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [10, 12, 14, 16, 18, 20, 23, 25, 27, 36, 37, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 202 ms to find 31 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 78/338 places, 50/259 transitions.
Graph (complete) has 165 edges and 78 vertex of which 70 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 70 transition count 41
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 62 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 61 transition count 40
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 39 place count 48 transition count 33
Applied a total of 39 rules in 4 ms. Remains 48 /78 variables (removed 30) and now considering 33/50 (removed 17) transitions.
// Phase 1: matrix 33 rows 48 cols
[2024-05-21 23:34:17] [INFO ] Computed 16 invariants in 0 ms
[2024-05-21 23:34:17] [INFO ] Implicit Places using invariants in 37 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 47/338 places, 33/259 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 32
Applied a total of 2 rules in 2 ms. Remains 46 /47 variables (removed 1) and now considering 32/33 (removed 1) transitions.
// Phase 1: matrix 32 rows 46 cols
[2024-05-21 23:34:17] [INFO ] Computed 15 invariants in 0 ms
[2024-05-21 23:34:17] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-21 23:34:17] [INFO ] Invariant cache hit.
[2024-05-21 23:34:17] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-21 23:34:17] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 46/338 places, 32/259 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 390 ms. Remains : 46/338 places, 32/259 transitions.
[2024-05-21 23:34:17] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:17] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:34:17] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-21 23:34:17] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:17] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:34:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality13377735959898483347.gal : 1 ms
[2024-05-21 23:34:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality10134084703464978007.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/CTLCardinality13377735959898483347.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10134084703464978007.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,87564,0.061321,5796,2,1523,5,17476,6,0,200,7869,0


Converting to forward existential form...Done !
original formula: AF((((p149!=0) + EG(((p212!=0)&&(p357!=1)))) + EF(((p90!=0)&&(p57!=1)))))
=> equivalent forward existential formula: [FwdG(Init,!((((p149!=0) + EG(((p212!=0)&&(p357!=1)))) + E(TRUE U ((p90!=0)&&(p57!=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t14, t16, t28, t31, Intersection with reachable at each step enabled. (destroyed/rev...187
(forward)formula 0,1,0.3498,14772,1,0,105,58944,96,62,1246,44312,128
FORMULA BusinessProcesses-PT-06-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Graph (trivial) has 155 edges and 338 vertex of which 6 / 338 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 643 edges and 333 vertex of which 330 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 329 transition count 212
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 82 place count 290 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 288 transition count 210
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 84 place count 288 transition count 147
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 218 place count 217 transition count 147
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 239 place count 196 transition count 126
Iterating global reduction 3 with 21 rules applied. Total rules applied 260 place count 196 transition count 126
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 390 place count 131 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 392 place count 130 transition count 60
Applied a total of 392 rules in 53 ms. Remains 130 /338 variables (removed 208) and now considering 60/259 (removed 199) transitions.
// Phase 1: matrix 60 rows 130 cols
[2024-05-21 23:34:18] [INFO ] Computed 71 invariants in 1 ms
[2024-05-21 23:34:18] [INFO ] Implicit Places using invariants in 100 ms returned [55, 57, 104, 114, 116, 118, 120, 122, 124, 126, 128]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 101 ms to find 11 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 119/338 places, 60/259 transitions.
Applied a total of 0 rules in 5 ms. Remains 119 /119 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 160 ms. Remains : 119/338 places, 60/259 transitions.
[2024-05-21 23:34:18] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:34:18] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:18] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-21 23:34:18] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:34:18] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality17810987654739624162.gal : 1 ms
[2024-05-21 23:34:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality13795913119530313790.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/CTLCardinality17810987654739624162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13795913119530313790.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,225589,2.58814,68988,2,68775,5,304643,6,0,536,249517,0


Converting to forward existential form...Done !
original formula: AG(E(EF((p337==1)) U E((((p100==0)&&((p67==0)||(p70==1)))&&(((p151==0)||(p265==1))||((p30==1)||(p74==1)))) U ((p29==0)||(p10==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E(TRUE U (p337==1)) U E((((p100==0)&&((p67==0)||(p70==1)))&&(((p151==0)||(p265==1))||((p...210
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t8, t19, t22, t31, t33, t59, Intersection with reachable at each step enabled. (dest...196
Detected timeout of ITS tools.
[2024-05-21 23:34:48] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:34:48] [INFO ] Applying decomposition
[2024-05-21 23:34:48] [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/graph5596825296256037428.txt' '-o' '/tmp/graph5596825296256037428.bin' '-w' '/tmp/graph5596825296256037428.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5596825296256037428.bin' '-l' '-1' '-v' '-w' '/tmp/graph5596825296256037428.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:34:48] [INFO ] Decomposing Gal with order
[2024-05-21 23:34:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:34:48] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-21 23:34:48] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:34:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:34:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality12680806287473585158.gal : 3 ms
[2024-05-21 23:34:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality402591985152183385.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/CTLCardinality12680806287473585158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality402591985152183385.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,225589,0.088314,9164,1567,32,15111,179,397,12210,38,300,0


Converting to forward existential form...Done !
original formula: AG(E(EF((i6.i1.u43.p337==1)) U E((((i3.u37.p100==0)&&((i1.u5.p67==0)||(i5.i1.u7.p70==1)))&&(((i3.u18.p151==0)||(i3.u38.p265==1))||((i0.i0...226
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E(TRUE U (i6.i1.u43.p337==1)) U E((((i3.u37.p100==0)&&((i1.u5.p67==0)||(i5.i1.u7.p70==1)...286
Reverse transition relation is NOT exact ! Due to transitions t22, t31, t33, i0.i0.u2.t19, i3.u38.t4, i6.i0.t59, i6.i0.u44.t1, i9.u0.t8, Intersection with...234
(forward)formula 0,0,0.38252,23948,1,0,53311,262,1783,47598,163,704,131338
FORMULA BusinessProcesses-PT-06-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Graph (trivial) has 148 edges and 338 vertex of which 4 / 338 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 646 edges and 335 vertex of which 332 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 332 transition count 217
Reduce places removed 38 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 294 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 84 place count 291 transition count 214
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 84 place count 291 transition count 152
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 218 place count 219 transition count 152
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 235 place count 202 transition count 135
Iterating global reduction 3 with 17 rules applied. Total rules applied 252 place count 202 transition count 135
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 147 rules applied. Total rules applied 399 place count 127 transition count 63
Applied a total of 399 rules in 54 ms. Remains 127 /338 variables (removed 211) and now considering 63/259 (removed 196) transitions.
// Phase 1: matrix 63 rows 127 cols
[2024-05-21 23:34:48] [INFO ] Computed 66 invariants in 4 ms
[2024-05-21 23:34:48] [INFO ] Implicit Places using invariants in 131 ms returned [27, 29, 32, 34, 36, 44]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 132 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 121/338 places, 63/259 transitions.
Applied a total of 0 rules in 5 ms. Remains 121 /121 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 191 ms. Remains : 121/338 places, 63/259 transitions.
[2024-05-21 23:34:48] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:34:48] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:48] [INFO ] Input system was already deterministic with 63 transitions.
[2024-05-21 23:34:48] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:48] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:34:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality10874969010636685432.gal : 1 ms
[2024-05-21 23:34:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality5995378371391313020.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/CTLCardinality10874969010636685432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5995378371391313020.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.55528e+06,4.44055,101780,2,94447,5,457676,6,0,547,403546,0


Converting to forward existential form...Done !
original formula: E((E(((AF((((p111==0)||(p170==1))&&((p91==0)||(p275==1)))) * (p360==0)) * !((((p181==1)||(p139==0))||(p267==1)))) U AG((p349==1))) * (p21...221
=> equivalent forward existential formula: [((FwdU(Init,(E(((!(EG(!((((p111==0)||(p170==1))&&((p91==0)||(p275==1)))))) * (p360==0)) * !((((p181==1)||(p139=...303
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t4, t10, t11, t23, t24, t25, t35, t38, t59, Intersection with reachable at each step...212
Detected timeout of ITS tools.
[2024-05-21 23:35:19] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:35:19] [INFO ] Applying decomposition
[2024-05-21 23:35:19] [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/graph7787375881565663259.txt' '-o' '/tmp/graph7787375881565663259.bin' '-w' '/tmp/graph7787375881565663259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7787375881565663259.bin' '-l' '-1' '-v' '-w' '/tmp/graph7787375881565663259.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:35:19] [INFO ] Decomposing Gal with order
[2024-05-21 23:35:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:35:19] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-21 23:35:19] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:35:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:35:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality5192461731120889280.gal : 1 ms
[2024-05-21 23:35:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality9304360258073483859.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/CTLCardinality5192461731120889280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9304360258073483859.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.55528e+06,0.068876,7780,677,49,11372,274,373,9617,55,641,0


Converting to forward existential form...Done !
original formula: E((E(((AF((((i1.u12.p111==0)||(i6.u15.p170==1))&&((i3.u10.p91==0)||(i11.u34.p275==1)))) * (i7.i1.u42.p360==0)) * !((((i7.i0.u16.p181==1)|...326
=> equivalent forward existential formula: [((FwdU(Init,(E(((!(EG(!((((i1.u12.p111==0)||(i6.u15.p170==1))&&((i3.u10.p91==0)||(i11.u34.p275==1)))))) * (i7.i...408
Reverse transition relation is NOT exact ! Due to transitions t25, t35, t59, i5.u13.t23, i6.t38, i6.u15.t24, i7.i0.u16.t11, i10.u22.t10, i11.u40.t0, i11.u4...271
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,0.456533,25204,1,0,42382,385,1935,56269,347,1120,77983
FORMULA BusinessProcesses-PT-06-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 336 transition count 259
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 316 transition count 239
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 316 transition count 239
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 310 transition count 233
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 310 transition count 233
Applied a total of 54 rules in 14 ms. Remains 310 /338 variables (removed 28) and now considering 233/259 (removed 26) transitions.
// Phase 1: matrix 233 rows 310 cols
[2024-05-21 23:35:19] [INFO ] Computed 79 invariants in 2 ms
[2024-05-21 23:35:19] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 23:35:19] [INFO ] Invariant cache hit.
[2024-05-21 23:35:19] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2024-05-21 23:35:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 3 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:35:30] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:32] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:35:33] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:35:34] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 19/146 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:36] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:35:37] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:38] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:39] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 14 (OVERLAPS) 233/543 variables, 310/462 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:35:43] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:44] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/543 variables, 8/470 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:47] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/543 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:49] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 543/543 variables, and 472 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 83/83 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 83/162 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 233/543 variables, 310/472 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 232/704 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:35:56] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:35:57] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 5/709 constraints. Problems are: Problem set: 0 solved, 232 unsolved
[2024-05-21 23:36:03] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:36:04] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:36:04] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:36:04] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:36:04] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:36:04] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:36:05] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 7/716 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/543 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 716 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 310/310 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 95/95 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in LTL mode, iteration 1 : 310/338 places, 233/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60398 ms. Remains : 310/338 places, 233/259 transitions.
[2024-05-21 23:36:19] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:36:19] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:36:19] [INFO ] Input system was already deterministic with 233 transitions.
[2024-05-21 23:36:20] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:36:20] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:36:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality10817925101447402726.gal : 3 ms
[2024-05-21 23:36:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality11962504519496524650.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/CTLCardinality10817925101447402726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11962504519496524650.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.
Detected timeout of ITS tools.
[2024-05-21 23:36:50] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:36:50] [INFO ] Applying decomposition
[2024-05-21 23:36:50] [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/graph14482567591967874303.txt' '-o' '/tmp/graph14482567591967874303.bin' '-w' '/tmp/graph14482567591967874303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14482567591967874303.bin' '-l' '-1' '-v' '-w' '/tmp/graph14482567591967874303.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:36:50] [INFO ] Decomposing Gal with order
[2024-05-21 23:36:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:36:50] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-21 23:36:50] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:36:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:36:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality1585584791913495862.gal : 4 ms
[2024-05-21 23:36:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality18368043700357750446.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/CTLCardinality1585584791913495862.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18368043700357750446.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.64213e+18,1.09935,35460,5598,35,67491,676,669,131385,49,1466,0


Converting to forward existential form...Done !
original formula: EX(EF(EX(AX(((i3.u7.p17==0)&&(i15.i1.u79.p219==1))))))
=> equivalent forward existential formula: [(EY(FwdU(EY(Init),TRUE)) * !(EX(!(((i3.u7.p17==0)&&(i15.i1.u79.p219==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t154, t162, t170, i0.u87.t48, i0.u88.t45, i0.u89.t42, i1.t150, i1.u19.t157, i1.u21.t153, ...755
(forward)formula 0,1,8.73121,254844,1,0,547625,743,3938,908161,230,1977,1301598
FORMULA BusinessProcesses-PT-06-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Graph (trivial) has 154 edges and 338 vertex of which 6 / 338 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 643 edges and 333 vertex of which 330 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 329 transition count 212
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 290 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 289 transition count 211
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 82 place count 289 transition count 148
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 218 place count 216 transition count 148
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 236 place count 198 transition count 130
Iterating global reduction 3 with 18 rules applied. Total rules applied 254 place count 198 transition count 130
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 410 place count 116 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 412 place count 115 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 413 place count 114 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 414 place count 113 transition count 54
Applied a total of 414 rules in 66 ms. Remains 113 /338 variables (removed 225) and now considering 54/259 (removed 205) transitions.
// Phase 1: matrix 54 rows 113 cols
[2024-05-21 23:36:59] [INFO ] Computed 60 invariants in 1 ms
[2024-05-21 23:36:59] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-21 23:36:59] [INFO ] Invariant cache hit.
[2024-05-21 23:36:59] [INFO ] Implicit Places using invariants and state equation in 153 ms returned [0, 1, 2, 3, 4, 5, 6, 9, 11, 13, 15, 17, 19, 21, 23, 26, 28, 37, 38, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 302 ms to find 34 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 79/338 places, 54/259 transitions.
Graph (complete) has 164 edges and 79 vertex of which 71 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 71 transition count 47
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 65 transition count 47
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 33 place count 52 transition count 40
Applied a total of 33 rules in 6 ms. Remains 52 /79 variables (removed 27) and now considering 40/54 (removed 14) transitions.
// Phase 1: matrix 40 rows 52 cols
[2024-05-21 23:36:59] [INFO ] Computed 13 invariants in 0 ms
[2024-05-21 23:36:59] [INFO ] Implicit Places using invariants in 42 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 51/338 places, 40/259 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 39
Applied a total of 2 rules in 3 ms. Remains 50 /51 variables (removed 1) and now considering 39/40 (removed 1) transitions.
// Phase 1: matrix 39 rows 50 cols
[2024-05-21 23:36:59] [INFO ] Computed 12 invariants in 1 ms
[2024-05-21 23:36:59] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 23:36:59] [INFO ] Invariant cache hit.
[2024-05-21 23:36:59] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 50/338 places, 39/259 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 521 ms. Remains : 50/338 places, 39/259 transitions.
[2024-05-21 23:36:59] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:36:59] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:36:59] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-21 23:36:59] [INFO ] Flatten gal took : 1 ms
[2024-05-21 23:36:59] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:36:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality7051838088411349147.gal : 0 ms
[2024-05-21 23:36:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality14373026292559145375.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/CTLCardinality7051838088411349147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14373026292559145375.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,116709,0.325624,14296,2,11601,5,64673,6,0,237,39116,0


Converting to forward existential form...Done !
original formula: EF(!(A(((AF((p52==1)) * (p319!=1)) + !(E((p92==0) U (p288==1)))) U !(AG((p190==0))))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(!(!(E(TRUE U !((p190==0))))))) * !(((!(EG(!((p52==1)))) * (p319!=1)) + !(E((p92==0) U...277
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t8, t19, t36, t38, Intersection with reachable at each step enabled. (destroyed/...190
(forward)formula 0,1,4.54313,132628,1,0,195,717828,117,109,1462,673611,219
FORMULA BusinessProcesses-PT-06-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 336 transition count 259
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 317 transition count 240
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 317 transition count 240
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 312 transition count 235
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 312 transition count 235
Applied a total of 50 rules in 23 ms. Remains 312 /338 variables (removed 26) and now considering 235/259 (removed 24) transitions.
// Phase 1: matrix 235 rows 312 cols
[2024-05-21 23:37:04] [INFO ] Computed 79 invariants in 4 ms
[2024-05-21 23:37:04] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 23:37:04] [INFO ] Invariant cache hit.
[2024-05-21 23:37:04] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-21 23:37:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 3 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:37:08] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:37:09] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:37:10] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:37:11] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:37:11] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:37:11] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:37:11] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:37:11] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:37:11] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:37:12] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 3 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:37:13] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:37:14] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 17/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:37:17] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:37:18] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:37:19] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:37:20] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:37:20] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:37:20] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:37:21] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 7/152 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 3 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:37:25] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:37:25] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:37:26] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:37:26] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/312 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 4 ms to minimize.
[2024-05-21 23:37:27] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/312 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/312 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 14 (OVERLAPS) 235/547 variables, 312/476 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:37:31] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/547 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 547/547 variables, and 478 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 34/65 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 87/166 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 3 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:37:36] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 235/547 variables, 312/484 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 234/718 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:37:40] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:37:43] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/547 variables, 9/727 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:37:54] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:37:54] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/547 variables, 3/730 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:38:02] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/547 variables, and 734 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 109/109 constraints]
After SMT, in 60077ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 312/338 places, 235/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60590 ms. Remains : 312/338 places, 235/259 transitions.
[2024-05-21 23:38:04] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:38:04] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:38:04] [INFO ] Input system was already deterministic with 235 transitions.
[2024-05-21 23:38:04] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:38:04] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:38:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality15518297047529424817.gal : 2 ms
[2024-05-21 23:38:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality462522909198219473.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/CTLCardinality15518297047529424817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality462522909198219473.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.
Detected timeout of ITS tools.
[2024-05-21 23:38:34] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:38:34] [INFO ] Applying decomposition
[2024-05-21 23:38:34] [INFO ] Flatten gal took : 10 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/graph1396914712239274933.txt' '-o' '/tmp/graph1396914712239274933.bin' '-w' '/tmp/graph1396914712239274933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1396914712239274933.bin' '-l' '-1' '-v' '-w' '/tmp/graph1396914712239274933.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:38:34] [INFO ] Decomposing Gal with order
[2024-05-21 23:38:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:38:34] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-21 23:38:34] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:38:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:38:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality5094264203265034845.gal : 3 ms
[2024-05-21 23:38:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality15581220806476026741.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/CTLCardinality5094264203265034845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15581220806476026741.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.64213e+18,3.54812,82224,14765,41,151012,1106,658,347763,54,2403,0


Converting to forward existential form...Done !
original formula: AX(((i12.u80.p243==1) + (EF(((i9.i2.u104.p351==0)&&(i8.i0.u114.p375==1))) * (((i17.u87.p270==1)||(i8.i1.u45.p104==1))||((i1.u77.p225==0)|...201
=> equivalent forward existential formula: ([((EY(Init) * !((i12.u80.p243==1))) * !(E(TRUE U ((i9.i2.u104.p351==0)&&(i8.i0.u114.p375==1)))))] = FALSE * [((...308
Reverse transition relation is NOT exact ! Due to transitions t2, t108, t156, t160, t164, t168, t172, i0.t116, i0.i0.u36.t133, i0.i1.u51.t115, i1.u15.t163,...747
(forward)formula 0,1,24.2241,480380,1,0,949794,1106,3993,1.49036e+06,256,2403,3082211
FORMULA BusinessProcesses-PT-06-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 337 transition count 259
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 318 transition count 240
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 318 transition count 240
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 313 transition count 235
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 313 transition count 235
Applied a total of 49 rules in 17 ms. Remains 313 /338 variables (removed 25) and now considering 235/259 (removed 24) transitions.
// Phase 1: matrix 235 rows 313 cols
[2024-05-21 23:38:59] [INFO ] Computed 80 invariants in 5 ms
[2024-05-21 23:38:59] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-21 23:38:59] [INFO ] Invariant cache hit.
[2024-05-21 23:38:59] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-21 23:38:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 2/313 variables, 41/73 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:39:05] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:39:06] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 11/131 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:39:10] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:39:11] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:39:12] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:39:13] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/313 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/313 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 15 (OVERLAPS) 235/548 variables, 313/491 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 17 (OVERLAPS) 0/548 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 491 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 2/313 variables, 41/73 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 7/80 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 98/178 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 235/548 variables, 313/491 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 234/725 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:39:35] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:39:36] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 6/731 constraints. Problems are: Problem set: 0 solved, 234 unsolved
[2024-05-21 23:39:43] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:39:44] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 4/735 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 234 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 735 constraints, problems are : Problem set: 0 solved, 234 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 108/108 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in LTL mode, iteration 1 : 313/338 places, 235/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60502 ms. Remains : 313/338 places, 235/259 transitions.
[2024-05-21 23:39:59] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:39:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:39:59] [INFO ] Input system was already deterministic with 235 transitions.
[2024-05-21 23:39:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:39:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:39:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality18341890693181468239.gal : 2 ms
[2024-05-21 23:39:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality12221615134466255463.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/CTLCardinality18341890693181468239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12221615134466255463.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.
Detected timeout of ITS tools.
[2024-05-21 23:40:29] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:40:29] [INFO ] Applying decomposition
[2024-05-21 23:40:29] [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/graph12273809591227880478.txt' '-o' '/tmp/graph12273809591227880478.bin' '-w' '/tmp/graph12273809591227880478.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12273809591227880478.bin' '-l' '-1' '-v' '-w' '/tmp/graph12273809591227880478.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:40:29] [INFO ] Decomposing Gal with order
[2024-05-21 23:40:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:40:29] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-21 23:40:29] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:40:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:40:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality17670890265971166882.gal : 4 ms
[2024-05-21 23:40:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality17323310763177576894.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/CTLCardinality17670890265971166882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17323310763177576894.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,1.64213e+18,3.28853,105164,32518,32,253043,550,668,197547,47,1140,0


Converting to forward existential form...Done !
original formula: (AF(((((AF((i22.i1.u100.p333==1)) * EX((i8.i0.u60.p148==1))) + (AG(((i3.u20.p57==0)||(i11.u69.p172==1))) * AX((i6.i1.u38.p99==1)))) + (((...468
=> equivalent forward existential formula: ([FwdG(Init,!(((((!(EG(!((i22.i1.u100.p333==1)))) * EX((i8.i0.u60.p148==1))) + (!(E(TRUE U !(((i3.u20.p57==0)||(...571
Reverse transition relation is NOT exact ! Due to transitions t2, t116, t156, t164, t176, i0.i0.t108, i0.i0.u53.t115, i0.i0.u55.t111, i0.i1.u57.t107, i1.t1...732
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 338/338 places, 259/259 transitions.
Graph (trivial) has 159 edges and 338 vertex of which 6 / 338 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 643 edges and 333 vertex of which 330 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 329 transition count 210
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 288 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 287 transition count 209
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 86 place count 287 transition count 144
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 226 place count 212 transition count 144
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 246 place count 192 transition count 124
Iterating global reduction 3 with 20 rules applied. Total rules applied 266 place count 192 transition count 124
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 151 rules applied. Total rules applied 417 place count 114 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 419 place count 113 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 420 place count 112 transition count 49
Applied a total of 420 rules in 52 ms. Remains 112 /338 variables (removed 226) and now considering 49/259 (removed 210) transitions.
// Phase 1: matrix 49 rows 112 cols
[2024-05-21 23:41:00] [INFO ] Computed 64 invariants in 2 ms
[2024-05-21 23:41:00] [INFO ] Implicit Places using invariants in 123 ms returned [96, 98, 100]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 124 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 109/338 places, 49/259 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 180 ms. Remains : 109/338 places, 49/259 transitions.
[2024-05-21 23:41:00] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:41:00] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:41:00] [INFO ] Input system was already deterministic with 49 transitions.
[2024-05-21 23:41:00] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:41:00] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:41:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality7659992278145782553.gal : 1 ms
[2024-05-21 23:41:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality18174039819657615637.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/CTLCardinality7659992278145782553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18174039819657615637.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,98101,0.329991,15224,2,12824,5,68337,6,0,485,39969,0


Converting to forward existential form...Done !
original formula: AF(E(AF((p106==0)) U (EF(AG((p171==1))) * !(EF((p146==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(!(EG(!((p106==0)))) U (E(TRUE U !(E(TRUE U !((p171==1))))) * !(E(TRUE U (p146==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t16, t17, t26, Intersection with reachable at each step enabled. (destroyed/reverse/...182
(forward)formula 0,0,3.50604,98780,1,0,110,432148,130,65,3088,290924,159
FORMULA BusinessProcesses-PT-06-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-21 23:41:03] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:41:03] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:41:03] [INFO ] Applying decomposition
[2024-05-21 23:41:03] [INFO ] Flatten gal took : 12 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/graph17420064986037285162.txt' '-o' '/tmp/graph17420064986037285162.bin' '-w' '/tmp/graph17420064986037285162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17420064986037285162.bin' '-l' '-1' '-v' '-w' '/tmp/graph17420064986037285162.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:41:03] [INFO ] Decomposing Gal with order
[2024-05-21 23:41:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:41:03] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-21 23:41:03] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:41:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:41:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality11055082636759673331.gal : 4 ms
[2024-05-21 23:41:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality13929143451966691246.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/CTLCardinality11055082636759673331.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13929143451966691246.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 4 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.9638e+18,1.55206,52724,11351,61,126016,1082,726,105450,62,3507,0


Converting to forward existential form...Done !
original formula: (A((i9.i1.u127.p359==1) U EF(AG((i14.i1.u86.p224==1)))) * (EX((AF(E((i1.u15.p40==1) U ((i14.i0.u91.p238==0)||(i0.u21.p57==1)))) * (i11.i1...417
=> equivalent forward existential formula: ([((EY((Init * !((E(!(E(TRUE U !(E(TRUE U !((i14.i1.u86.p224==1)))))) U (!((i9.i1.u127.p359==1)) * !(E(TRUE U !(...1486
Reverse transition relation is NOT exact ! Due to transitions t2, t180, t188, t200, i0.t176, i0.t140, i0.u21.t179, i0.u38.t157, i1.u15.t191, i2.t196, i2.t1...996
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,932.115,2722424,1,0,6.48192e+06,1441,2473,6.31909e+06,180,3507,7310223
FORMULA BusinessProcesses-PT-06-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(!((((AF((i20.i1.u126.p350==1)) * AF((i19.u101.p285==0))) + ((EX((i6.i1.u51.p125==1)) * (i6.i1.u39.p128==1)) * (i20.i1.u126.p358==1))) *...237
=> equivalent forward existential formula: [(FwdU(Init,!((((!(EG(!((i20.i1.u126.p350==1)))) * !(EG(!((i19.u101.p285==0))))) + ((EX((i6.i1.u51.p125==1)) * (...307
(forward)formula 1,1,1107.71,2970580,1,0,6.93128e+06,1441,3118,6.67809e+06,199,4370,5075689
FORMULA BusinessProcesses-PT-06-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!((EX((i20.i0.u50.p124!=1)) * !((((i0.u21.p58!=1) * EX((i16.u93.p241==1))) * EX(TRUE))))) U (AF((((i8.i1.u60.p149==0)||(i18.i0.u95.p250...454
=> equivalent forward existential formula: ([FwdG(FwdU((FwdU(Init,!((EX((i20.i0.u50.p124!=1)) * !((((i0.u21.p58!=1) * EX((i16.u93.p241==1))) * EX(TRUE)))))...1115
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 2,0,1211.34,3050764,1,0,7.39891e+06,1521,3573,6.67809e+06,215,4714,8829634
FORMULA BusinessProcesses-PT-06-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(((((AF((i20.i0.u116.p333==1)) * EX((i8.i1.u60.p148==1))) + (AG(((i0.u21.p57==0)||(i10.i1.u72.p172==1))) * AX((i6.i1.u39.p99==1)))) + ...485
=> equivalent forward existential formula: ([FwdG(Init,!(((((!(EG(!((i20.i0.u116.p333==1)))) * EX((i8.i1.u60.p148==1))) + (!(E(TRUE U !(((i0.u21.p57==0)||(...588
(forward)formula 3,0,1216.01,3193852,1,0,7.7418e+06,1739,3594,6.67809e+06,216,5298,9509388
FORMULA BusinessProcesses-PT-06-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2244589 ms.

BK_STOP 1716336081767

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="BusinessProcesses-PT-06"
export BK_EXAMINATION="CTLCardinality"
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 BusinessProcesses-PT-06, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399600489"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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