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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 159K 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-16-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-16-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716336548798

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 00:09:10] [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-22 00:09:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:09:10] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-22 00:09:10] [INFO ] Transformed 638 places.
[2024-05-22 00:09:10] [INFO ] Transformed 578 transitions.
[2024-05-22 00:09:10] [INFO ] Found NUPN structural information;
[2024-05-22 00:09:10] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Deduced a syphon composed of 8 places in 12 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 134 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 627 transition count 570
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 71 place count 559 transition count 502
Iterating global reduction 1 with 68 rules applied. Total rules applied 139 place count 559 transition count 502
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 173 place count 525 transition count 468
Iterating global reduction 1 with 34 rules applied. Total rules applied 207 place count 525 transition count 468
Applied a total of 207 rules in 111 ms. Remains 525 /630 variables (removed 105) and now considering 468/570 (removed 102) transitions.
// Phase 1: matrix 468 rows 525 cols
[2024-05-22 00:09:10] [INFO ] Computed 97 invariants in 26 ms
[2024-05-22 00:09:11] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-22 00:09:11] [INFO ] Invariant cache hit.
[2024-05-22 00:09:11] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
Running 467 sub problems to find dead transitions.
[2024-05-22 00:09:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/522 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/522 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 2 (OVERLAPS) 3/525 variables, 58/95 constraints. Problems are: Problem set: 0 solved, 467 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 115 places in 169 ms of which 24 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 5 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 119 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 120 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 118 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 121 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 114 places in 155 ms of which 4 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 119 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 113 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 112 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 110 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 111 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 104 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 114 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 116 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 116 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 111 places in 162 ms of which 4 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 4 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 113 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 110 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 114 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 112 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 114 places in 112 ms of which 8 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 114 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 117 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 111 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:09:27] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-22 00:09:27] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:09:27] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:09:27] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:09:27] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:09:27] [INFO ] Deduced a trap composed of 113 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:09:28] [INFO ] Deduced a trap composed of 115 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:09:28] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:09:28] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:09:28] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:09:28] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:09:28] [INFO ] Deduced a trap composed of 113 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:09:28] [INFO ] Deduced a trap composed of 117 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:09:29] [INFO ] Deduced a trap composed of 111 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:09:29] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 4 ms to minimize.
[2024-05-22 00:09:29] [INFO ] Deduced a trap composed of 114 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:09:29] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:09:29] [INFO ] Deduced a trap composed of 99 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:09:29] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:09:30] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:09:30] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 115 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 104 places in 166 ms of which 2 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 112 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 116 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 103 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 107 places in 166 ms of which 4 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 124 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 114 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 113 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 116 places in 183 ms of which 3 ms to minimize.
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 109 places in 146 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 467 unsolved
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 112 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 110 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 113 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 115 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:09:40] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:09:40] [INFO ] Deduced a trap composed of 121 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:09:40] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:09:40] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:09:40] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 3 ms to minimize.
Problem TDEAD368 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD413 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 20/197 constraints. Problems are: Problem set: 3 solved, 464 unsolved
[2024-05-22 00:09:41] [INFO ] Deduced a trap composed of 113 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:09:41] [INFO ] Deduced a trap composed of 102 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:09:41] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:09:41] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:09:41] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:09:41] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:09:42] [INFO ] Deduced a trap composed of 117 places in 144 ms of which 3 ms to minimize.
SMT process timed out in 30353ms, After SMT, problems are : Problem set: 3 solved, 464 unsolved
Search for dead transitions found 3 dead transitions in 30380ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 525/630 places, 465/570 transitions.
Applied a total of 0 rules in 22 ms. Remains 525 /525 variables (removed 0) and now considering 465/465 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31652 ms. Remains : 525/630 places, 465/570 transitions.
Support contains 134 out of 525 places after structural reductions.
[2024-05-22 00:09:42] [INFO ] Flatten gal took : 83 ms
[2024-05-22 00:09:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-16-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:09:42] [INFO ] Flatten gal took : 56 ms
[2024-05-22 00:09:42] [INFO ] Input system was already deterministic with 465 transitions.
Support contains 117 out of 525 places (down from 134) after GAL structural reductions.
RANDOM walk for 40000 steps (263 resets) in 1810 ms. (22 steps per ms) remains 37/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
// Phase 1: matrix 465 rows 525 cols
[2024-05-22 00:09:43] [INFO ] Computed 97 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 290/352 variables, 42/42 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 53/405 variables, 16/58 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 110/515 variables, 38/96 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 1/516 variables, 1/97 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 459/975 variables, 516/613 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/975 variables, 0/613 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 13/988 variables, 7/620 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/988 variables, 0/620 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 2/990 variables, 2/622 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/990 variables, 0/622 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 0/990 variables, 0/622 constraints. Problems are: Problem set: 1 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 990/990 variables, and 622 constraints, problems are : Problem set: 1 solved, 35 unsolved in 3429 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 35 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (OVERLAPS) 233/293 variables, 28/28 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 95 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 98 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 94 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 98 places in 73 ms of which 2 ms to minimize.
Problem AtomicPropp23 is UNSAT
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 96 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 2 ms to minimize.
Problem AtomicPropp23 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 20/48 constraints. Problems are: Problem set: 3 solved, 33 unsolved
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 94 places in 85 ms of which 3 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 11/59 constraints. Problems are: Problem set: 3 solved, 33 unsolved
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 100 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 3/62 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/293 variables, 0/62 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 112/405 variables, 30/92 constraints. Problems are: Problem set: 3 solved, 33 unsolved
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 41 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 3 ms to minimize.
SMT process timed out in 8522ms, After SMT, problems are : Problem set: 3 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 54 out of 525 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 525/525 places, 465/465 transitions.
Graph (trivial) has 211 edges and 525 vertex of which 6 / 525 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1144 edges and 520 vertex of which 517 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 517 transition count 405
Reduce places removed 52 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 59 rules applied. Total rules applied 113 place count 465 transition count 398
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 120 place count 458 transition count 398
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 120 place count 458 transition count 322
Deduced a syphon composed of 76 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 282 place count 372 transition count 322
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 299 place count 355 transition count 305
Iterating global reduction 3 with 17 rules applied. Total rules applied 316 place count 355 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 316 place count 355 transition count 303
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 320 place count 353 transition count 303
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 223 rules applied. Total rules applied 543 place count 240 transition count 193
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 545 place count 239 transition count 197
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 547 place count 239 transition count 197
Applied a total of 547 rules in 131 ms. Remains 239 /525 variables (removed 286) and now considering 197/465 (removed 268) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 239/525 places, 197/465 transitions.
RANDOM walk for 40000 steps (1704 resets) in 1123 ms. (35 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (27 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (36 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (28 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (34 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (29 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (29 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (31 resets) in 37 ms. (105 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (27 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (28 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (24 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (28 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (25 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (28 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (30 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (30 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (29 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (25 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (29 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (29 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (27 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (28 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (26 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (27 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (29 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 384195 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :20 out of 32
Probabilistic random walk after 384195 steps, saw 73989 distinct states, run finished after 3008 ms. (steps per millisecond=127 ) properties seen :20
// Phase 1: matrix 197 rows 239 cols
[2024-05-22 00:09:55] [INFO ] Computed 82 invariants in 2 ms
[2024-05-22 00:09:55] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 77/96 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 89/185 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 49/234 variables, 23/80 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 2/236 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 197/433 variables, 236/318 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/433 variables, 10/328 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/433 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 3/436 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/436 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 331 constraints, problems are : Problem set: 0 solved, 12 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 77/96 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 89/185 variables, 43/60 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 49/234 variables, 23/83 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 2/236 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 197/433 variables, 236/332 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/433 variables, 10/342 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/433 variables, 12/354 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/433 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/433 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 3/436 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/436 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/436 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 0/436 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 360 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2405 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 239/239 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 17/17 constraints]
After SMT, in 2845ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 6 properties in 1800 ms.
Support contains 9 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 239 transition count 184
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 226 transition count 184
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 26 place count 226 transition count 171
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 58 place count 207 transition count 171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 204 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 204 transition count 168
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 112 place count 179 transition count 145
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 178 transition count 156
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 178 transition count 154
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 118 place count 176 transition count 154
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 176 transition count 154
Applied a total of 119 rules in 35 ms. Remains 176 /239 variables (removed 63) and now considering 154/197 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 176/239 places, 154/197 transitions.
RANDOM walk for 40000 steps (1425 resets) in 198 ms. (201 steps per ms) remains 1/6 properties
BEST_FIRST walk for 5726 steps (65 resets) in 19 ms. (286 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2024-05-22 00:10:00] [INFO ] Flatten gal took : 40 ms
[2024-05-22 00:10:00] [INFO ] Flatten gal took : 32 ms
[2024-05-22 00:10:00] [INFO ] Input system was already deterministic with 465 transitions.
Support contains 106 out of 525 places (down from 110) after GAL structural reductions.
Computed a total of 148 stabilizing places and 139 stable transitions
Graph (complete) has 1151 edges and 525 vertex of which 522 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.14 ms
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 42 place count 483 transition count 425
Iterating global reduction 1 with 40 rules applied. Total rules applied 82 place count 483 transition count 425
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 93 place count 472 transition count 414
Iterating global reduction 1 with 11 rules applied. Total rules applied 104 place count 472 transition count 414
Applied a total of 104 rules in 23 ms. Remains 472 /525 variables (removed 53) and now considering 414/465 (removed 51) transitions.
// Phase 1: matrix 414 rows 472 cols
[2024-05-22 00:10:00] [INFO ] Computed 95 invariants in 4 ms
[2024-05-22 00:10:00] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 00:10:00] [INFO ] Invariant cache hit.
[2024-05-22 00:10:01] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2024-05-22 00:10:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 4 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 3 ms to minimize.
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 20/135 constraints. Problems are: Problem set: 4 solved, 409 unsolved
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:10:13] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 20/155 constraints. Problems are: Problem set: 4 solved, 409 unsolved
[2024-05-22 00:10:19] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:10:19] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:10:19] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:10:20] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:10:20] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:10:20] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:10:20] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:10:20] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:10:20] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:10:20] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:10:21] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:10:22] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 4 ms to minimize.
[2024-05-22 00:10:22] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 50 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 3 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 20/175 constraints. Problems are: Problem set: 28 solved, 385 unsolved
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 20/195 constraints. Problems are: Problem set: 28 solved, 385 unsolved
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 3 ms to minimize.
SMT process timed out in 30247ms, After SMT, problems are : Problem set: 28 solved, 385 unsolved
Search for dead transitions found 28 dead transitions in 30253ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 472/525 places, 386/465 transitions.
Applied a total of 0 rules in 7 ms. Remains 472 /472 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30823 ms. Remains : 472/525 places, 386/465 transitions.
[2024-05-22 00:10:31] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:10:31] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:10:31] [INFO ] Input system was already deterministic with 386 transitions.
[2024-05-22 00:10:31] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:10:31] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:10:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality14923768791452380826.gal : 11 ms
[2024-05-22 00:10:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality18391870853527821195.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/CTLCardinality14923768791452380826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18391870853527821195.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-22 00:11:01] [INFO ] Flatten gal took : 31 ms
[2024-05-22 00:11:01] [INFO ] Applying decomposition
[2024-05-22 00:11:01] [INFO ] Flatten gal took : 22 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/graph7667723750143603152.txt' '-o' '/tmp/graph7667723750143603152.bin' '-w' '/tmp/graph7667723750143603152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7667723750143603152.bin' '-l' '-1' '-v' '-w' '/tmp/graph7667723750143603152.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:11:01] [INFO ] Decomposing Gal with order
[2024-05-22 00:11:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:11:02] [INFO ] Removed a total of 140 redundant transitions.
[2024-05-22 00:11:02] [INFO ] Flatten gal took : 60 ms
[2024-05-22 00:11:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 12 ms.
[2024-05-22 00:11:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality16680354741903610564.gal : 8 ms
[2024-05-22 00:11:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality14309218295796868314.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/CTLCardinality16680354741903610564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14309218295796868314.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Graph (trivial) has 254 edges and 525 vertex of which 6 / 525 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1145 edges and 520 vertex of which 517 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 516 transition count 389
Reduce places removed 68 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 72 rules applied. Total rules applied 142 place count 448 transition count 385
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 146 place count 444 transition count 385
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 146 place count 444 transition count 285
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 361 place count 329 transition count 285
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 397 place count 293 transition count 249
Ensure Unique test removed 2 places
Iterating global reduction 3 with 38 rules applied. Total rules applied 435 place count 291 transition count 249
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 435 place count 291 transition count 245
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 443 place count 287 transition count 245
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 94
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 189 rules applied. Total rules applied 632 place count 192 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 633 place count 191 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 634 place count 190 transition count 150
Applied a total of 634 rules in 56 ms. Remains 190 /525 variables (removed 335) and now considering 150/465 (removed 315) transitions.
// Phase 1: matrix 150 rows 190 cols
[2024-05-22 00:11:32] [INFO ] Computed 76 invariants in 1 ms
[2024-05-22 00:11:32] [INFO ] Implicit Places using invariants in 251 ms returned [24, 26, 67, 68, 149, 164]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 253 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 184/525 places, 150/465 transitions.
Applied a total of 0 rules in 24 ms. Remains 184 /184 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 333 ms. Remains : 184/525 places, 150/465 transitions.
[2024-05-22 00:11:32] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:11:32] [INFO ] Flatten gal took : 28 ms
[2024-05-22 00:11:32] [INFO ] Input system was already deterministic with 150 transitions.
[2024-05-22 00:11:32] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:11:32] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:11:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality5388491782602091342.gal : 2 ms
[2024-05-22 00:11:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality15126066173129398525.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/CTLCardinality5388491782602091342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15126066173129398525.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(((((p12==0) * !(E((p359==1) U (p207==1)))) * AG(((p146==0)&&(p10==1)))) + ((((p147==0)&&(p81==0))&&((p314==1)&&((p228==0)||(p209==1)))...222
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((p12==0) * !(E((p359==1) U (p207==1))))) * !(E(TRUE U !(((p146==0)&&(p10==1))))))] != FAL...317
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t12, t29, t30, t32, t37, t38, t39, t41, t42, t43, t44, t45, t61, t62, t63, t64, t...333
(forward)formula 0,1,4.82654,151280,1,0,233,581238,289,110,6428,342841,277
FORMULA BusinessProcesses-PT-16-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 524 transition count 465
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 38 place count 487 transition count 428
Iterating global reduction 1 with 37 rules applied. Total rules applied 75 place count 487 transition count 428
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 85 place count 477 transition count 418
Iterating global reduction 1 with 10 rules applied. Total rules applied 95 place count 477 transition count 418
Applied a total of 95 rules in 42 ms. Remains 477 /525 variables (removed 48) and now considering 418/465 (removed 47) transitions.
// Phase 1: matrix 418 rows 477 cols
[2024-05-22 00:11:37] [INFO ] Computed 96 invariants in 3 ms
[2024-05-22 00:11:37] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-22 00:11:37] [INFO ] Invariant cache hit.
[2024-05-22 00:11:38] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2024-05-22 00:11:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 2/477 variables, 57/94 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 5 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 103 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 103 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 99 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 100 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 99 places in 85 ms of which 2 ms to minimize.
Problem TDEAD316 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 20/116 constraints. Problems are: Problem set: 11 solved, 406 unsolved
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 105 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 108 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 99 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 102 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
Problem TDEAD317 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 20/136 constraints. Problems are: Problem set: 26 solved, 391 unsolved
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 102 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 105 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:11:53] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 20/156 constraints. Problems are: Problem set: 26 solved, 391 unsolved
[2024-05-22 00:11:56] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:11:56] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:11:56] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:56] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:56] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:11:56] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:11:57] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:11:57] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:11:57] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:11:57] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:11:58] [INFO ] Deduced a trap composed of 88 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:11:58] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:11:58] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 4 ms to minimize.
[2024-05-22 00:11:59] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
Problem TDEAD326 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 20/176 constraints. Problems are: Problem set: 27 solved, 390 unsolved
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 90 places in 168 ms of which 4 ms to minimize.
[2024-05-22 00:12:00] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:12:01] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 99 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 5 ms to minimize.
[2024-05-22 00:12:02] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 4 ms to minimize.
[2024-05-22 00:12:03] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:12:04] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 3 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 20/196 constraints. Problems are: Problem set: 31 solved, 386 unsolved
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:12:05] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:12:06] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:12:06] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:12:06] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:12:06] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:12:06] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:12:07] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:12:07] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:12:07] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:12:07] [INFO ] Deduced a trap composed of 105 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:12:08] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:12:08] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 477/895 variables, and 209 constraints, problems are : Problem set: 31 solved, 386 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/477 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 31 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 37/37 constraints. Problems are: Problem set: 31 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/37 constraints. Problems are: Problem set: 31 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 2/477 variables, 57/94 constraints. Problems are: Problem set: 31 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 2/96 constraints. Problems are: Problem set: 31 solved, 386 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 113/209 constraints. Problems are: Problem set: 31 solved, 386 unsolved
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 5 ms to minimize.
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:12:12] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:12:13] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:12:14] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:12:15] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:12:15] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:12:15] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:12:15] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:12:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 20/229 constraints. Problems are: Problem set: 31 solved, 386 unsolved
[2024-05-22 00:12:16] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:12:16] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:12:17] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:12:17] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:12:17] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:12:17] [INFO ] Deduced a trap composed of 74 places in 213 ms of which 4 ms to minimize.
[2024-05-22 00:12:18] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:12:18] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:12:19] [INFO ] Deduced a trap composed of 127 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:12:19] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:12:20] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 20/249 constraints. Problems are: Problem set: 31 solved, 386 unsolved
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:12:21] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:12:22] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 4 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:12:23] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 2 ms to minimize.
[2024-05-22 00:12:24] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:12:24] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:12:25] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:12:25] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:12:25] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:12:25] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:12:26] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:12:26] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 20/269 constraints. Problems are: Problem set: 31 solved, 386 unsolved
[2024-05-22 00:12:26] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:12:28] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:12:28] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:12:28] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 4 ms to minimize.
[2024-05-22 00:12:28] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:12:28] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:12:30] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:12:30] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 20/289 constraints. Problems are: Problem set: 31 solved, 386 unsolved
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:12:33] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:12:33] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:12:33] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:12:35] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 3 ms to minimize.
Problem TDEAD332 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 20/309 constraints. Problems are: Problem set: 32 solved, 385 unsolved
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 2 ms to minimize.
SMT process timed out in 60170ms, After SMT, problems are : Problem set: 32 solved, 385 unsolved
Search for dead transitions found 32 dead transitions in 60178ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 477/525 places, 386/465 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 475 transition count 386
Applied a total of 2 rules in 11 ms. Remains 475 /477 variables (removed 2) and now considering 386/386 (removed 0) transitions.
// Phase 1: matrix 386 rows 475 cols
[2024-05-22 00:12:38] [INFO ] Computed 102 invariants in 4 ms
[2024-05-22 00:12:38] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-22 00:12:38] [INFO ] Invariant cache hit.
[2024-05-22 00:12:39] [INFO ] Implicit Places using invariants and state equation in 599 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 805 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 474/525 places, 386/465 transitions.
Applied a total of 0 rules in 8 ms. Remains 474 /474 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61752 ms. Remains : 474/525 places, 386/465 transitions.
[2024-05-22 00:12:39] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:12:39] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:12:39] [INFO ] Input system was already deterministic with 386 transitions.
[2024-05-22 00:12:39] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:12:39] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:12:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality10451624063614963975.gal : 3 ms
[2024-05-22 00:12:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality2694158373552513426.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/CTLCardinality10451624063614963975.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2694158373552513426.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-22 00:13:09] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:13:09] [INFO ] Applying decomposition
[2024-05-22 00:13:09] [INFO ] Flatten gal took : 19 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/graph12314733170936561239.txt' '-o' '/tmp/graph12314733170936561239.bin' '-w' '/tmp/graph12314733170936561239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12314733170936561239.bin' '-l' '-1' '-v' '-w' '/tmp/graph12314733170936561239.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:13:09] [INFO ] Decomposing Gal with order
[2024-05-22 00:13:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:13:09] [INFO ] Removed a total of 126 redundant transitions.
[2024-05-22 00:13:09] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:13:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 6 ms.
[2024-05-22 00:13:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality1266105642015021589.gal : 5 ms
[2024-05-22 00:13:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality14246292755181232669.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/CTLCardinality1266105642015021589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14246292755181232669.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07332e+27,6.12686,172220,7075,40,257767,607,905,831027,61,1451,0


Converting to forward existential form...Done !
original formula: E(AF(!(AG(((i5.u29.p92==0)||(i17.u108.p344==1))))) U ((AX((i19.u134.p481==1)) * ((i12.u114.p374==0)||(i18.u77.p239==1))) * ((AF(EX(((i18....353
=> equivalent forward existential formula: (([((FwdU(Init,!(EG(!(!(!(E(TRUE U !(((i5.u29.p92==0)||(i17.u108.p344==1)))))))))) * (!(EX(!((i19.u134.p481==1))...776
Reverse transition relation is NOT exact ! Due to transitions t7, t174, t178, t246, t268, t273, t282, t354, t363, t364, t371, t378, i0.u70.t189, i0.u72.t18...1248
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 488 transition count 430
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 488 transition count 430
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 81 place count 479 transition count 421
Iterating global reduction 1 with 9 rules applied. Total rules applied 90 place count 479 transition count 421
Applied a total of 90 rules in 45 ms. Remains 479 /525 variables (removed 46) and now considering 421/465 (removed 44) transitions.
// Phase 1: matrix 421 rows 479 cols
[2024-05-22 00:13:39] [INFO ] Computed 95 invariants in 5 ms
[2024-05-22 00:13:39] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-22 00:13:39] [INFO ] Invariant cache hit.
[2024-05-22 00:13:40] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2024-05-22 00:13:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 1/479 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/479 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 420 unsolved
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 107 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 3 ms to minimize.
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 20/115 constraints. Problems are: Problem set: 15 solved, 405 unsolved
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 107 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:13:53] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:13:53] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:13:53] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:13:53] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:13:53] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:13:53] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:13:53] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
Problem TDEAD338 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 20/135 constraints. Problems are: Problem set: 16 solved, 404 unsolved
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 6 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:13:57] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:13:57] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:13:57] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:13:57] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 20/155 constraints. Problems are: Problem set: 16 solved, 404 unsolved
[2024-05-22 00:14:00] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:00] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:14:00] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:14:00] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:14:00] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:14:01] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:14:02] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 3 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD344 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 20/175 constraints. Problems are: Problem set: 22 solved, 398 unsolved
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:14:03] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:14:04] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:14:05] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:14:05] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:14:05] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:14:05] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:14:05] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:14:05] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:14:05] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:14:05] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:14:06] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 20/195 constraints. Problems are: Problem set: 22 solved, 398 unsolved
[2024-05-22 00:14:06] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:14:06] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:14:06] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:14:07] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:14:07] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:14:07] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:14:07] [INFO ] Deduced a trap composed of 84 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:14:07] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:14:07] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:14:08] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:14:08] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:14:08] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:14:08] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:14:08] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:14:09] [INFO ] Deduced a trap composed of 114 places in 203 ms of which 4 ms to minimize.
[2024-05-22 00:14:09] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 6 ms to minimize.
[2024-05-22 00:14:09] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:14:09] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:14:09] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:14:09] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 20/215 constraints. Problems are: Problem set: 22 solved, 398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/900 variables, and 215 constraints, problems are : Problem set: 22 solved, 398 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/479 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 22 solved, 398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 37/37 constraints. Problems are: Problem set: 22 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 0/37 constraints. Problems are: Problem set: 22 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/479 variables, 56/93 constraints. Problems are: Problem set: 22 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/479 variables, 2/95 constraints. Problems are: Problem set: 22 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/479 variables, 120/215 constraints. Problems are: Problem set: 22 solved, 398 unsolved
[2024-05-22 00:14:14] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:14:14] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:14:16] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:14:16] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 83 places in 179 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/479 variables, 20/235 constraints. Problems are: Problem set: 22 solved, 398 unsolved
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:14:21] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 20/255 constraints. Problems are: Problem set: 22 solved, 398 unsolved
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 4 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 83 places in 156 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 20/275 constraints. Problems are: Problem set: 22 solved, 398 unsolved
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 5 ms to minimize.
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 20/295 constraints. Problems are: Problem set: 28 solved, 392 unsolved
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 102 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:14:30] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:14:31] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 14 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 4 ms to minimize.
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
Problem TDEAD352 is UNSAT
Problem TDEAD356 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/479 variables, 20/315 constraints. Problems are: Problem set: 30 solved, 390 unsolved
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:14:34] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:14:35] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:14:35] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:14:35] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:14:35] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:14:35] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:14:35] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:14:35] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:14:36] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 133 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:14:38] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/479 variables, 20/335 constraints. Problems are: Problem set: 30 solved, 390 unsolved
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:14:40] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:14:40] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:14:40] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:14:40] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:14:40] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 4 ms to minimize.
SMT process timed out in 60135ms, After SMT, problems are : Problem set: 30 solved, 390 unsolved
Search for dead transitions found 30 dead transitions in 60140ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 479/525 places, 391/465 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 478 transition count 391
Applied a total of 1 rules in 8 ms. Remains 478 /479 variables (removed 1) and now considering 391/391 (removed 0) transitions.
// Phase 1: matrix 391 rows 478 cols
[2024-05-22 00:14:40] [INFO ] Computed 100 invariants in 4 ms
[2024-05-22 00:14:40] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-22 00:14:40] [INFO ] Invariant cache hit.
[2024-05-22 00:14:41] [INFO ] Implicit Places using invariants and state equation in 401 ms returned [152]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 568 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 477/525 places, 391/465 transitions.
Applied a total of 0 rules in 7 ms. Remains 477 /477 variables (removed 0) and now considering 391/391 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61514 ms. Remains : 477/525 places, 391/465 transitions.
[2024-05-22 00:14:41] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:14:41] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:14:41] [INFO ] Input system was already deterministic with 391 transitions.
[2024-05-22 00:14:41] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:14:41] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:14:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality10101538906449836123.gal : 3 ms
[2024-05-22 00:14:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality7140711563505366201.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/CTLCardinality10101538906449836123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7140711563505366201.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-22 00:15:11] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:15:11] [INFO ] Applying decomposition
[2024-05-22 00:15:11] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6676593320409636966.txt' '-o' '/tmp/graph6676593320409636966.bin' '-w' '/tmp/graph6676593320409636966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6676593320409636966.bin' '-l' '-1' '-v' '-w' '/tmp/graph6676593320409636966.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:15:11] [INFO ] Decomposing Gal with order
[2024-05-22 00:15:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:15:11] [INFO ] Removed a total of 136 redundant transitions.
[2024-05-22 00:15:11] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:15:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 8 ms.
[2024-05-22 00:15:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality11436135075510983468.gal : 6 ms
[2024-05-22 00:15:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality17615835096382541816.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/CTLCardinality11436135075510983468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17615835096382541816.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Graph (trivial) has 265 edges and 525 vertex of which 6 / 525 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1145 edges and 520 vertex of which 517 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 516 transition count 382
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 152 place count 441 transition count 382
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 152 place count 441 transition count 281
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 371 place count 323 transition count 281
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 406 place count 288 transition count 246
Ensure Unique test removed 2 places
Iterating global reduction 2 with 37 rules applied. Total rules applied 443 place count 286 transition count 246
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 443 place count 286 transition count 242
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 451 place count 282 transition count 242
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 225 rules applied. Total rules applied 676 place count 168 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 677 place count 167 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 678 place count 166 transition count 130
Applied a total of 678 rules in 41 ms. Remains 166 /525 variables (removed 359) and now considering 130/465 (removed 335) transitions.
// Phase 1: matrix 130 rows 166 cols
[2024-05-22 00:15:41] [INFO ] Computed 72 invariants in 2 ms
[2024-05-22 00:15:41] [INFO ] Implicit Places using invariants in 100 ms returned [0, 1, 2, 3, 4, 5, 6, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 101 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 147/525 places, 130/465 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 149 ms. Remains : 147/525 places, 130/465 transitions.
[2024-05-22 00:15:41] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:15:41] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:15:41] [INFO ] Input system was already deterministic with 130 transitions.
RANDOM walk for 346 steps (70 resets) in 6 ms. (49 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-16-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 00:15:41] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:15:41] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:15:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12011909387202249706.gal : 1 ms
[2024-05-22 00:15:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4158158129873416355.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/ReachabilityCardinality12011909387202249706.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4158158129873416355.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 42 place count 483 transition count 425
Iterating global reduction 1 with 40 rules applied. Total rules applied 82 place count 483 transition count 425
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 93 place count 472 transition count 414
Iterating global reduction 1 with 11 rules applied. Total rules applied 104 place count 472 transition count 414
Applied a total of 104 rules in 18 ms. Remains 472 /525 variables (removed 53) and now considering 414/465 (removed 51) transitions.
// Phase 1: matrix 414 rows 472 cols
[2024-05-22 00:15:41] [INFO ] Computed 95 invariants in 3 ms
[2024-05-22 00:15:41] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-22 00:15:41] [INFO ] Invariant cache hit.
[2024-05-22 00:15:42] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2024-05-22 00:15:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 104 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 20/135 constraints. Problems are: Problem set: 2 solved, 411 unsolved
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 4 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
Problem TDEAD321 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD356 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 20/155 constraints. Problems are: Problem set: 5 solved, 408 unsolved
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 88 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 20/175 constraints. Problems are: Problem set: 14 solved, 399 unsolved
[2024-05-22 00:16:05] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:16:05] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:16:05] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:16:05] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:16:06] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 32 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:16:07] [INFO ] Deduced a trap composed of 106 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 20/195 constraints. Problems are: Problem set: 14 solved, 399 unsolved
[2024-05-22 00:16:08] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 47 places in 99 ms of which 7 ms to minimize.
SMT process timed out in 30090ms, After SMT, problems are : Problem set: 14 solved, 399 unsolved
Search for dead transitions found 14 dead transitions in 30094ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 472/525 places, 400/465 transitions.
Applied a total of 0 rules in 8 ms. Remains 472 /472 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30818 ms. Remains : 472/525 places, 400/465 transitions.
[2024-05-22 00:16:12] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:16:12] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:16:12] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-22 00:16:12] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:16:12] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:16:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality10533610184406048721.gal : 3 ms
[2024-05-22 00:16:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality7095971445906511094.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/CTLCardinality10533610184406048721.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7095971445906511094.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-22 00:16:42] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:16:42] [INFO ] Applying decomposition
[2024-05-22 00:16:42] [INFO ] Flatten gal took : 21 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/graph1703831952896494151.txt' '-o' '/tmp/graph1703831952896494151.bin' '-w' '/tmp/graph1703831952896494151.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1703831952896494151.bin' '-l' '-1' '-v' '-w' '/tmp/graph1703831952896494151.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:16:42] [INFO ] Decomposing Gal with order
[2024-05-22 00:16:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:16:42] [INFO ] Removed a total of 209 redundant transitions.
[2024-05-22 00:16:42] [INFO ] Flatten gal took : 28 ms
[2024-05-22 00:16:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 9 ms.
[2024-05-22 00:16:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality9131805249611245911.gal : 6 ms
[2024-05-22 00:16:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality6848390455886780874.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/CTLCardinality9131805249611245911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6848390455886780874.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Graph (trivial) has 258 edges and 525 vertex of which 6 / 525 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1145 edges and 520 vertex of which 517 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 516 transition count 387
Reduce places removed 70 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 446 transition count 385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 146 place count 444 transition count 385
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 146 place count 444 transition count 286
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 360 place count 329 transition count 286
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 394 place count 295 transition count 252
Ensure Unique test removed 2 places
Iterating global reduction 3 with 36 rules applied. Total rules applied 430 place count 293 transition count 252
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 430 place count 293 transition count 248
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 438 place count 289 transition count 248
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 657 place count 178 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 658 place count 177 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 659 place count 176 transition count 139
Applied a total of 659 rules in 78 ms. Remains 176 /525 variables (removed 349) and now considering 139/465 (removed 326) transitions.
// Phase 1: matrix 139 rows 176 cols
[2024-05-22 00:17:13] [INFO ] Computed 73 invariants in 2 ms
[2024-05-22 00:17:13] [INFO ] Implicit Places using invariants in 136 ms returned [0, 1, 2, 3, 4, 5, 6, 18, 22, 23, 24, 25, 26, 56, 57, 58, 59, 143]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 137 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 158/525 places, 139/465 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 221 ms. Remains : 158/525 places, 139/465 transitions.
[2024-05-22 00:17:13] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:17:13] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:17:13] [INFO ] Input system was already deterministic with 139 transitions.
[2024-05-22 00:17:13] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:17:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:17:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality3536479179695990447.gal : 3 ms
[2024-05-22 00:17:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality4880839924070517259.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/CTLCardinality3536479179695990447.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4880839924070517259.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,172470,0.801019,26732,2,11358,5,93351,6,0,771,64505,0


Converting to forward existential form...Done !
original formula: (AG((p161==0)) * EG(((EF((((p321==0)||(p394==0))||(p112==1))) + (p336==1)) + AG((EF(((p105==0)||(p174==1))) + AF(((p190==0)||(p165==1))))...159
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !((p161==0)))] = FALSE * [(Init * !(EG(((E(TRUE U (((p321==0)||(p394==0))||(p112==1))) + (p...265
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t8, t25, t32, t33, t34, t35, t36, t38, t53, t54, t55, t56, t57, t88, t105, t112, t117...281
(forward)formula 0,0,14.999,447356,1,0,290,2.67244e+06,278,151,5728,1.36184e+06,376
FORMULA BusinessProcesses-PT-16-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 42 place count 483 transition count 425
Iterating global reduction 1 with 40 rules applied. Total rules applied 82 place count 483 transition count 425
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 93 place count 472 transition count 414
Iterating global reduction 1 with 11 rules applied. Total rules applied 104 place count 472 transition count 414
Applied a total of 104 rules in 18 ms. Remains 472 /525 variables (removed 53) and now considering 414/465 (removed 51) transitions.
// Phase 1: matrix 414 rows 472 cols
[2024-05-22 00:17:28] [INFO ] Computed 95 invariants in 7 ms
[2024-05-22 00:17:28] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-22 00:17:28] [INFO ] Invariant cache hit.
[2024-05-22 00:17:29] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2024-05-22 00:17:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-22 00:17:36] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:17:36] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 4 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 20/115 constraints. Problems are: Problem set: 15 solved, 398 unsolved
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 85 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 20/135 constraints. Problems are: Problem set: 30 solved, 383 unsolved
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 81 places in 160 ms of which 2 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 75 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 35 places in 162 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 20/155 constraints. Problems are: Problem set: 30 solved, 383 unsolved
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 41 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 132 places in 190 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 139 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 20/175 constraints. Problems are: Problem set: 32 solved, 381 unsolved
[2024-05-22 00:17:54] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 20/195 constraints. Problems are: Problem set: 32 solved, 381 unsolved
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
SMT process timed out in 30122ms, After SMT, problems are : Problem set: 32 solved, 381 unsolved
Search for dead transitions found 32 dead transitions in 30129ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 472/525 places, 382/465 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 469 transition count 382
Applied a total of 3 rules in 8 ms. Remains 469 /472 variables (removed 3) and now considering 382/382 (removed 0) transitions.
// Phase 1: matrix 382 rows 469 cols
[2024-05-22 00:17:59] [INFO ] Computed 100 invariants in 5 ms
[2024-05-22 00:17:59] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-22 00:17:59] [INFO ] Invariant cache hit.
[2024-05-22 00:17:59] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 469/525 places, 382/465 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31560 ms. Remains : 469/525 places, 382/465 transitions.
[2024-05-22 00:17:59] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:18:00] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:18:00] [INFO ] Input system was already deterministic with 382 transitions.
[2024-05-22 00:18:00] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:18:00] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:18:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality13473545794170430406.gal : 3 ms
[2024-05-22 00:18:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality14292188541778269200.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/CTLCardinality13473545794170430406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14292188541778269200.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-22 00:18:30] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:18:30] [INFO ] Applying decomposition
[2024-05-22 00:18:30] [INFO ] Flatten gal took : 24 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/graph5664562230365242235.txt' '-o' '/tmp/graph5664562230365242235.bin' '-w' '/tmp/graph5664562230365242235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5664562230365242235.bin' '-l' '-1' '-v' '-w' '/tmp/graph5664562230365242235.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:18:30] [INFO ] Decomposing Gal with order
[2024-05-22 00:18:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:18:30] [INFO ] Removed a total of 124 redundant transitions.
[2024-05-22 00:18:30] [INFO ] Flatten gal took : 39 ms
[2024-05-22 00:18:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2024-05-22 00:18:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality9067209955035569582.gal : 33 ms
[2024-05-22 00:18:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality11626149174241402397.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/CTLCardinality9067209955035569582.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11626149174241402397.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 32 place count 493 transition count 435
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 493 transition count 435
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 70 place count 485 transition count 427
Iterating global reduction 1 with 8 rules applied. Total rules applied 78 place count 485 transition count 427
Applied a total of 78 rules in 42 ms. Remains 485 /525 variables (removed 40) and now considering 427/465 (removed 38) transitions.
// Phase 1: matrix 427 rows 485 cols
[2024-05-22 00:19:00] [INFO ] Computed 95 invariants in 14 ms
[2024-05-22 00:19:00] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-22 00:19:00] [INFO ] Invariant cache hit.
[2024-05-22 00:19:01] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-05-22 00:19:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/485 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 89 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 88 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 112 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 4 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 102 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 102 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 4 ms to minimize.
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 103 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 103 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 111 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 2 ms to minimize.
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 20/195 constraints. Problems are: Problem set: 5 solved, 421 unsolved
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 36 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:19:31] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 20/215 constraints. Problems are: Problem set: 23 solved, 403 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/912 variables, and 215 constraints, problems are : Problem set: 23 solved, 403 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/485 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 23 solved, 403 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 37/37 constraints. Problems are: Problem set: 23 solved, 403 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 0/37 constraints. Problems are: Problem set: 23 solved, 403 unsolved
At refinement iteration 2 (OVERLAPS) 1/485 variables, 56/93 constraints. Problems are: Problem set: 23 solved, 403 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 2/95 constraints. Problems are: Problem set: 23 solved, 403 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 120/215 constraints. Problems are: Problem set: 23 solved, 403 unsolved
[2024-05-22 00:19:35] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:35] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:19:35] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:19:35] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:19:35] [INFO ] Deduced a trap composed of 106 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:35] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:19:36] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:19:36] [INFO ] Deduced a trap composed of 107 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:36] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:19:36] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:36] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:19:36] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:19:36] [INFO ] Deduced a trap composed of 112 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:19:36] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:19:37] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:19:37] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:37] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:37] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:19:37] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:19:37] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 2 ms to minimize.
Problem TDEAD335 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 20/235 constraints. Problems are: Problem set: 25 solved, 401 unsolved
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 101 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 20/255 constraints. Problems are: Problem set: 30 solved, 396 unsolved
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 99 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 20/275 constraints. Problems are: Problem set: 30 solved, 396 unsolved
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 86 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 2 ms to minimize.
Problem TDEAD365 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 20/295 constraints. Problems are: Problem set: 31 solved, 395 unsolved
[2024-05-22 00:19:47] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:19:47] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:19:47] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 1 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:49] [INFO ] Deduced a trap composed of 107 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:49] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:49] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:19:49] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:19:49] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:19:49] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:19:49] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:19:50] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:50] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 20/315 constraints. Problems are: Problem set: 31 solved, 395 unsolved
[2024-05-22 00:19:50] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 4 ms to minimize.
[2024-05-22 00:19:51] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:51] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:19:51] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:51] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:19:51] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:19:51] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:52] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:52] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:19:52] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:19:52] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:19:52] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:52] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:19:52] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:53] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 20/335 constraints. Problems are: Problem set: 31 solved, 395 unsolved
[2024-05-22 00:19:54] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:19:55] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:19:56] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:19:57] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:19:57] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:19:57] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:19:57] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:19:57] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:19:57] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/485 variables, 20/355 constraints. Problems are: Problem set: 31 solved, 395 unsolved
[2024-05-22 00:19:58] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 103 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:19:59] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:20:00] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:20:00] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:20:00] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:20:00] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:20:00] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:20:00] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:20:00] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:20:00] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 4 ms to minimize.
[2024-05-22 00:20:01] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:20:01] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:20:01] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 20/375 constraints. Problems are: Problem set: 31 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/912 variables, and 375 constraints, problems are : Problem set: 31 solved, 395 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/485 constraints, PredecessorRefiner: 0/426 constraints, Known Traps: 280/280 constraints]
After SMT, in 60130ms problems are : Problem set: 31 solved, 395 unsolved
Search for dead transitions found 31 dead transitions in 60136ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 485/525 places, 396/465 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 483 transition count 396
Applied a total of 2 rules in 7 ms. Remains 483 /485 variables (removed 2) and now considering 396/396 (removed 0) transitions.
// Phase 1: matrix 396 rows 483 cols
[2024-05-22 00:20:01] [INFO ] Computed 100 invariants in 11 ms
[2024-05-22 00:20:01] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 00:20:01] [INFO ] Invariant cache hit.
[2024-05-22 00:20:02] [INFO ] Implicit Places using invariants and state equation in 479 ms returned [153]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 647 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 482/525 places, 396/465 transitions.
Applied a total of 0 rules in 6 ms. Remains 482 /482 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61711 ms. Remains : 482/525 places, 396/465 transitions.
[2024-05-22 00:20:02] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:20:02] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:20:02] [INFO ] Input system was already deterministic with 396 transitions.
[2024-05-22 00:20:02] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:20:02] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:20:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality13968781914474069463.gal : 2 ms
[2024-05-22 00:20:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality3896302641119945196.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/CTLCardinality13968781914474069463.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3896302641119945196.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-22 00:20:32] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:20:32] [INFO ] Applying decomposition
[2024-05-22 00:20:32] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12390126403609509769.txt' '-o' '/tmp/graph12390126403609509769.bin' '-w' '/tmp/graph12390126403609509769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12390126403609509769.bin' '-l' '-1' '-v' '-w' '/tmp/graph12390126403609509769.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:20:32] [INFO ] Decomposing Gal with order
[2024-05-22 00:20:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:20:32] [INFO ] Removed a total of 132 redundant transitions.
[2024-05-22 00:20:32] [INFO ] Flatten gal took : 31 ms
[2024-05-22 00:20:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2024-05-22 00:20:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality3579790925018798694.gal : 6 ms
[2024-05-22 00:20:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality1407015195616139878.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/CTLCardinality3579790925018798694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1407015195616139878.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Graph (trivial) has 262 edges and 525 vertex of which 6 / 525 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1145 edges and 520 vertex of which 517 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 516 transition count 383
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 442 transition count 383
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 150 place count 442 transition count 284
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 364 place count 327 transition count 284
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 400 place count 291 transition count 248
Ensure Unique test removed 2 places
Iterating global reduction 2 with 38 rules applied. Total rules applied 438 place count 289 transition count 248
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 438 place count 289 transition count 244
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 446 place count 285 transition count 244
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 663 place count 175 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 664 place count 174 transition count 136
Applied a total of 664 rules in 55 ms. Remains 174 /525 variables (removed 351) and now considering 136/465 (removed 329) transitions.
// Phase 1: matrix 136 rows 174 cols
[2024-05-22 00:21:02] [INFO ] Computed 74 invariants in 3 ms
[2024-05-22 00:21:02] [INFO ] Implicit Places using invariants in 142 ms returned [140]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 173/525 places, 136/465 transitions.
Applied a total of 0 rules in 5 ms. Remains 173 /173 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 203 ms. Remains : 173/525 places, 136/465 transitions.
[2024-05-22 00:21:02] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:21:02] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:21:02] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-22 00:21:02] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:21:02] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:21:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality11855097796346278433.gal : 1 ms
[2024-05-22 00:21:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality6620028450709770311.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/CTLCardinality11855097796346278433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6620028450709770311.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,21745,0.248184,12556,2,4418,5,33272,6,0,825,30266,0


Converting to forward existential form...Done !
original formula: EF((EG(AG(((p201==0)&&(p18==1)))) + (EG(AG((p253==0))) * (p155==0))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(E(TRUE U !(((p201==0)&&(p18==1))))))] != FALSE + [FwdG((FwdU(Init,TRUE) * (p155==0)),!(...190
Reverse transition relation is NOT exact ! Due to transitions t31, t32, t33, t34, t35, t50, t51, t52, t53, t54, t76, t86, t87, t88, t123, t124, t125, t130,...256
(forward)formula 0,1,2.08111,68036,1,0,182,219754,272,103,6125,139718,268
FORMULA BusinessProcesses-PT-16-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 34 place count 491 transition count 433
Iterating global reduction 1 with 32 rules applied. Total rules applied 66 place count 491 transition count 433
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 74 place count 483 transition count 425
Iterating global reduction 1 with 8 rules applied. Total rules applied 82 place count 483 transition count 425
Applied a total of 82 rules in 17 ms. Remains 483 /525 variables (removed 42) and now considering 425/465 (removed 40) transitions.
// Phase 1: matrix 425 rows 483 cols
[2024-05-22 00:21:04] [INFO ] Computed 95 invariants in 9 ms
[2024-05-22 00:21:05] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-22 00:21:05] [INFO ] Invariant cache hit.
[2024-05-22 00:21:05] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
Running 424 sub problems to find dead transitions.
[2024-05-22 00:21:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 1/483 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-22 00:21:13] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 106 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:21:17] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 3 ms to minimize.
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 20/115 constraints. Problems are: Problem set: 9 solved, 415 unsolved
[2024-05-22 00:21:17] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:21:17] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:21:17] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:21:17] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:21:17] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:21:18] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:21:18] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:21:18] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:21:18] [INFO ] Deduced a trap composed of 88 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:21:18] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:21:18] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:21:19] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:21:19] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:21:19] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:21:19] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:21:19] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:21:19] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:21:19] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:21:19] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 20/135 constraints. Problems are: Problem set: 9 solved, 415 unsolved
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:21:22] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:21:23] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:21:23] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
Problem TDEAD333 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 20/155 constraints. Problems are: Problem set: 12 solved, 412 unsolved
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:21:25] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:21:26] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 85 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:21:27] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:21:28] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:21:28] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:21:28] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:21:28] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 20/175 constraints. Problems are: Problem set: 12 solved, 412 unsolved
[2024-05-22 00:21:29] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:21:29] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:21:29] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:21:29] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:21:29] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:21:29] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:21:29] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:21:30] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:21:30] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:21:30] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:21:30] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:30] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:21:30] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 4 ms to minimize.
[2024-05-22 00:21:30] [INFO ] Deduced a trap composed of 91 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 5 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:21:31] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:21:32] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 20/195 constraints. Problems are: Problem set: 12 solved, 412 unsolved
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:21:33] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 20/215 constraints. Problems are: Problem set: 12 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 483/908 variables, and 215 constraints, problems are : Problem set: 12 solved, 412 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/483 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 12 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 37/37 constraints. Problems are: Problem set: 12 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/37 constraints. Problems are: Problem set: 12 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/483 variables, 56/93 constraints. Problems are: Problem set: 12 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 2/95 constraints. Problems are: Problem set: 12 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 120/215 constraints. Problems are: Problem set: 12 solved, 412 unsolved
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
Problem TDEAD332 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 20/235 constraints. Problems are: Problem set: 13 solved, 411 unsolved
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:21:44] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:21:45] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
Problem TDEAD358 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 20/255 constraints. Problems are: Problem set: 21 solved, 403 unsolved
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 85 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 79 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:21:48] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:21:48] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:21:48] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:21:48] [INFO ] Deduced a trap composed of 68 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:21:48] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:21:49] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:21:49] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:21:49] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:21:49] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 20/275 constraints. Problems are: Problem set: 21 solved, 403 unsolved
[2024-05-22 00:21:50] [INFO ] Deduced a trap composed of 80 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 78 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 66 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 20/295 constraints. Problems are: Problem set: 21 solved, 403 unsolved
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 88 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:21:56] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:21:57] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:21:58] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:21:58] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 20/315 constraints. Problems are: Problem set: 21 solved, 403 unsolved
[2024-05-22 00:21:59] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:21:59] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:21:59] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:22:00] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:22:00] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:22:00] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:22:00] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:22:00] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:22:00] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:22:01] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:22:01] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:22:01] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:22:01] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:22:01] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:22:02] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:22:02] [INFO ] Deduced a trap composed of 84 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:22:02] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 6 ms to minimize.
[2024-05-22 00:22:02] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:22:02] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:22:03] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
Problem TDEAD329 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/483 variables, 20/335 constraints. Problems are: Problem set: 23 solved, 401 unsolved
[2024-05-22 00:22:04] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:22:04] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:22:04] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:22:04] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:22:04] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:22:04] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:22:05] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:22:05] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:22:05] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:22:05] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:22:05] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:22:05] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:22:05] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:22:05] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/908 variables, and 349 constraints, problems are : Problem set: 23 solved, 401 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/483 constraints, PredecessorRefiner: 0/424 constraints, Known Traps: 254/254 constraints]
After SMT, in 60109ms problems are : Problem set: 23 solved, 401 unsolved
Search for dead transitions found 23 dead transitions in 60115ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in LTL mode, iteration 1 : 483/525 places, 402/465 transitions.
Applied a total of 0 rules in 7 ms. Remains 483 /483 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60967 ms. Remains : 483/525 places, 402/465 transitions.
[2024-05-22 00:22:05] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:22:05] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:22:05] [INFO ] Input system was already deterministic with 402 transitions.
[2024-05-22 00:22:05] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:22:05] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:22:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality6056934783413397650.gal : 2 ms
[2024-05-22 00:22:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15199852615568348218.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/CTLCardinality6056934783413397650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15199852615568348218.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-22 00:22:35] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:22:35] [INFO ] Applying decomposition
[2024-05-22 00:22:35] [INFO ] Flatten gal took : 16 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/graph993325917169452181.txt' '-o' '/tmp/graph993325917169452181.bin' '-w' '/tmp/graph993325917169452181.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph993325917169452181.bin' '-l' '-1' '-v' '-w' '/tmp/graph993325917169452181.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:22:36] [INFO ] Decomposing Gal with order
[2024-05-22 00:22:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:22:36] [INFO ] Removed a total of 164 redundant transitions.
[2024-05-22 00:22:36] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:22:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-22 00:22:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality6865191136521744962.gal : 4 ms
[2024-05-22 00:22:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality17610546702648454952.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/CTLCardinality6865191136521744962.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17610546702648454952.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32147e+27,3.68772,86556,5301,49,124934,571,1072,395242,70,1310,0


Converting to forward existential form...Done !
original formula: E((EG((((!((i10.i2.u126.p425==1)||(i7.i0.u39.p124==0)))&&(i17.i1.u2.p4==1))||(i16.i0.u18.p59==1))) * ((E((EG((i14.i2.u102.p321==1)) * ((i...560
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(EG((((!((i10.i2.u126.p425==1)||(i7.i0.u39.p124==0)))&&(i17.i1.u2.p4==1))||(i16.i0.u18.p59==1))...738
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t176, t248, t272, t277, t289, t369, t370, t371, t379, t380, t387, t392, t394, t397, ...1455
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 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 LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 43 place count 482 transition count 424
Iterating global reduction 1 with 41 rules applied. Total rules applied 84 place count 482 transition count 424
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 95 place count 471 transition count 413
Iterating global reduction 1 with 11 rules applied. Total rules applied 106 place count 471 transition count 413
Applied a total of 106 rules in 18 ms. Remains 471 /525 variables (removed 54) and now considering 413/465 (removed 52) transitions.
// Phase 1: matrix 413 rows 471 cols
[2024-05-22 00:23:06] [INFO ] Computed 95 invariants in 7 ms
[2024-05-22 00:23:06] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-22 00:23:06] [INFO ] Invariant cache hit.
[2024-05-22 00:23:06] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-22 00:23:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/471 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 37 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 3 ms to minimize.
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 20/115 constraints. Problems are: Problem set: 13 solved, 399 unsolved
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 93 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 88 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 99 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 93 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 94 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 94 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 104 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 94 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 20/135 constraints. Problems are: Problem set: 13 solved, 399 unsolved
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 96 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 97 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 20/155 constraints. Problems are: Problem set: 13 solved, 399 unsolved
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 100 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 100 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
Problem TDEAD313 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 20/175 constraints. Problems are: Problem set: 16 solved, 396 unsolved
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:23:28] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 20/195 constraints. Problems are: Problem set: 18 solved, 394 unsolved
[2024-05-22 00:23:29] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 3 ms to minimize.
Problem TDEAD333 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 20/215 constraints. Problems are: Problem set: 24 solved, 388 unsolved
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 86 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
SMT process timed out in 30184ms, After SMT, problems are : Problem set: 24 solved, 388 unsolved
Search for dead transitions found 24 dead transitions in 30189ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 471/525 places, 389/465 transitions.
Applied a total of 0 rules in 7 ms. Remains 471 /471 variables (removed 0) and now considering 389/389 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30970 ms. Remains : 471/525 places, 389/465 transitions.
[2024-05-22 00:23:37] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:23:37] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:23:37] [INFO ] Input system was already deterministic with 389 transitions.
[2024-05-22 00:23:37] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:23:37] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:23:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality13208793884230322556.gal : 3 ms
[2024-05-22 00:23:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality5345743640825259895.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/CTLCardinality13208793884230322556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5345743640825259895.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-22 00:24:07] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:24:07] [INFO ] Applying decomposition
[2024-05-22 00:24:07] [INFO ] Flatten gal took : 17 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/graph10505419443304973045.txt' '-o' '/tmp/graph10505419443304973045.bin' '-w' '/tmp/graph10505419443304973045.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10505419443304973045.bin' '-l' '-1' '-v' '-w' '/tmp/graph10505419443304973045.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:24:07] [INFO ] Decomposing Gal with order
[2024-05-22 00:24:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:24:07] [INFO ] Removed a total of 159 redundant transitions.
[2024-05-22 00:24:07] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:24:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2024-05-22 00:24:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality8463157916271313728.gal : 5 ms
[2024-05-22 00:24:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality16679632158363555969.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/CTLCardinality8463157916271313728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16679632158363555969.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07055e+27,2.7395,75836,8184,45,140884,594,1022,241593,67,1272,0


Converting to forward existential form...Done !
original formula: EX(((i16.i1.u40.p128==1)&&((i14.i1.u101.p321==0)||(i12.u115.p392==1))))
=> equivalent forward existential formula: [(EY(Init) * ((i16.i1.u40.p128==1)&&((i14.i1.u101.p321==0)||(i12.u115.p392==1))))] != FALSE
(forward)formula 0,0,2.75327,76100,1,0,140884,594,1402,241593,79,1272,2807
FORMULA BusinessProcesses-PT-16-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 465/465 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 523 transition count 465
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 39 place count 486 transition count 428
Iterating global reduction 1 with 37 rules applied. Total rules applied 76 place count 486 transition count 428
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 86 place count 476 transition count 418
Iterating global reduction 1 with 10 rules applied. Total rules applied 96 place count 476 transition count 418
Applied a total of 96 rules in 19 ms. Remains 476 /525 variables (removed 49) and now considering 418/465 (removed 47) transitions.
// Phase 1: matrix 418 rows 476 cols
[2024-05-22 00:24:10] [INFO ] Computed 95 invariants in 11 ms
[2024-05-22 00:24:10] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 00:24:10] [INFO ] Invariant cache hit.
[2024-05-22 00:24:10] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2024-05-22 00:24:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/476 variables, 59/91 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
Problem TDEAD326 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 20/115 constraints. Problems are: Problem set: 3 solved, 414 unsolved
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 89 places in 162 ms of which 4 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 20/135 constraints. Problems are: Problem set: 22 solved, 395 unsolved
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 4 ms to minimize.
[2024-05-22 00:24:24] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 36 places in 147 ms of which 3 ms to minimize.
Problem TDEAD331 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 20/155 constraints. Problems are: Problem set: 25 solved, 392 unsolved
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 20/175 constraints. Problems are: Problem set: 28 solved, 389 unsolved
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 20/195 constraints. Problems are: Problem set: 28 solved, 389 unsolved
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 4 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 88 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 30 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 20/215 constraints. Problems are: Problem set: 28 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 476/894 variables, and 215 constraints, problems are : Problem set: 28 solved, 389 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 0/476 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 28 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/475 variables, 32/32 constraints. Problems are: Problem set: 28 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/475 variables, 0/32 constraints. Problems are: Problem set: 28 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 1/476 variables, 59/91 constraints. Problems are: Problem set: 28 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/476 variables, 4/95 constraints. Problems are: Problem set: 28 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 120/215 constraints. Problems are: Problem set: 28 solved, 389 unsolved
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 1 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 3 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD322 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 20/235 constraints. Problems are: Problem set: 30 solved, 387 unsolved
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 91 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 20/255 constraints. Problems are: Problem set: 30 solved, 387 unsolved
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 86 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/476 variables, 20/275 constraints. Problems are: Problem set: 30 solved, 387 unsolved
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 33 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:56] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:24:56] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:24:56] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:56] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/476 variables, 20/295 constraints. Problems are: Problem set: 30 solved, 387 unsolved
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:24:59] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:24:59] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 114 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:25:00] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:25:01] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:25:02] [INFO ] Deduced a trap composed of 63 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:25:02] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:25:02] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:25:02] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/476 variables, 20/315 constraints. Problems are: Problem set: 30 solved, 387 unsolved
[2024-05-22 00:25:04] [INFO ] Deduced a trap composed of 126 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:25:04] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:25:04] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:25:04] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:25:04] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:25:04] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:25:05] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:25:05] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:25:05] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:25:05] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:25:05] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:25:06] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:25:06] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:25:06] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:25:06] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:25:06] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:25:06] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:25:06] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:25:07] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:25:07] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/476 variables, 20/335 constraints. Problems are: Problem set: 30 solved, 387 unsolved
[2024-05-22 00:25:07] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 2 ms to minimize.
[2024-05-22 00:25:08] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:25:09] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:25:09] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 476/894 variables, and 345 constraints, problems are : Problem set: 30 solved, 387 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 0/476 constraints, PredecessorRefiner: 0/417 constraints, Known Traps: 250/250 constraints]
After SMT, in 60156ms problems are : Problem set: 30 solved, 387 unsolved
Search for dead transitions found 30 dead transitions in 60167ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 476/525 places, 388/465 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 475 transition count 388
Applied a total of 1 rules in 7 ms. Remains 475 /476 variables (removed 1) and now considering 388/388 (removed 0) transitions.
// Phase 1: matrix 388 rows 475 cols
[2024-05-22 00:25:11] [INFO ] Computed 100 invariants in 4 ms
[2024-05-22 00:25:11] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-22 00:25:11] [INFO ] Invariant cache hit.
[2024-05-22 00:25:11] [INFO ] Implicit Places using invariants and state equation in 482 ms returned [149, 150]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 691 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 473/525 places, 388/465 transitions.
Applied a total of 0 rules in 6 ms. Remains 473 /473 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61650 ms. Remains : 473/525 places, 388/465 transitions.
[2024-05-22 00:25:11] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:25:11] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:25:11] [INFO ] Input system was already deterministic with 388 transitions.
[2024-05-22 00:25:11] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:25:11] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:25:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality15286953467080861524.gal : 4 ms
[2024-05-22 00:25:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality2524010634123616992.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/CTLCardinality15286953467080861524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2524010634123616992.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-22 00:25:41] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:25:41] [INFO ] Applying decomposition
[2024-05-22 00:25:41] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3693296014975797215.txt' '-o' '/tmp/graph3693296014975797215.bin' '-w' '/tmp/graph3693296014975797215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3693296014975797215.bin' '-l' '-1' '-v' '-w' '/tmp/graph3693296014975797215.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:25:42] [INFO ] Decomposing Gal with order
[2024-05-22 00:25:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:25:42] [INFO ] Removed a total of 134 redundant transitions.
[2024-05-22 00:25:42] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:25:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2024-05-22 00:25:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality2644540398013328048.gal : 4 ms
[2024-05-22 00:25:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality3924668162906130926.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/CTLCardinality2644540398013328048.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3924668162906130926.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21705e+27,15.5117,387612,6248,43,630962,705,947,1.00641e+06,74,1575,0


Converting to forward existential form...Done !
original formula: (AF(AX((i17.u137.p523==1))) * A(!(((!(EX((i8.u76.p240==1))) + (i7.i0.i1.u63.p175==0)) + (i13.u106.p358==1))) U (((!(((i17.u128.p570==0)||...242
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!((i17.u137.p523==1))))))] = FALSE * ((([((FwdU(Init,!((((!(((i17.u128.p570==0)||(i3.u135.p51...1090
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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
Reverse transition relation is NOT exact ! Due to transitions t7, t174, t268, t282, t355, t357, t365, t366, t373, t377, t380, t382, i0.t178, i0.u51.t211, i...1234
Detected timeout of ITS tools.
[2024-05-22 00:26:12] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:26:12] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:26:12] [INFO ] Applying decomposition
[2024-05-22 00:26:12] [INFO ] Flatten gal took : 17 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/graph10101346114401426807.txt' '-o' '/tmp/graph10101346114401426807.bin' '-w' '/tmp/graph10101346114401426807.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10101346114401426807.bin' '-l' '-1' '-v' '-w' '/tmp/graph10101346114401426807.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:26:12] [INFO ] Decomposing Gal with order
[2024-05-22 00:26:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:26:12] [INFO ] Removed a total of 267 redundant transitions.
[2024-05-22 00:26:12] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:26:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 14 ms.
[2024-05-22 00:26:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality11805665137536208182.gal : 5 ms
[2024-05-22 00:26:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality7894460568530905468.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/CTLCardinality11805665137536208182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7894460568530905468.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 8 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.0255e+27,355.859,4296380,46516,60,5.38066e+06,849,1219,1.26435e+07,73,2752,0


Converting to forward existential form...Done !
original formula: AG(AX(AX(!(A((i9.u169.p552==1) U (i21.u150.p568==1))))))
=> equivalent forward existential formula: [((EY(EY(FwdU(Init,TRUE))) * !(EG(!((i21.u150.p568==1))))) * !(E(!((i21.u150.p568==1)) U (!((i9.u169.p552==1)) *...190
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t21, t204, t315, t328, t433, t457, i0.i0.u86.t198, i0.i1.u82.t207, i0.i1.u84.t201, i...1810
Detected timeout of ITS tools.
[2024-05-22 00:51:52] [INFO ] Applying decomposition
[2024-05-22 00:51:52] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:51:52] [INFO ] Decomposing Gal with order
[2024-05-22 00:51:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:51:52] [INFO ] Removed a total of 125 redundant transitions.
[2024-05-22 00:51:52] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:51:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 44 ms.
[2024-05-22 00:51:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality716336141665853277.gal : 6 ms
[2024-05-22 00:51:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality10109590207117533405.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/CTLCardinality716336141665853277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10109590207117533405.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 8 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 00:58:25] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:58:25] [INFO ] Input system was already deterministic with 465 transitions.
[2024-05-22 00:58:25] [INFO ] Transformed 525 places.
[2024-05-22 00:58:25] [INFO ] Transformed 465 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:58:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality3368652738780366298.gal : 5 ms
[2024-05-22 00:58:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality1427035568260559625.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/CTLCardinality3368652738780366298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1427035568260559625.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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 8 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-16"
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-16, 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-171620399800569"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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