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-171620399600497.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-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399600497
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K 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 40K 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.7K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 100K 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-07-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-07-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716334011317

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:26:52] [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:26:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:26:52] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-05-21 23:26:52] [INFO ] Transformed 386 places.
[2024-05-21 23:26:52] [INFO ] Transformed 360 transitions.
[2024-05-21 23:26:52] [INFO ] Found NUPN structural information;
[2024-05-21 23:26:52] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 107 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 353 transition count 327
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 353 transition count 327
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 78 place count 341 transition count 315
Iterating global reduction 0 with 12 rules applied. Total rules applied 90 place count 341 transition count 315
Applied a total of 90 rules in 70 ms. Remains 341 /386 variables (removed 45) and now considering 315/360 (removed 45) transitions.
// Phase 1: matrix 315 rows 341 cols
[2024-05-21 23:26:53] [INFO ] Computed 62 invariants in 28 ms
[2024-05-21 23:26:53] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-21 23:26:53] [INFO ] Invariant cache hit.
[2024-05-21 23:26:53] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
Running 314 sub problems to find dead transitions.
[2024-05-21 23:26:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/339 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (OVERLAPS) 2/341 variables, 33/60 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-21 23:26:59] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 15 ms to minimize.
[2024-05-21 23:26:59] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 4 ms to minimize.
[2024-05-21 23:26:59] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 10 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:27:00] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:27:01] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 82 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:27:02] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 69 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 70 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 70 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 87 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 89 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 85 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:27:04] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 3 ms to minimize.
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:27:05] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 2 ms to minimize.
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD294 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 20/122 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:27:07] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:27:08] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 3 ms to minimize.
[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 77 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 20/142 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:27:10] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:27:11] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:27:12] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 20/162 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:27:13] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:27:14] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:27:15] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:27:15] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:27:15] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 20/182 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:27:17] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:27:18] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 20/202 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:27:20] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:27:21] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:27:22] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 20/222 constraints. Problems are: Problem set: 10 solved, 304 unsolved
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 71 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:27:23] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:27:24] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:27:24] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 30257ms, After SMT, problems are : Problem set: 10 solved, 304 unsolved
Search for dead transitions found 10 dead transitions in 30272ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 341/386 places, 305/360 transitions.
Applied a total of 0 rules in 10 ms. Remains 341 /341 variables (removed 0) and now considering 305/305 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31310 ms. Remains : 341/386 places, 305/360 transitions.
Support contains 107 out of 341 places after structural reductions.
[2024-05-21 23:27:24] [INFO ] Flatten gal took : 121 ms
[2024-05-21 23:27:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:27:24] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:27:24] [INFO ] Input system was already deterministic with 305 transitions.
Support contains 93 out of 341 places (down from 107) after GAL structural reductions.
RANDOM walk for 40000 steps (434 resets) in 2233 ms. (17 steps per ms) remains 4/66 properties
BEST_FIRST walk for 40003 steps (78 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (92 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (77 resets) in 81 ms. (487 steps per ms) remains 1/4 properties
// Phase 1: matrix 305 rows 341 cols
[2024-05-21 23:27:25] [INFO ] Computed 62 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 214/242 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:27:25] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:27:25] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 97/339 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:27:25] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:27:25] [INFO ] Deduced a trap composed of 47 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:27:25] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:27:25] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:25] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/341 variables, 2/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 305/646 variables, 341/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/646 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 441 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 214/242 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 5 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 69 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 71 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 97/339 variables, 27/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:27:26] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/341 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 305/646 variables, 341/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/646 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:27:27] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/646 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/646 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/646 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 426 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 22/22 constraints]
After SMT, in 1709ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5149 steps, including 72 resets, run visited all 1 properties in 34 ms. (steps per millisecond=151 )
Parikh walk visited 1 properties in 42 ms.
[2024-05-21 23:27:27] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:27:27] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:27:27] [INFO ] Input system was already deterministic with 305 transitions.
Computed a total of 211 stabilizing places and 202 stable transitions
Graph (complete) has 742 edges and 341 vertex of which 339 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 321 transition count 286
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 321 transition count 286
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 314 transition count 279
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 314 transition count 279
Applied a total of 53 rules in 52 ms. Remains 314 /341 variables (removed 27) and now considering 279/305 (removed 26) transitions.
// Phase 1: matrix 279 rows 314 cols
[2024-05-21 23:27:27] [INFO ] Computed 61 invariants in 15 ms
[2024-05-21 23:27:27] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-21 23:27:27] [INFO ] Invariant cache hit.
[2024-05-21 23:27:27] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-05-21 23:27:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (OVERLAPS) 1/314 variables, 32/56 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-21 23:27:31] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:27:31] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:27:31] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:27:31] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:27:31] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 1 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:27:32] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 2 ms to minimize.
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 20/81 constraints. Problems are: Problem set: 4 solved, 274 unsolved
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:27:33] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 68 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:27:34] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:27:35] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:27:35] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:27:35] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:27:35] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:27:35] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:27:35] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:27:35] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:27:35] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 20/101 constraints. Problems are: Problem set: 10 solved, 268 unsolved
[2024-05-21 23:27:35] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:27:35] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:27:36] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:27:36] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:27:36] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:27:36] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:27:36] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:27:36] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:27:36] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:27:36] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:27:36] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:27:36] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:27:37] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:27:37] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:27:37] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:27:37] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:27:37] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:27:37] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:27:37] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:37] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 20/121 constraints. Problems are: Problem set: 20 solved, 258 unsolved
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:39] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 4 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:27:40] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:27:41] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 20/141 constraints. Problems are: Problem set: 23 solved, 255 unsolved
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:27:42] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:27:43] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:27:44] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 20/161 constraints. Problems are: Problem set: 23 solved, 255 unsolved
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:27:45] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:27:46] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:27:47] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:48] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 20/181 constraints. Problems are: Problem set: 23 solved, 255 unsolved
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:27:50] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:27:51] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:27:52] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:27:53] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 20/201 constraints. Problems are: Problem set: 23 solved, 255 unsolved
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 64 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:27:54] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:27:55] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:27:56] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:27:57] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 20/221 constraints. Problems are: Problem set: 23 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/593 variables, and 221 constraints, problems are : Problem set: 23 solved, 255 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/314 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 160/160 constraints]
Escalating to Integer solving :Problem set: 23 solved, 255 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 24/24 constraints. Problems are: Problem set: 23 solved, 255 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/24 constraints. Problems are: Problem set: 23 solved, 255 unsolved
At refinement iteration 2 (OVERLAPS) 1/314 variables, 32/56 constraints. Problems are: Problem set: 23 solved, 255 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 5/61 constraints. Problems are: Problem set: 23 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 160/221 constraints. Problems are: Problem set: 23 solved, 255 unsolved
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:28:00] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:28:01] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
Problem TDEAD226 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 20/241 constraints. Problems are: Problem set: 24 solved, 254 unsolved
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:28:02] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:28:03] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:28:04] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:28:04] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:28:04] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:28:04] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:28:04] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:28:04] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:28:04] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:28:04] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:28:05] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
Problem TDEAD228 is UNSAT
Problem TDEAD251 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 20/261 constraints. Problems are: Problem set: 26 solved, 252 unsolved
[2024-05-21 23:28:05] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:28:06] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:28:06] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:28:06] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:28:06] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:28:06] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:28:07] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:28:07] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:28:07] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:28:07] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:28:07] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:28:08] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:28:08] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 3 ms to minimize.
[2024-05-21 23:28:08] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:28:08] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:28:08] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:28:08] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:28:09] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:28:09] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:28:09] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 20/281 constraints. Problems are: Problem set: 26 solved, 252 unsolved
[2024-05-21 23:28:10] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:28:10] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:28:10] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:28:11] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:28:11] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:28:11] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:28:11] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:28:11] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:28:11] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:28:12] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:28:12] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:28:12] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:28:12] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:28:12] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:28:12] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:28:12] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:28:12] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 20/301 constraints. Problems are: Problem set: 26 solved, 252 unsolved
[2024-05-21 23:28:13] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:28:14] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:28:15] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 6/307 constraints. Problems are: Problem set: 26 solved, 252 unsolved
[2024-05-21 23:28:16] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:28:16] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:28:16] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:28:17] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:28:17] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 5/312 constraints. Problems are: Problem set: 26 solved, 252 unsolved
[2024-05-21 23:28:18] [INFO ] Deduced a trap composed of 69 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:28:18] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:28:19] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:28:19] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:28:19] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:28:19] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:28:19] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:28:20] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:28:21] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 14/326 constraints. Problems are: Problem set: 26 solved, 252 unsolved
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:28:23] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 4/330 constraints. Problems are: Problem set: 26 solved, 252 unsolved
[2024-05-21 23:28:26] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:28:26] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 2/332 constraints. Problems are: Problem set: 26 solved, 252 unsolved
[2024-05-21 23:28:28] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 60216ms, After SMT, problems are : Problem set: 26 solved, 252 unsolved
Search for dead transitions found 26 dead transitions in 60221ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 314/341 places, 253/305 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 311 transition count 253
Applied a total of 3 rules in 15 ms. Remains 311 /314 variables (removed 3) and now considering 253/253 (removed 0) transitions.
// Phase 1: matrix 253 rows 311 cols
[2024-05-21 23:28:28] [INFO ] Computed 67 invariants in 3 ms
[2024-05-21 23:28:28] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-21 23:28:28] [INFO ] Invariant cache hit.
[2024-05-21 23:28:28] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 311/341 places, 253/305 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61146 ms. Remains : 311/341 places, 253/305 transitions.
[2024-05-21 23:28:28] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:28:28] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:28:28] [INFO ] Input system was already deterministic with 253 transitions.
[2024-05-21 23:28:28] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:28:28] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:28:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality4332494320874959147.gal : 9 ms
[2024-05-21 23:28:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality11560335945694568174.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/CTLCardinality4332494320874959147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11560335945694568174.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:58] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:28:58] [INFO ] Applying decomposition
[2024-05-21 23:28:58] [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/graph12467921687276075064.txt' '-o' '/tmp/graph12467921687276075064.bin' '-w' '/tmp/graph12467921687276075064.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12467921687276075064.bin' '-l' '-1' '-v' '-w' '/tmp/graph12467921687276075064.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:28:58] [INFO ] Decomposing Gal with order
[2024-05-21 23:28:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:28:59] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-21 23:28:59] [INFO ] Flatten gal took : 65 ms
[2024-05-21 23:28:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 10 ms.
[2024-05-21 23:28:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality10316910829679667418.gal : 8 ms
[2024-05-21 23:28:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality2542484497912804655.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/CTLCardinality10316910829679667418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2542484497912804655.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,4.84696e+17,1.2306,39616,2726,53,70113,681,722,125040,72,1839,0


Converting to forward existential form...Done !
original formula: E((!((E(((((i5.u16.p44==0)||(i16.i2.u82.p263==1))&&(i7.u22.p58==1)) * E(((i8.u38.p112==0)||(i3.i1.u63.p179==1)) U ((i18.i1.u101.p362==0)|...819
=> equivalent forward existential formula: [((FwdU(Init,(!((E(((((i5.u16.p44==0)||(i16.i2.u82.p263==1))&&(i7.u22.p58==1)) * E(((i8.u38.p112==0)||(i3.i1.u63...1239
Reverse transition relation is NOT exact ! Due to transitions t7, t137, t172, t184, t210, t214, t238, t246, t247, i0.t113, i0.u47.t124, i0.u49.t120, i0.u51...908
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 1
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 an SCC at level 9
Fast SCC detection found an SCC at level 10
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Graph (trivial) has 171 edges and 341 vertex of which 7 / 341 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 735 edges and 335 vertex of which 333 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 332 transition count 249
Reduce places removed 47 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 285 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 284 transition count 248
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 98 place count 284 transition count 185
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 233 place count 212 transition count 185
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 253 place count 192 transition count 165
Iterating global reduction 3 with 20 rules applied. Total rules applied 273 place count 192 transition count 165
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 273 place count 192 transition count 162
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 279 place count 189 transition count 162
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 416 place count 119 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 417 place count 118 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 418 place count 117 transition count 94
Applied a total of 418 rules in 130 ms. Remains 117 /341 variables (removed 224) and now considering 94/305 (removed 211) transitions.
// Phase 1: matrix 94 rows 117 cols
[2024-05-21 23:29:29] [INFO ] Computed 48 invariants in 2 ms
[2024-05-21 23:29:29] [INFO ] Implicit Places using invariants in 143 ms returned [37, 38, 39, 40, 41, 42]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 145 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 111/341 places, 94/305 transitions.
Applied a total of 0 rules in 7 ms. Remains 111 /111 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 282 ms. Remains : 111/341 places, 94/305 transitions.
[2024-05-21 23:29:29] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:29:29] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:29:29] [INFO ] Input system was already deterministic with 94 transitions.
RANDOM walk for 9 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 23:29:29] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:29:29] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:29:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2646646283945051056.gal : 1 ms
[2024-05-21 23:29:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6731680202572133243.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2646646283945051056.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6731680202572133243.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 312 transition count 277
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 312 transition count 277
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 303 transition count 268
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 303 transition count 268
Applied a total of 75 rules in 31 ms. Remains 303 /341 variables (removed 38) and now considering 268/305 (removed 37) transitions.
// Phase 1: matrix 268 rows 303 cols
[2024-05-21 23:29:29] [INFO ] Computed 61 invariants in 9 ms
[2024-05-21 23:29:29] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-21 23:29:29] [INFO ] Invariant cache hit.
[2024-05-21 23:29:30] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-05-21 23:29:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/303 variables, 33/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-21 23:29:33] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:29:33] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:29:33] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:29:33] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:29:34] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 3 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:29:35] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:29:36] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:29:37] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 20/101 constraints. Problems are: Problem set: 18 solved, 249 unsolved
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:29:38] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:29:39] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:29:40] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 20/121 constraints. Problems are: Problem set: 18 solved, 249 unsolved
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:29:42] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:29:43] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 20/141 constraints. Problems are: Problem set: 18 solved, 249 unsolved
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:29:44] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:29:45] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:29:46] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 20/161 constraints. Problems are: Problem set: 20 solved, 247 unsolved
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 74 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:29:47] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:29:48] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:29:49] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:29:49] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:29:49] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:29:49] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:29:49] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:29:49] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:29:50] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 20/181 constraints. Problems are: Problem set: 25 solved, 242 unsolved
[2024-05-21 23:29:52] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:29:52] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:29:52] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:29:52] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:29:52] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:29:53] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 13/194 constraints. Problems are: Problem set: 25 solved, 242 unsolved
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:29:54] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:29:55] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:29:56] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 3 ms to minimize.
Problem TDEAD215 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 13/207 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:29:57] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:29:58] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:29:59] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 9/216 constraints. Problems are: Problem set: 26 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 303/571 variables, and 216 constraints, problems are : Problem set: 26 solved, 241 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/303 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 155/155 constraints]
Escalating to Integer solving :Problem set: 26 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 27/27 constraints. Problems are: Problem set: 26 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/27 constraints. Problems are: Problem set: 26 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/303 variables, 33/60 constraints. Problems are: Problem set: 26 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 1/61 constraints. Problems are: Problem set: 26 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 155/216 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:30:02] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:30:03] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:30:03] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:30:03] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:30:04] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 7/223 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:30:04] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:30:05] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:30:05] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:30:05] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:30:05] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:30:06] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 6/229 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:30:07] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:30:08] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 5/234 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:30:10] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 2/236 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:30:12] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 4/240 constraints. Problems are: Problem set: 26 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/240 constraints. Problems are: Problem set: 26 solved, 241 unsolved
At refinement iteration 11 (OVERLAPS) 268/571 variables, 303/543 constraints. Problems are: Problem set: 26 solved, 241 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/571 variables, 241/784 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:30:18] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:30:19] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:30:20] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:30:20] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:30:21] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:30:24] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:30:25] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:30:25] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:30:25] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:30:26] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:30:26] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/571 variables, 20/804 constraints. Problems are: Problem set: 26 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/571 variables, and 804 constraints, problems are : Problem set: 26 solved, 241 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 241/267 constraints, Known Traps: 199/199 constraints]
After SMT, in 60109ms problems are : Problem set: 26 solved, 241 unsolved
Search for dead transitions found 26 dead transitions in 60112ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 303/341 places, 242/305 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 300 transition count 242
Applied a total of 3 rules in 19 ms. Remains 300 /303 variables (removed 3) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 300 cols
[2024-05-21 23:30:30] [INFO ] Computed 67 invariants in 6 ms
[2024-05-21 23:30:30] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-21 23:30:30] [INFO ] Invariant cache hit.
[2024-05-21 23:30:30] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 300/341 places, 242/305 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61186 ms. Remains : 300/341 places, 242/305 transitions.
[2024-05-21 23:30:30] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:30:30] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:30:30] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-21 23:30:30] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:30:30] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:30:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality13043803570151314618.gal : 2 ms
[2024-05-21 23:30:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality17596199652693036699.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/CTLCardinality13043803570151314618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17596199652693036699.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:31:00] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:31:00] [INFO ] Applying decomposition
[2024-05-21 23:31:00] [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/graph5593035487226453104.txt' '-o' '/tmp/graph5593035487226453104.bin' '-w' '/tmp/graph5593035487226453104.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5593035487226453104.bin' '-l' '-1' '-v' '-w' '/tmp/graph5593035487226453104.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:31:00] [INFO ] Decomposing Gal with order
[2024-05-21 23:31:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:31:00] [INFO ] Removed a total of 67 redundant transitions.
[2024-05-21 23:31:00] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:31:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-21 23:31:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality11008014857119907081.gal : 4 ms
[2024-05-21 23:31:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality7785122702393790627.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/CTLCardinality11008014857119907081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7785122702393790627.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,4.23627e+17,1.25685,43964,3071,30,80675,404,647,150641,54,915,0


Converting to forward existential form...Done !
original formula: EF(AX(EX(AG((i0.u41.p126==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(!(E(TRUE U !((i0.u41.p126==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t131, t149, t157, t161, t173, t199, t203, t224, t225, t227, t234, t235, t236, i0.u41.t126...803
(forward)formula 0,1,3.60011,114188,1,0,239632,404,3947,470841,245,915,442363
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 314 transition count 279
Iterating global reduction 1 with 26 rules applied. Total rules applied 53 place count 314 transition count 279
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 62 place count 305 transition count 270
Iterating global reduction 1 with 9 rules applied. Total rules applied 71 place count 305 transition count 270
Applied a total of 71 rules in 18 ms. Remains 305 /341 variables (removed 36) and now considering 270/305 (removed 35) transitions.
// Phase 1: matrix 270 rows 305 cols
[2024-05-21 23:31:04] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 23:31:04] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 23:31:04] [INFO ] Invariant cache hit.
[2024-05-21 23:31:05] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-05-21 23:31:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (OVERLAPS) 1/305 variables, 32/59 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:31:09] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:31:10] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
Problem TDEAD209 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 20/81 constraints. Problems are: Problem set: 4 solved, 265 unsolved
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:31:11] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:12] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:12] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:31:12] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:31:12] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:12] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:31:12] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:31:12] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:31:12] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:31:13] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:31:13] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:31:13] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:31:13] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
Problem TDEAD234 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 20/101 constraints. Problems are: Problem set: 7 solved, 262 unsolved
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 79 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:31:14] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 14 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:31:15] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:16] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 20/121 constraints. Problems are: Problem set: 16 solved, 253 unsolved
[2024-05-21 23:31:17] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:31:18] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:31:19] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 3 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD244 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 20/141 constraints. Problems are: Problem set: 21 solved, 248 unsolved
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:31:20] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:21] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:31:22] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 20/161 constraints. Problems are: Problem set: 25 solved, 244 unsolved
[2024-05-21 23:31:23] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:31:24] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:31:25] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:31:26] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:31:27] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 20/181 constraints. Problems are: Problem set: 25 solved, 244 unsolved
[2024-05-21 23:31:28] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:31:29] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:31:30] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
Problem TDEAD222 is UNSAT
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 14/195 constraints. Problems are: Problem set: 26 solved, 243 unsolved
[2024-05-21 23:31:31] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:31:32] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:31:32] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:31:32] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:33] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:31:34] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/575 variables, and 211 constraints, problems are : Problem set: 26 solved, 243 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/305 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 150/150 constraints]
Escalating to Integer solving :Problem set: 26 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 27/27 constraints. Problems are: Problem set: 26 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/27 constraints. Problems are: Problem set: 26 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 1/305 variables, 32/59 constraints. Problems are: Problem set: 26 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 2/61 constraints. Problems are: Problem set: 26 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 150/211 constraints. Problems are: Problem set: 26 solved, 243 unsolved
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:31:37] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 55 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:31:38] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:31:39] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 20/231 constraints. Problems are: Problem set: 26 solved, 243 unsolved
[2024-05-21 23:31:40] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:31:41] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 8/239 constraints. Problems are: Problem set: 26 solved, 243 unsolved
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:31:42] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:31:43] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:31:44] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:31:45] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 16/255 constraints. Problems are: Problem set: 26 solved, 243 unsolved
[2024-05-21 23:31:46] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 67 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:31:47] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:31:48] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:31:49] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:31:50] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:31:50] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:31:50] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 20/275 constraints. Problems are: Problem set: 26 solved, 243 unsolved
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:31:51] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:31:52] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:31:52] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:31:52] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:31:52] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:31:53] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:31:53] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 5 ms to minimize.
[2024-05-21 23:31:53] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:31:53] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:31:53] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:31:53] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:31:53] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:31:53] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:31:54] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:31:54] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 20/295 constraints. Problems are: Problem set: 26 solved, 243 unsolved
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:31:55] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:31:56] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 7/302 constraints. Problems are: Problem set: 26 solved, 243 unsolved
[2024-05-21 23:31:58] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:31:59] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 2/304 constraints. Problems are: Problem set: 26 solved, 243 unsolved
[2024-05-21 23:32:01] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:32:01] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:32:02] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 4/308 constraints. Problems are: Problem set: 26 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/575 variables, and 308 constraints, problems are : Problem set: 26 solved, 243 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/305 constraints, PredecessorRefiner: 0/269 constraints, Known Traps: 247/247 constraints]
After SMT, in 60103ms problems are : Problem set: 26 solved, 243 unsolved
Search for dead transitions found 26 dead transitions in 60107ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 305/341 places, 244/305 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 302 transition count 244
Applied a total of 3 rules in 6 ms. Remains 302 /305 variables (removed 3) and now considering 244/244 (removed 0) transitions.
// Phase 1: matrix 244 rows 302 cols
[2024-05-21 23:32:05] [INFO ] Computed 67 invariants in 1 ms
[2024-05-21 23:32:05] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 23:32:05] [INFO ] Invariant cache hit.
[2024-05-21 23:32:05] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 302/341 places, 244/305 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60884 ms. Remains : 302/341 places, 244/305 transitions.
[2024-05-21 23:32:05] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:32:05] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:32:05] [INFO ] Input system was already deterministic with 244 transitions.
[2024-05-21 23:32:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:32:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:32:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality4873499895614569695.gal : 2 ms
[2024-05-21 23:32:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality439737577822691353.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/CTLCardinality4873499895614569695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality439737577822691353.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:32:35] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:32:35] [INFO ] Applying decomposition
[2024-05-21 23:32:35] [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/graph8551879611253099776.txt' '-o' '/tmp/graph8551879611253099776.bin' '-w' '/tmp/graph8551879611253099776.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8551879611253099776.bin' '-l' '-1' '-v' '-w' '/tmp/graph8551879611253099776.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:32:35] [INFO ] Decomposing Gal with order
[2024-05-21 23:32:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:32:35] [INFO ] Removed a total of 70 redundant transitions.
[2024-05-21 23:32:35] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:32:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 15 ms.
[2024-05-21 23:32:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality4613402493543422803.gal : 3 ms
[2024-05-21 23:32:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality14662340766400300725.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/CTLCardinality4613402493543422803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14662340766400300725.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,4.45906e+17,2.93837,80500,3232,34,131416,488,665,231392,60,1201,0


Converting to forward existential form...Done !
original formula: (AG((A(AX(E(((i2.u6.p14==0)||(i1.i0.u20.p53==1)) U (i16.u85.p299==0))) U (i9.u50.p151==0)) + ((((i1.i1.u40.p119==0)&&(i4.i1.u71.p221==1))...253
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !((!((E(!((i9.u50.p151==0)) U (!(!(EX(!(E(((i2.u6.p14==0)||(i1.i0.u20.p53==1)) U (i1...413
Reverse transition relation is NOT exact ! Due to transitions t7, t109, t133, t151, t159, t163, t169, t201, t205, t227, t236, t237, t238, i0.u46.t120, i0.u...805
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 1
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 an SCC at level 9
Fast SCC detection found an SCC at level 10
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Graph (trivial) has 172 edges and 341 vertex of which 7 / 341 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 735 edges and 335 vertex of which 333 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 332 transition count 248
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 284 transition count 248
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 98 place count 284 transition count 184
Deduced a syphon composed of 64 places in 2 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 235 place count 211 transition count 184
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 256 place count 190 transition count 163
Iterating global reduction 2 with 21 rules applied. Total rules applied 277 place count 190 transition count 163
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 277 place count 190 transition count 160
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 283 place count 187 transition count 160
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 135 rules applied. Total rules applied 418 place count 118 transition count 94
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 424 place count 118 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 425 place count 117 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 426 place count 116 transition count 93
Applied a total of 426 rules in 58 ms. Remains 116 /341 variables (removed 225) and now considering 93/305 (removed 212) transitions.
// Phase 1: matrix 93 rows 116 cols
[2024-05-21 23:33:05] [INFO ] Computed 48 invariants in 3 ms
[2024-05-21 23:33:05] [INFO ] Implicit Places using invariants in 119 ms returned [0, 1, 9, 35, 36, 37, 38, 39, 40]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 133 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 107/341 places, 93/305 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 195 ms. Remains : 107/341 places, 93/305 transitions.
[2024-05-21 23:33:05] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:33:05] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:33:06] [INFO ] Input system was already deterministic with 93 transitions.
[2024-05-21 23:33:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:33:06] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:33:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality9312555576522027670.gal : 1 ms
[2024-05-21 23:33:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality180192018332893246.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/CTLCardinality9312555576522027670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality180192018332893246.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.74406e+06,1.30605,48888,2,9615,5,208141,6,0,522,178109,0


Converting to forward existential form...Done !
original formula: AG(EF(((p311==0)||(p251==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p311==0)||(p251==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t17, t18, t19, t29, t30, t31, t32, t33, t50, t61, t62, t72, t73, t75, t76, t77, t78, t79...261
(forward)formula 0,1,4.44608,111056,1,0,147,573848,180,61,3889,261596,169
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Graph (trivial) has 165 edges and 341 vertex of which 7 / 341 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 735 edges and 335 vertex of which 333 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 332 transition count 252
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 288 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 287 transition count 251
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 92 place count 287 transition count 187
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 229 place count 214 transition count 187
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 247 place count 196 transition count 169
Iterating global reduction 3 with 18 rules applied. Total rules applied 265 place count 196 transition count 169
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 265 place count 196 transition count 167
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 269 place count 194 transition count 167
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 406 place count 124 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 407 place count 123 transition count 99
Applied a total of 407 rules in 24 ms. Remains 123 /341 variables (removed 218) and now considering 99/305 (removed 206) transitions.
// Phase 1: matrix 99 rows 123 cols
[2024-05-21 23:33:10] [INFO ] Computed 49 invariants in 1 ms
[2024-05-21 23:33:10] [INFO ] Implicit Places using invariants in 68 ms returned [0, 1, 9, 36, 37, 38, 39, 40, 41]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 69 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 114/341 places, 99/305 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 96 ms. Remains : 114/341 places, 99/305 transitions.
[2024-05-21 23:33:10] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:33:10] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:33:10] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-21 23:33:10] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:33:10] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:33:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality3141761717764296914.gal : 1 ms
[2024-05-21 23:33:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality9171584879809144868.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/CTLCardinality3141761717764296914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9171584879809144868.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: !(E(A(EF(AG(((p158==0)||(p233==1)))) U EF(((p78==0)||(p315==1)))) U (p293==1)))
=> equivalent forward existential formula: [(FwdU(Init,!((E(!(E(TRUE U ((p78==0)||(p315==1)))) U (!(E(TRUE U !(E(TRUE U !(((p158==0)||(p233==1))))))) * !(E...254
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t7, t8, t31, t32, t33, t47, t48, t49, t50, t51, t61, t73, t74, t82, t83, t85, t86, t8...267
(forward)formula 0,0,10.1013,208336,1,0,164,1.0658e+06,203,71,4139,681344,189
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 313 transition count 278
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 313 transition count 278
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 304 transition count 269
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 304 transition count 269
Applied a total of 73 rules in 27 ms. Remains 304 /341 variables (removed 37) and now considering 269/305 (removed 36) transitions.
// Phase 1: matrix 269 rows 304 cols
[2024-05-21 23:33:20] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 23:33:21] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-21 23:33:21] [INFO ] Invariant cache hit.
[2024-05-21 23:33:21] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-21 23:33:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/304 variables, 33/60 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:33:25] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:33:25] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:25] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:33:25] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:33:25] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:33:25] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:33:25] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:33:25] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:33:26] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 3 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/81 constraints. Problems are: Problem set: 14 solved, 254 unsolved
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:33:27] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:33:28] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/101 constraints. Problems are: Problem set: 14 solved, 254 unsolved
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:33:29] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:33:30] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:33:31] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 2 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD238 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 20/121 constraints. Problems are: Problem set: 21 solved, 247 unsolved
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:32] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:33:33] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:33:34] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 2 ms to minimize.
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 20/141 constraints. Problems are: Problem set: 23 solved, 245 unsolved
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:33:35] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:33:36] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 20/161 constraints. Problems are: Problem set: 23 solved, 245 unsolved
[2024-05-21 23:33:37] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 3 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:33:38] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:33:39] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 80 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:33:40] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 1 ms to minimize.
Problem TDEAD228 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 20/181 constraints. Problems are: Problem set: 24 solved, 244 unsolved
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:33:42] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:33:43] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:33:44] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 3 ms to minimize.
Problem TDEAD208 is UNSAT
Problem TDEAD221 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 17/198 constraints. Problems are: Problem set: 26 solved, 242 unsolved
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:33:46] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 3/201 constraints. Problems are: Problem set: 26 solved, 242 unsolved
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:33:47] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:33:48] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:33:49] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 5/206 constraints. Problems are: Problem set: 26 solved, 242 unsolved
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:33:51] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 2 ms to minimize.
SMT process timed out in 30097ms, After SMT, problems are : Problem set: 26 solved, 242 unsolved
Search for dead transitions found 26 dead transitions in 30101ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 304/341 places, 243/305 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 301 transition count 243
Applied a total of 3 rules in 3 ms. Remains 301 /304 variables (removed 3) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 301 cols
[2024-05-21 23:33:51] [INFO ] Computed 67 invariants in 2 ms
[2024-05-21 23:33:51] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-21 23:33:51] [INFO ] Invariant cache hit.
[2024-05-21 23:33:51] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 301/341 places, 243/305 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30976 ms. Remains : 301/341 places, 243/305 transitions.
[2024-05-21 23:33:51] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:33:51] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:33:51] [INFO ] Input system was already deterministic with 243 transitions.
[2024-05-21 23:33:51] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:33:51] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:33:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality14482187306273536710.gal : 1 ms
[2024-05-21 23:33:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality17263258050244819686.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/CTLCardinality14482187306273536710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17263258050244819686.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:34:21] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:34:21] [INFO ] Applying decomposition
[2024-05-21 23:34:21] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6249977559919038753.txt' '-o' '/tmp/graph6249977559919038753.bin' '-w' '/tmp/graph6249977559919038753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6249977559919038753.bin' '-l' '-1' '-v' '-w' '/tmp/graph6249977559919038753.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:34:22] [INFO ] Decomposing Gal with order
[2024-05-21 23:34:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:34:22] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-21 23:34:22] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:34:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 23:34:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality11534932920893760810.gal : 3 ms
[2024-05-21 23:34:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality10873972086713764816.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/CTLCardinality11534932920893760810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10873972086713764816.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,4.23628e+17,0.998602,36400,3106,43,57987,708,686,123972,67,1598,0


Converting to forward existential form...Done !
original formula: E((i7.i0.u24.p98!=1) U (AX(AX(((i5.u21.p58==0)||(i2.u92.p339==1)))) * (i13.i1.u71.p228==1)))
=> equivalent forward existential formula: [((FwdU(Init,(i7.i0.u24.p98!=1)) * (i13.i1.u71.p228==1)) * !(EX(!(!(EX(!(((i5.u21.p58==0)||(i2.u92.p339==1))))))...168
Reverse transition relation is NOT exact ! Due to transitions t7, t108, t132, t150, t162, t168, t200, t204, t225, t226, t228, t235, t236, t237, i0.u76.t59,...831
(forward)formula 0,1,5.65275,160480,1,0,314652,857,4150,594894,309,2139,644647
FORMULA BusinessProcesses-PT-07-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 317 transition count 282
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 317 transition count 282
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 310 transition count 275
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 310 transition count 275
Applied a total of 61 rules in 20 ms. Remains 310 /341 variables (removed 31) and now considering 275/305 (removed 30) transitions.
// Phase 1: matrix 275 rows 310 cols
[2024-05-21 23:34:27] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:34:27] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-21 23:34:27] [INFO ] Invariant cache hit.
[2024-05-21 23:34:28] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-05-21 23:34:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 33/60 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:34:32] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:34:33] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD254 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 20/81 constraints. Problems are: Problem set: 4 solved, 270 unsolved
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 20/101 constraints. Problems are: Problem set: 6 solved, 268 unsolved
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:34:37] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:34:38] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 20/121 constraints. Problems are: Problem set: 20 solved, 254 unsolved
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:34:39] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:34:40] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 3 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD240 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 20/141 constraints. Problems are: Problem set: 25 solved, 249 unsolved
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:41] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
Problem TDEAD221 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 20/161 constraints. Problems are: Problem set: 26 solved, 248 unsolved
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:34:44] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:34:46] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:34:47] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 20/181 constraints. Problems are: Problem set: 26 solved, 248 unsolved
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:34:50] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 3 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:34:51] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:34:52] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:34:52] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 20/201 constraints. Problems are: Problem set: 26 solved, 248 unsolved
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:34:55] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:34:56] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 20/221 constraints. Problems are: Problem set: 26 solved, 248 unsolved
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/585 variables, and 228 constraints, problems are : Problem set: 26 solved, 248 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/310 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 167/167 constraints]
Escalating to Integer solving :Problem set: 26 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 27/27 constraints. Problems are: Problem set: 26 solved, 248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 0/27 constraints. Problems are: Problem set: 26 solved, 248 unsolved
At refinement iteration 2 (OVERLAPS) 1/310 variables, 33/60 constraints. Problems are: Problem set: 26 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 1/61 constraints. Problems are: Problem set: 26 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 167/228 constraints. Problems are: Problem set: 26 solved, 248 unsolved
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:35:00] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:35:01] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:35:02] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:35:03] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 20/248 constraints. Problems are: Problem set: 26 solved, 248 unsolved
[2024-05-21 23:35:04] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:35:05] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:35:06] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 10/258 constraints. Problems are: Problem set: 26 solved, 248 unsolved
[2024-05-21 23:35:07] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:35:08] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:35:08] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:35:09] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 7/265 constraints. Problems are: Problem set: 26 solved, 248 unsolved
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:35:11] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:35:12] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:35:12] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:35:12] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:35:12] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:35:12] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:35:12] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 10/275 constraints. Problems are: Problem set: 26 solved, 248 unsolved
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:35:15] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 2/277 constraints. Problems are: Problem set: 26 solved, 248 unsolved
[2024-05-21 23:35:16] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:35:17] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:35:18] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 8/285 constraints. Problems are: Problem set: 26 solved, 248 unsolved
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:20] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:35:21] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 6/291 constraints. Problems are: Problem set: 26 solved, 248 unsolved
[2024-05-21 23:35:22] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:35:23] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 4/295 constraints. Problems are: Problem set: 26 solved, 248 unsolved
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:35:24] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:35:25] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:35:26] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 4/299 constraints. Problems are: Problem set: 26 solved, 248 unsolved
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:35:27] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:35:28] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/585 variables, and 307 constraints, problems are : Problem set: 26 solved, 248 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/310 constraints, PredecessorRefiner: 0/274 constraints, Known Traps: 246/246 constraints]
After SMT, in 60071ms problems are : Problem set: 26 solved, 248 unsolved
Search for dead transitions found 26 dead transitions in 60074ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 310/341 places, 249/305 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 307 transition count 249
Applied a total of 3 rules in 4 ms. Remains 307 /310 variables (removed 3) and now considering 249/249 (removed 0) transitions.
// Phase 1: matrix 249 rows 307 cols
[2024-05-21 23:35:28] [INFO ] Computed 67 invariants in 3 ms
[2024-05-21 23:35:28] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-21 23:35:28] [INFO ] Invariant cache hit.
[2024-05-21 23:35:28] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 307/341 places, 249/305 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60944 ms. Remains : 307/341 places, 249/305 transitions.
[2024-05-21 23:35:28] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:35:28] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:35:28] [INFO ] Input system was already deterministic with 249 transitions.
[2024-05-21 23:35:28] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:35:28] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:35:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality7983832751299965210.gal : 2 ms
[2024-05-21 23:35:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality7040773476314289851.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/CTLCardinality7983832751299965210.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7040773476314289851.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:35:58] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:35:58] [INFO ] Applying decomposition
[2024-05-21 23:35:58] [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/graph6927584631143352598.txt' '-o' '/tmp/graph6927584631143352598.bin' '-w' '/tmp/graph6927584631143352598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6927584631143352598.bin' '-l' '-1' '-v' '-w' '/tmp/graph6927584631143352598.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:35:58] [INFO ] Decomposing Gal with order
[2024-05-21 23:35:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:35:58] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-21 23:35:58] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:35:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-21 23:35:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality4831081176103783141.gal : 4 ms
[2024-05-21 23:35:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality12723099819466535395.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/CTLCardinality4831081176103783141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12723099819466535395.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,4.24615e+17,1.78332,45136,3293,37,85121,582,701,140934,59,1696,0


Converting to forward existential form...Done !
original formula: (AG(EF((((E((i2.u4.p8==1) U (i16.u80.p315==1)) + ((i16.u106.p373==1)&&((i15.u78.p255==0)||(i17.u90.p324==1)))) + ((i11.u72.p232==1)||(i17...370
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (((E((i2.u4.p8==1) U (i16.u80.p315==1)) + ((i16.u106.p373==1)&&((i15.u78.p255==0...482
Reverse transition relation is NOT exact ! Due to transitions t7, t137, t156, t164, t168, t174, t206, t210, t231, t232, t234, t241, t242, t243, i0.i0.u79.t...868
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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 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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 313 transition count 278
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 313 transition count 278
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 305 transition count 270
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 305 transition count 270
Applied a total of 71 rules in 9 ms. Remains 305 /341 variables (removed 36) and now considering 270/305 (removed 35) transitions.
// Phase 1: matrix 270 rows 305 cols
[2024-05-21 23:36:28] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:36:29] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-21 23:36:29] [INFO ] Invariant cache hit.
[2024-05-21 23:36:29] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-05-21 23:36:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (OVERLAPS) 1/305 variables, 32/59 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:36:33] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:36:34] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:36:35] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:36:36] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 20/101 constraints. Problems are: Problem set: 7 solved, 262 unsolved
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:36:37] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:38] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:36:39] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:36:39] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:36:39] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:36:39] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:36:39] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:36:39] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 20/121 constraints. Problems are: Problem set: 7 solved, 262 unsolved
[2024-05-21 23:36:41] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:36:41] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:41] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:36:41] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:36:41] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:36:41] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:36:41] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:36:41] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:36:42] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:36:43] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 20/141 constraints. Problems are: Problem set: 16 solved, 253 unsolved
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:36:44] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:36:45] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:36:46] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 2 ms to minimize.
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 20/161 constraints. Problems are: Problem set: 20 solved, 249 unsolved
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 4 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 56 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:36:47] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:36:48] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:36:49] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 20/181 constraints. Problems are: Problem set: 24 solved, 245 unsolved
[2024-05-21 23:36:51] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 3 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:36:52] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:36:53] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
Problem TDEAD239 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 20/201 constraints. Problems are: Problem set: 26 solved, 243 unsolved
[2024-05-21 23:36:54] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:36:55] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:36:56] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 12/213 constraints. Problems are: Problem set: 26 solved, 243 unsolved
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 61 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:36:57] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:36:58] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:36:59] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
SMT process timed out in 30067ms, After SMT, problems are : Problem set: 26 solved, 243 unsolved
Search for dead transitions found 26 dead transitions in 30070ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 305/341 places, 244/305 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 302 transition count 244
Applied a total of 3 rules in 4 ms. Remains 302 /305 variables (removed 3) and now considering 244/244 (removed 0) transitions.
// Phase 1: matrix 244 rows 302 cols
[2024-05-21 23:36:59] [INFO ] Computed 67 invariants in 4 ms
[2024-05-21 23:36:59] [INFO ] Implicit Places using invariants in 122 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 269 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 302/341 places, 244/305 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30922 ms. Remains : 302/341 places, 244/305 transitions.
[2024-05-21 23:36:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:36:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:36:59] [INFO ] Input system was already deterministic with 244 transitions.
[2024-05-21 23:36:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:36:59] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:36:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality14692585719912036690.gal : 2 ms
[2024-05-21 23:36:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality9035158017503800649.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/CTLCardinality14692585719912036690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9035158017503800649.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:37:29] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:37:29] [INFO ] Applying decomposition
[2024-05-21 23:37:29] [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/graph6048968379765519458.txt' '-o' '/tmp/graph6048968379765519458.bin' '-w' '/tmp/graph6048968379765519458.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6048968379765519458.bin' '-l' '-1' '-v' '-w' '/tmp/graph6048968379765519458.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:37:30] [INFO ] Decomposing Gal with order
[2024-05-21 23:37:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:37:30] [INFO ] Removed a total of 64 redundant transitions.
[2024-05-21 23:37:30] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:37:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 23:37:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality4804371549559620995.gal : 2 ms
[2024-05-21 23:37:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality16190484882236624857.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/CTLCardinality4804371549559620995.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16190484882236624857.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,4.26525e+17,16.2718,364388,23242,49,670534,1272,675,990413,68,2964,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 313 transition count 278
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 313 transition count 278
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 304 transition count 269
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 304 transition count 269
Applied a total of 73 rules in 23 ms. Remains 304 /341 variables (removed 37) and now considering 269/305 (removed 36) transitions.
// Phase 1: matrix 269 rows 304 cols
[2024-05-21 23:38:00] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:38:00] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-21 23:38:00] [INFO ] Invariant cache hit.
[2024-05-21 23:38:00] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-21 23:38:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/304 variables, 32/59 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:38:05] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD243 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/81 constraints. Problems are: Problem set: 3 solved, 265 unsolved
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 61 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:38:06] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:38:07] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/101 constraints. Problems are: Problem set: 11 solved, 257 unsolved
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:38:08] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:38:09] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:38:10] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 20/121 constraints. Problems are: Problem set: 19 solved, 249 unsolved
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 3 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 22 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 20/141 constraints. Problems are: Problem set: 19 solved, 249 unsolved
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 20/161 constraints. Problems are: Problem set: 19 solved, 249 unsolved
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 2 ms to minimize.
Problem TDEAD222 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 20/181 constraints. Problems are: Problem set: 20 solved, 248 unsolved
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 3 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 2 ms to minimize.
Problem TDEAD216 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 20/201 constraints. Problems are: Problem set: 25 solved, 243 unsolved
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 4 ms to minimize.
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 72 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:38:28] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:38:29] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 20/221 constraints. Problems are: Problem set: 25 solved, 243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/573 variables, and 221 constraints, problems are : Problem set: 25 solved, 243 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 160/160 constraints]
Escalating to Integer solving :Problem set: 25 solved, 243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 27/27 constraints. Problems are: Problem set: 25 solved, 243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/27 constraints. Problems are: Problem set: 25 solved, 243 unsolved
At refinement iteration 2 (OVERLAPS) 1/304 variables, 32/59 constraints. Problems are: Problem set: 25 solved, 243 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 2/61 constraints. Problems are: Problem set: 25 solved, 243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 160/221 constraints. Problems are: Problem set: 25 solved, 243 unsolved
[2024-05-21 23:38:32] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:38:32] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:38:33] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:38:34] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:38:35] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:38:35] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:38:35] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:38:35] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:38:35] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:38:36] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/241 constraints. Problems are: Problem set: 25 solved, 243 unsolved
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:38:37] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:38:38] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:38:39] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
Problem TDEAD215 is UNSAT
[2024-05-21 23:38:39] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 14/255 constraints. Problems are: Problem set: 26 solved, 242 unsolved
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:38:41] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 3/258 constraints. Problems are: Problem set: 26 solved, 242 unsolved
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:38:44] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:38:44] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:38:44] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:38:44] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:38:44] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 66 places in 124 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 12/270 constraints. Problems are: Problem set: 26 solved, 242 unsolved
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 43 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 43 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 20/290 constraints. Problems are: Problem set: 26 solved, 242 unsolved
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 2/292 constraints. Problems are: Problem set: 26 solved, 242 unsolved
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 1/293 constraints. Problems are: Problem set: 26 solved, 242 unsolved
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 4/297 constraints. Problems are: Problem set: 26 solved, 242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/573 variables, and 297 constraints, problems are : Problem set: 26 solved, 242 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 0/268 constraints, Known Traps: 236/236 constraints]
After SMT, in 60068ms problems are : Problem set: 26 solved, 242 unsolved
Search for dead transitions found 26 dead transitions in 60073ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 304/341 places, 243/305 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 301 transition count 243
Applied a total of 3 rules in 9 ms. Remains 301 /304 variables (removed 3) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 301 cols
[2024-05-21 23:39:00] [INFO ] Computed 67 invariants in 2 ms
[2024-05-21 23:39:00] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 23:39:00] [INFO ] Invariant cache hit.
[2024-05-21 23:39:00] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 301/341 places, 243/305 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60885 ms. Remains : 301/341 places, 243/305 transitions.
[2024-05-21 23:39:00] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:39:01] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:39:01] [INFO ] Input system was already deterministic with 243 transitions.
[2024-05-21 23:39:01] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:39:01] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:39:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality8430758354655588845.gal : 2 ms
[2024-05-21 23:39:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality10093630501389517749.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/CTLCardinality8430758354655588845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10093630501389517749.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:39:31] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:39:31] [INFO ] Applying decomposition
[2024-05-21 23:39:31] [INFO ] Flatten gal took : 13 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/graph7836236616910825019.txt' '-o' '/tmp/graph7836236616910825019.bin' '-w' '/tmp/graph7836236616910825019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7836236616910825019.bin' '-l' '-1' '-v' '-w' '/tmp/graph7836236616910825019.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:39:31] [INFO ] Decomposing Gal with order
[2024-05-21 23:39:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:39:31] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-21 23:39:31] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:39:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-21 23:39:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality1022536948114681869.gal : 2 ms
[2024-05-21 23:39:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality10339389019874286213.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/CTLCardinality1022536948114681869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10339389019874286213.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,4.27678e+17,29.9291,643088,107373,29,1.16505e+06,451,633,1.99393e+06,49,1199,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 315 transition count 280
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 315 transition count 280
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 308 transition count 273
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 308 transition count 273
Applied a total of 65 rules in 20 ms. Remains 308 /341 variables (removed 33) and now considering 273/305 (removed 32) transitions.
// Phase 1: matrix 273 rows 308 cols
[2024-05-21 23:40:01] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 23:40:01] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 23:40:01] [INFO ] Invariant cache hit.
[2024-05-21 23:40:01] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-05-21 23:40:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (OVERLAPS) 1/308 variables, 32/59 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:40:05] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 70 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:40:06] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:40:07] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:40:07] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:07] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:07] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:40:07] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:40:07] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-21 23:40:07] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:40:07] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:40:08] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:40:08] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:40:08] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:08] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:40:08] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:40:08] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:08] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:40:08] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:40:08] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:40:08] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:08] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:09] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:09] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:09] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:09] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:09] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:40:09] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:09] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-21 23:40:09] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:40:09] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:40:10] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:10] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:40:10] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:40:10] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:10] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:10] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:40:10] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:40:10] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:40:10] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:40:10] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:40:11] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:11] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:40:11] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:11] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:40:11] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:11] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:40:11] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:11] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
Problem TDEAD240 is UNSAT
Problem TDEAD252 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 20/121 constraints. Problems are: Problem set: 2 solved, 270 unsolved
[2024-05-21 23:40:13] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:13] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:40:13] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:40:13] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:40:13] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:40:13] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:40:13] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:40:14] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:40:14] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:40:14] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:40:14] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:40:14] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:14] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:14] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:40:14] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:40:14] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:40:15] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:15] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:15] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:15] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
Problem TDEAD235 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 20/141 constraints. Problems are: Problem set: 5 solved, 267 unsolved
[2024-05-21 23:40:15] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:40:15] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:15] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:40:16] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:16] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:40:16] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:40:16] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:40:16] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:40:16] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:16] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:40:16] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:40:16] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:16] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:17] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:17] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:40:17] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:40:17] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:17] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:40:17] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:40:17] [INFO ] Deduced a trap composed of 63 places in 87 ms of which 2 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 20/161 constraints. Problems are: Problem set: 14 solved, 258 unsolved
[2024-05-21 23:40:18] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:40:18] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:18] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:18] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:40:18] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:40:18] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:40:18] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:40:18] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:40:19] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:40:20] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:40:20] [INFO ] Deduced a trap composed of 71 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:40:20] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:20] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 3 ms to minimize.
Problem TDEAD212 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 20/181 constraints. Problems are: Problem set: 20 solved, 252 unsolved
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:40:22] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:40:23] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 20/201 constraints. Problems are: Problem set: 25 solved, 247 unsolved
[2024-05-21 23:40:24] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:25] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:26] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 3 ms to minimize.
[2024-05-21 23:40:27] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 20/221 constraints. Problems are: Problem set: 25 solved, 247 unsolved
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:40:28] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:40:29] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:40:30] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
Problem TDEAD216 is UNSAT
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:40:31] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 20/241 constraints. Problems are: Problem set: 26 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/581 variables, and 241 constraints, problems are : Problem set: 26 solved, 246 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/308 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 180/180 constraints]
Escalating to Integer solving :Problem set: 26 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 27/27 constraints. Problems are: Problem set: 26 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 0/27 constraints. Problems are: Problem set: 26 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1/308 variables, 32/59 constraints. Problems are: Problem set: 26 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 2/61 constraints. Problems are: Problem set: 26 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 180/241 constraints. Problems are: Problem set: 26 solved, 246 unsolved
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:40:33] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:40:34] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:40:35] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 20/261 constraints. Problems are: Problem set: 26 solved, 246 unsolved
[2024-05-21 23:40:36] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 56 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 65 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:40:37] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 3 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:38] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 45 places in 88 ms of which 3 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:39] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 20/281 constraints. Problems are: Problem set: 26 solved, 246 unsolved
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:40] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 5 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:41] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:40:42] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 20/301 constraints. Problems are: Problem set: 26 solved, 246 unsolved
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:43] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:40:44] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:40:45] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:40:46] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 20/321 constraints. Problems are: Problem set: 26 solved, 246 unsolved
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 3 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 3 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 20/341 constraints. Problems are: Problem set: 26 solved, 246 unsolved
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 20/361 constraints. Problems are: Problem set: 26 solved, 246 unsolved
[2024-05-21 23:40:57] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:40:58] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:40:59] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
SMT process timed out in 60138ms, After SMT, problems are : Problem set: 26 solved, 246 unsolved
Search for dead transitions found 26 dead transitions in 60142ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 308/341 places, 247/305 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 305 transition count 247
Applied a total of 3 rules in 4 ms. Remains 305 /308 variables (removed 3) and now considering 247/247 (removed 0) transitions.
// Phase 1: matrix 247 rows 305 cols
[2024-05-21 23:41:01] [INFO ] Computed 67 invariants in 2 ms
[2024-05-21 23:41:02] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-21 23:41:02] [INFO ] Invariant cache hit.
[2024-05-21 23:41:02] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 305/341 places, 247/305 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61018 ms. Remains : 305/341 places, 247/305 transitions.
[2024-05-21 23:41:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:41:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:41:02] [INFO ] Input system was already deterministic with 247 transitions.
[2024-05-21 23:41:02] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:41:02] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:41:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality6744379515288574036.gal : 2 ms
[2024-05-21 23:41:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality10390185028495045913.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/CTLCardinality6744379515288574036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10390185028495045913.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:41:32] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:41:32] [INFO ] Applying decomposition
[2024-05-21 23:41:32] [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/graph10422639058156856508.txt' '-o' '/tmp/graph10422639058156856508.bin' '-w' '/tmp/graph10422639058156856508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10422639058156856508.bin' '-l' '-1' '-v' '-w' '/tmp/graph10422639058156856508.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:41:32] [INFO ] Decomposing Gal with order
[2024-05-21 23:41:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:41:32] [INFO ] Removed a total of 65 redundant transitions.
[2024-05-21 23:41:32] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:41:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-21 23:41:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality3484908734270675514.gal : 4 ms
[2024-05-21 23:41:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality13680270027446879682.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/CTLCardinality3484908734270675514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13680270027446879682.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,4.46002e+17,3.75382,107860,7643,46,194183,738,701,268196,58,2484,0


Converting to forward existential form...Done !
original formula: EF((AX((((i7.i0.u25.p76==0)&&(i8.u107.p377==1)) * ((i4.i1.u12.p35==0) * AF((i17.u81.p266==1))))) + (EX(((i17.u84.p279==0)&&(i17.u84.p306=...186
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!((((i7.i0.u25.p76==0)&&(i8.u107.p377==1)) * ((i4.i1.u12.p35==0) * !(EG(!((i17.u81.p26...281
Reverse transition relation is NOT exact ! Due to transitions t154, t166, t178, t204, t208, t229, t232, t239, t240, t241, i0.t111, i0.i0.u51.t114, i0.i0.u7...878
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Graph (trivial) has 166 edges and 341 vertex of which 7 / 341 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 735 edges and 335 vertex of which 333 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 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 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 332 transition count 251
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 287 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 286 transition count 250
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 94 place count 286 transition count 190
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 129 rules applied. Total rules applied 223 place count 217 transition count 190
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 242 place count 198 transition count 171
Iterating global reduction 3 with 19 rules applied. Total rules applied 261 place count 198 transition count 171
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 261 place count 198 transition count 168
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 267 place count 195 transition count 168
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 404 place count 125 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 405 place count 124 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 406 place count 123 transition count 100
Applied a total of 406 rules in 25 ms. Remains 123 /341 variables (removed 218) and now considering 100/305 (removed 205) transitions.
// Phase 1: matrix 100 rows 123 cols
[2024-05-21 23:42:02] [INFO ] Computed 48 invariants in 2 ms
[2024-05-21 23:42:02] [INFO ] Implicit Places using invariants in 108 ms returned [0, 1, 11, 38, 39, 40, 41, 42, 43]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 109 ms to find 9 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 114/341 places, 100/305 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 136 ms. Remains : 114/341 places, 100/305 transitions.
[2024-05-21 23:42:02] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:42:02] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:42:02] [INFO ] Input system was already deterministic with 100 transitions.
[2024-05-21 23:42:02] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:42:02] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:42:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality15377041801800448813.gal : 1 ms
[2024-05-21 23:42:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality11509027883137485239.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/CTLCardinality15377041801800448813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11509027883137485239.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,7.41655e+06,1.5883,42648,2,11182,5,193938,6,0,556,169734,0


Converting to forward existential form...Done !
original formula: EG(EF((((p34==0) * E((p199==1) U (p72==1))) * ((p376==1)||(p278==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((p34==0) * E((p199==1) U (p72==1))) * ((p376==1)||(p278==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t17, t19, t21, t23, t24, t25, t38, t39, t40, t41, t42, t59, t70, t71, t72, t81, t82, ...285
Detected timeout of ITS tools.
[2024-05-21 23:42:32] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:42:32] [INFO ] Applying decomposition
[2024-05-21 23:42:32] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1086369969957885384.txt' '-o' '/tmp/graph1086369969957885384.bin' '-w' '/tmp/graph1086369969957885384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1086369969957885384.bin' '-l' '-1' '-v' '-w' '/tmp/graph1086369969957885384.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:42:32] [INFO ] Decomposing Gal with order
[2024-05-21 23:42:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:42:32] [INFO ] Removed a total of 91 redundant transitions.
[2024-05-21 23:42:32] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:42:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 15 ms.
[2024-05-21 23:42:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality8174804934984073980.gal : 2 ms
[2024-05-21 23:42:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality7721951432852729563.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/CTLCardinality8174804934984073980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7721951432852729563.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,7.41655e+06,9.40911,140876,1257,267,167884,9972,410,554846,129,67621,0


Converting to forward existential form...Done !
original formula: EG(EF((((i0.u1.p34==0) * E((i0.u13.p199==1) U (i1.u4.p72==1))) * ((i4.u33.p376==1)||(i6.u26.p278==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((i0.u1.p34==0) * E((i0.u13.p199==1) U (i1.u4.p72==1))) * ((i4.u33.p376==1)||(i6.u26.p278==...171
Reverse transition relation is NOT exact ! Due to transitions t23, t24, t25, t39, t40, t41, t42, t70, t71, t72, t84, t85, t86, t87, t88, t90, i0.u13.t19, i...325
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 7
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 312 transition count 277
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 312 transition count 277
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 303 transition count 268
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 303 transition count 268
Applied a total of 75 rules in 21 ms. Remains 303 /341 variables (removed 38) and now considering 268/305 (removed 37) transitions.
// Phase 1: matrix 268 rows 303 cols
[2024-05-21 23:43:02] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 23:43:03] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 23:43:03] [INFO ] Invariant cache hit.
[2024-05-21 23:43:03] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-05-21 23:43:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/303 variables, 33/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-21 23:43:06] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 5 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 56 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:43:07] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-21 23:43:08] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:43:09] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 4 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:43:10] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 20/101 constraints. Problems are: Problem set: 18 solved, 249 unsolved
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:43:11] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:43:12] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:43:13] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 20/121 constraints. Problems are: Problem set: 18 solved, 249 unsolved
[2024-05-21 23:43:14] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:43:14] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:43:15] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 3 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:43:16] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 20/141 constraints. Problems are: Problem set: 18 solved, 249 unsolved
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:43:17] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:43:18] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 20/161 constraints. Problems are: Problem set: 20 solved, 247 unsolved
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:43:19] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:43:20] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:43:21] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:43:21] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:43:21] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:43:22] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 20/181 constraints. Problems are: Problem set: 25 solved, 242 unsolved
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:43:25] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 4 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:43:26] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:43:27] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 13/194 constraints. Problems are: Problem set: 25 solved, 242 unsolved
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:43:28] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:43:29] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 34 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:43:30] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 2 ms to minimize.
Problem TDEAD215 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 13/207 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:43:31] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:43:32] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:43:33] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 303/571 variables, and 216 constraints, problems are : Problem set: 26 solved, 241 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/303 constraints, PredecessorRefiner: 267/267 constraints, Known Traps: 155/155 constraints]
Escalating to Integer solving :Problem set: 26 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 27/27 constraints. Problems are: Problem set: 26 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/27 constraints. Problems are: Problem set: 26 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/303 variables, 33/60 constraints. Problems are: Problem set: 26 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 1/61 constraints. Problems are: Problem set: 26 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 155/216 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:43:35] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:43:36] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:43:37] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 7/223 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:43:38] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:43:39] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 6/229 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:43:40] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:43:41] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 5/234 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:43:43] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:43:43] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 2/236 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:43:45] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:43:45] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:43:46] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:43:46] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 4/240 constraints. Problems are: Problem set: 26 solved, 241 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/240 constraints. Problems are: Problem set: 26 solved, 241 unsolved
At refinement iteration 11 (OVERLAPS) 268/571 variables, 303/543 constraints. Problems are: Problem set: 26 solved, 241 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/571 variables, 241/784 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:43:57] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:43:57] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:43:58] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:43:58] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:43:58] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:43:58] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:43:58] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:43:59] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:43:59] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:43:59] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/571 variables, 20/804 constraints. Problems are: Problem set: 26 solved, 241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/571 variables, and 804 constraints, problems are : Problem set: 26 solved, 241 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 241/267 constraints, Known Traps: 199/199 constraints]
After SMT, in 60075ms problems are : Problem set: 26 solved, 241 unsolved
Search for dead transitions found 26 dead transitions in 60079ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 303/341 places, 242/305 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 300 transition count 242
Applied a total of 3 rules in 11 ms. Remains 300 /303 variables (removed 3) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 300 cols
[2024-05-21 23:44:03] [INFO ] Computed 67 invariants in 4 ms
[2024-05-21 23:44:03] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-21 23:44:03] [INFO ] Invariant cache hit.
[2024-05-21 23:44:03] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 300/341 places, 242/305 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60896 ms. Remains : 300/341 places, 242/305 transitions.
[2024-05-21 23:44:03] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:44:03] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:44:03] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-21 23:44:03] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:44:03] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:44:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality6095560243622730824.gal : 2 ms
[2024-05-21 23:44:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality17726263233466659196.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/CTLCardinality6095560243622730824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17726263233466659196.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:44:33] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:44:33] [INFO ] Applying decomposition
[2024-05-21 23:44:33] [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/graph12145608852163757535.txt' '-o' '/tmp/graph12145608852163757535.bin' '-w' '/tmp/graph12145608852163757535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12145608852163757535.bin' '-l' '-1' '-v' '-w' '/tmp/graph12145608852163757535.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:44:33] [INFO ] Decomposing Gal with order
[2024-05-21 23:44:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:44:33] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-21 23:44:33] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:44:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:44:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality6629777457239726348.gal : 5 ms
[2024-05-21 23:44:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality16001204769995660048.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/CTLCardinality6629777457239726348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16001204769995660048.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,4.23627e+17,2.50165,67220,8228,46,120611,792,648,220090,65,1642,0


Converting to forward existential form...Done !
original formula: AG((EG(EF((((i7.u36.p112==1)||(i9.u88.p336==0))||(i13.u55.p166==1)))) + EX(((i0.i0.u0.p0==0) * EG(((i3.u63.p191==0)||(i4.u13.p34==1))))))...156
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX(((i0.i0.u0.p0==0) * EG(((i3.u63.p191==0)||(i4.u13.p34==1))))))) * !(EG(E(TRUE U (((i7....219
Reverse transition relation is NOT exact ! Due to transitions t7, t131, t149, t161, t167, t199, t203, t224, t225, t227, t234, t235, t236, i0.i0.u77.t53, i0...801
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 313 transition count 278
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 313 transition count 278
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 64 place count 304 transition count 269
Iterating global reduction 1 with 9 rules applied. Total rules applied 73 place count 304 transition count 269
Applied a total of 73 rules in 19 ms. Remains 304 /341 variables (removed 37) and now considering 269/305 (removed 36) transitions.
// Phase 1: matrix 269 rows 304 cols
[2024-05-21 23:45:04] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:45:04] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-21 23:45:04] [INFO ] Invariant cache hit.
[2024-05-21 23:45:04] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-21 23:45:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (OVERLAPS) 1/304 variables, 33/60 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 58 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:45:08] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:45:09] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:45:10] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:10] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:45:10] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:45:10] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-21 23:45:10] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:10] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:45:10] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:45:10] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:45:10] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:45:10] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 46 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:45:11] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:45:12] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:12] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:45:12] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:45:12] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:45:12] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/101 constraints. Problems are: Problem set: 6 solved, 262 unsolved
[2024-05-21 23:45:12] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:45:12] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:45:14] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:45:15] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 20/121 constraints. Problems are: Problem set: 16 solved, 252 unsolved
[2024-05-21 23:45:16] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:45:17] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:45:18] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 2 ms to minimize.
Problem TDEAD215 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 20/141 constraints. Problems are: Problem set: 22 solved, 246 unsolved
[2024-05-21 23:45:20] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:45:20] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:45:20] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:45:20] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:45:20] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:45:21] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 3 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 20/161 constraints. Problems are: Problem set: 22 solved, 246 unsolved
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:22] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:45:23] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:45:24] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:45:25] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:45:25] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:45:25] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 20/181 constraints. Problems are: Problem set: 22 solved, 246 unsolved
[2024-05-21 23:45:27] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:45:27] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:45:28] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:45:29] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 20/201 constraints. Problems are: Problem set: 22 solved, 246 unsolved
[2024-05-21 23:45:30] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:45:31] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:45:32] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
Problem TDEAD230 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 20/221 constraints. Problems are: Problem set: 23 solved, 245 unsolved
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:45:33] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:45:34] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/573 variables, and 228 constraints, problems are : Problem set: 23 solved, 245 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 0/304 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 167/167 constraints]
Escalating to Integer solving :Problem set: 23 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 27/27 constraints. Problems are: Problem set: 23 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/27 constraints. Problems are: Problem set: 23 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/304 variables, 33/60 constraints. Problems are: Problem set: 23 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/304 variables, 1/61 constraints. Problems are: Problem set: 23 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/304 variables, 167/228 constraints. Problems are: Problem set: 23 solved, 245 unsolved
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:45:36] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 34 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:45:37] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:45:38] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:45:39] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 2 ms to minimize.
Problem TDEAD208 is UNSAT
Problem TDEAD216 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 20/248 constraints. Problems are: Problem set: 25 solved, 243 unsolved
[2024-05-21 23:45:40] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:45:40] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:45:41] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:45:42] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
Problem TDEAD221 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 12/260 constraints. Problems are: Problem set: 26 solved, 242 unsolved
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:45:44] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:45:45] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:45:46] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:45:47] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:45:47] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 19/279 constraints. Problems are: Problem set: 26 solved, 242 unsolved
[2024-05-21 23:45:49] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 2 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:45:50] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 8/287 constraints. Problems are: Problem set: 26 solved, 242 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/287 constraints. Problems are: Problem set: 26 solved, 242 unsolved
At refinement iteration 10 (OVERLAPS) 269/573 variables, 304/591 constraints. Problems are: Problem set: 26 solved, 242 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/573 variables, 242/833 constraints. Problems are: Problem set: 26 solved, 242 unsolved
[2024-05-21 23:46:00] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:46:02] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:46:03] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/573 variables, and 836 constraints, problems are : Problem set: 26 solved, 242 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 304/304 constraints, PredecessorRefiner: 242/268 constraints, Known Traps: 229/229 constraints]
After SMT, in 60086ms problems are : Problem set: 26 solved, 242 unsolved
Search for dead transitions found 26 dead transitions in 60094ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 304/341 places, 243/305 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 301 transition count 243
Applied a total of 3 rules in 8 ms. Remains 301 /304 variables (removed 3) and now considering 243/243 (removed 0) transitions.
// Phase 1: matrix 243 rows 301 cols
[2024-05-21 23:46:04] [INFO ] Computed 67 invariants in 1 ms
[2024-05-21 23:46:04] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-21 23:46:04] [INFO ] Invariant cache hit.
[2024-05-21 23:46:05] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 301/341 places, 243/305 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61057 ms. Remains : 301/341 places, 243/305 transitions.
[2024-05-21 23:46:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:46:05] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:46:05] [INFO ] Input system was already deterministic with 243 transitions.
[2024-05-21 23:46:05] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:46:05] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:46:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality7600574712703113926.gal : 2 ms
[2024-05-21 23:46:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality4816758640143749309.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/CTLCardinality7600574712703113926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4816758640143749309.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:46:35] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:46:35] [INFO ] Applying decomposition
[2024-05-21 23:46:35] [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/graph4416029039031072634.txt' '-o' '/tmp/graph4416029039031072634.bin' '-w' '/tmp/graph4416029039031072634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4416029039031072634.bin' '-l' '-1' '-v' '-w' '/tmp/graph4416029039031072634.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:46:35] [INFO ] Decomposing Gal with order
[2024-05-21 23:46:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:46:35] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-21 23:46:35] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:46:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-21 23:46:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality66818648094205268.gal : 5 ms
[2024-05-21 23:46:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality8621675458432243373.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/CTLCardinality66818648094205268.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8621675458432243373.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 -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 341/341 places, 305/305 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 305
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 312 transition count 277
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 312 transition count 277
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 303 transition count 268
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 303 transition count 268
Applied a total of 75 rules in 16 ms. Remains 303 /341 variables (removed 38) and now considering 268/305 (removed 37) transitions.
// Phase 1: matrix 268 rows 303 cols
[2024-05-21 23:47:05] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 23:47:05] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-21 23:47:05] [INFO ] Invariant cache hit.
[2024-05-21 23:47:05] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 267 sub problems to find dead transitions.
[2024-05-21 23:47:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 2 (OVERLAPS) 1/303 variables, 33/60 constraints. Problems are: Problem set: 0 solved, 267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:47:09] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:47:10] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 267 unsolved
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:11] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:47:12] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:47:12] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:47:12] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:47:12] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 3 ms to minimize.
[2024-05-21 23:47:12] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:47:12] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:47:12] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:47:12] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:47:13] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:47:13] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:47:13] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:47:13] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:47:13] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:47:13] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:47:13] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:13] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:14] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD247 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 20/101 constraints. Problems are: Problem set: 18 solved, 249 unsolved
[2024-05-21 23:47:14] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:47:14] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:47:14] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:14] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:47:14] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:14] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 3 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:47:15] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:47:16] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 20/121 constraints. Problems are: Problem set: 18 solved, 249 unsolved
[2024-05-21 23:47:17] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:47:18] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:47:19] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 20/141 constraints. Problems are: Problem set: 18 solved, 249 unsolved
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:47:20] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:47:21] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 4 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:47:22] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 61 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
Problem TDEAD220 is UNSAT
Problem TDEAD232 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 20/161 constraints. Problems are: Problem set: 20 solved, 247 unsolved
[2024-05-21 23:47:23] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:24] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:47:25] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:47:26] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 2 ms to minimize.
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 20/181 constraints. Problems are: Problem set: 25 solved, 242 unsolved
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 13/194 constraints. Problems are: Problem set: 25 solved, 242 unsolved
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 3 ms to minimize.
Problem TDEAD215 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 13/207 constraints. Problems are: Problem set: 26 solved, 241 unsolved
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
SMT process timed out in 30098ms, After SMT, problems are : Problem set: 26 solved, 241 unsolved
Search for dead transitions found 26 dead transitions in 30102ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 303/341 places, 242/305 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 300 transition count 242
Applied a total of 3 rules in 4 ms. Remains 300 /303 variables (removed 3) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 300 cols
[2024-05-21 23:47:36] [INFO ] Computed 67 invariants in 6 ms
[2024-05-21 23:47:36] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-21 23:47:36] [INFO ] Invariant cache hit.
[2024-05-21 23:47:36] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 300/341 places, 242/305 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31058 ms. Remains : 300/341 places, 242/305 transitions.
[2024-05-21 23:47:36] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:47:36] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:47:36] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-21 23:47:36] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:47:36] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:47:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality17414173627852458660.gal : 2 ms
[2024-05-21 23:47:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality12889685343549726845.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/CTLCardinality17414173627852458660.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12889685343549726845.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:48:06] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:48:06] [INFO ] Applying decomposition
[2024-05-21 23:48:06] [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/graph9462943138806221281.txt' '-o' '/tmp/graph9462943138806221281.bin' '-w' '/tmp/graph9462943138806221281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9462943138806221281.bin' '-l' '-1' '-v' '-w' '/tmp/graph9462943138806221281.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:48:06] [INFO ] Decomposing Gal with order
[2024-05-21 23:48:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:48:06] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-21 23:48:06] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:48:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-21 23:48:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality6774956483156847808.gal : 4 ms
[2024-05-21 23:48:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality6483597189881625976.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/CTLCardinality6774956483156847808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6483597189881625976.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,4.23627e+17,1.72735,47676,3930,54,88804,1273,645,123023,68,2792,0


Converting to forward existential form...Done !
original formula: E((i10.i0.u1.p2==1) U EX(AG(((i8.u28.p79==0)||(i8.u29.p85==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,(i10.i0.u1.p2==1))) * !(E(TRUE U !(((i8.u28.p79==0)||(i8.u29.p85==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t107, t131, t149, t161, t167, t199, t203, t225, t227, t234, t235, t236, i0.u51.t110, i1.u...795
(forward)formula 0,0,5.92707,172812,1,0,400056,1273,4078,474498,327,2792,936846
FORMULA BusinessProcesses-PT-07-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-21 23:48:12] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:48:12] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:48:12] [INFO ] Applying decomposition
[2024-05-21 23:48:12] [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/graph4398505221290069967.txt' '-o' '/tmp/graph4398505221290069967.bin' '-w' '/tmp/graph4398505221290069967.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4398505221290069967.bin' '-l' '-1' '-v' '-w' '/tmp/graph4398505221290069967.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:48:12] [INFO ] Decomposing Gal with order
[2024-05-21 23:48:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:48:12] [INFO ] Removed a total of 182 redundant transitions.
[2024-05-21 23:48:12] [INFO ] Flatten gal took : 34 ms
[2024-05-21 23:48:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:48:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality16467552442253837655.gal : 4 ms
[2024-05-21 23:48:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality15182788377555738166.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/CTLCardinality16467552442253837655.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15182788377555738166.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 9 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,5.9563e+17,13.3904,232052,10329,41,381315,423,954,856323,61,1143,0


Converting to forward existential form...Done !
original formula: E((!((E(((((i10.u16.p44==0)||(i12.i2.u88.p263==1))&&(i4.u22.p58==1)) * E(((i5.i0.u40.p112==0)||(i2.i1.u66.p179==1)) U ((i14.i1.u118.p362=...847
=> equivalent forward existential formula: [((FwdU(Init,(!((E(((((i10.u16.p44==0)||(i12.i2.u88.p263==1))&&(i4.u22.p58==1)) * E(((i5.i0.u40.p112==0)||(i2.i1...1277
Reverse transition relation is NOT exact ! Due to transitions t8, t134, t158, t175, t198, t204, t236, t240, t298, i0.i0.u49.t145, i0.i1.u47.t149, i1.u43.t1...1084
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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
Detected timeout of ITS tools.
[2024-05-22 00:15:18] [INFO ] Applying decomposition
[2024-05-22 00:15:18] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:15:18] [INFO ] Decomposing Gal with order
[2024-05-22 00:15:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:15:19] [INFO ] Removed a total of 93 redundant transitions.
[2024-05-22 00:15:19] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:15:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 00:15:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality16798840278142189394.gal : 5 ms
[2024-05-22 00:15:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality12255437516415890471.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/CTLCardinality16798840278142189394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12255437516415890471.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 9 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 00:22:23] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:22:23] [INFO ] Input system was already deterministic with 305 transitions.
[2024-05-22 00:22:23] [INFO ] Transformed 341 places.
[2024-05-22 00:22:23] [INFO ] Transformed 305 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 00:22:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality742963956739521547.gal : 7 ms
[2024-05-22 00:22:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality8910875676848466946.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/CTLCardinality742963956739521547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8910875676848466946.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...327
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-07"
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-07, 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-171620399600497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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