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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.6K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 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 141K 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-11-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716334651096

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:37:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:37:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:37:32] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-21 23:37:32] [INFO ] Transformed 567 places.
[2024-05-21 23:37:32] [INFO ] Transformed 508 transitions.
[2024-05-21 23:37:32] [INFO ] Found NUPN structural information;
[2024-05-21 23:37:32] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Deduced a syphon composed of 7 places in 10 ms
Reduce places removed 7 places and 7 transitions.
Support contains 113 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 62 place count 498 transition count 443
Iterating global reduction 1 with 58 rules applied. Total rules applied 120 place count 498 transition count 443
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 144 place count 474 transition count 419
Iterating global reduction 1 with 24 rules applied. Total rules applied 168 place count 474 transition count 419
Applied a total of 168 rules in 102 ms. Remains 474 /560 variables (removed 86) and now considering 419/501 (removed 82) transitions.
// Phase 1: matrix 419 rows 474 cols
[2024-05-21 23:37:32] [INFO ] Computed 91 invariants in 32 ms
[2024-05-21 23:37:33] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-21 23:37:33] [INFO ] Invariant cache hit.
[2024-05-21 23:37:33] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2024-05-21 23:37:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/474 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 99 places in 170 ms of which 24 ms to minimize.
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 4 ms to minimize.
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 2 ms to minimize.
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:37:44] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 3 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 95 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 3 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:37:45] [INFO ] Deduced a trap composed of 100 places in 182 ms of which 2 ms to minimize.
[2024-05-21 23:37:46] [INFO ] Deduced a trap composed of 96 places in 203 ms of which 3 ms to minimize.
[2024-05-21 23:37:46] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:37:46] [INFO ] Deduced a trap composed of 92 places in 191 ms of which 3 ms to minimize.
[2024-05-21 23:37:46] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:37:46] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 23:37:46] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 112 places in 171 ms of which 3 ms to minimize.
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 99 places in 181 ms of which 2 ms to minimize.
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 113 places in 141 ms of which 26 ms to minimize.
[2024-05-21 23:37:47] [INFO ] Deduced a trap composed of 99 places in 209 ms of which 3 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 4 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 4 ms to minimize.
[2024-05-21 23:37:48] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 8 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 4 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:37:49] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 98 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:37:50] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 4 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:37:51] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 104 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 5 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:37:52] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 23:37:55] [INFO ] Deduced a trap composed of 79 places in 182 ms of which 3 ms to minimize.
[2024-05-21 23:37:55] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 4 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:37:56] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 7 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 96 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:37:57] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:37:58] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:37:58] [INFO ] Deduced a trap composed of 124 places in 158 ms of which 4 ms to minimize.
[2024-05-21 23:37:58] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:37:58] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:37:58] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:37:58] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-21 23:37:59] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:37:59] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:37:59] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:37:59] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:37:59] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:37:59] [INFO ] Deduced a trap composed of 104 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:38:00] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:38:00] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:38:00] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:38:00] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:38:00] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:38:00] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:38:00] [INFO ] Deduced a trap composed of 112 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:38:01] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:38:01] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:38:01] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:38:01] [INFO ] Deduced a trap composed of 107 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:38:01] [INFO ] Deduced a trap composed of 115 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:38:01] [INFO ] Deduced a trap composed of 109 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:38:02] [INFO ] Deduced a trap composed of 78 places in 155 ms of which 3 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD399 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 20/191 constraints. Problems are: Problem set: 6 solved, 412 unsolved
[2024-05-21 23:38:02] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:38:02] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:38:02] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:38:03] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:38:04] [INFO ] Deduced a trap composed of 106 places in 193 ms of which 3 ms to minimize.
SMT process timed out in 30350ms, After SMT, problems are : Problem set: 6 solved, 412 unsolved
Search for dead transitions found 6 dead transitions in 30375ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 474/560 places, 413/501 transitions.
Applied a total of 0 rules in 30 ms. Remains 474 /474 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31481 ms. Remains : 474/560 places, 413/501 transitions.
Support contains 113 out of 474 places after structural reductions.
[2024-05-21 23:38:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 23:38:04] [INFO ] Flatten gal took : 89 ms
FORMULA BusinessProcesses-PT-11-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:38:04] [INFO ] Flatten gal took : 43 ms
[2024-05-21 23:38:04] [INFO ] Input system was already deterministic with 413 transitions.
Support contains 99 out of 474 places (down from 113) after GAL structural reductions.
RANDOM walk for 40000 steps (297 resets) in 3265 ms. (12 steps per ms) remains 36/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 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 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 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 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 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 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 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 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
// Phase 1: matrix 413 rows 474 cols
[2024-05-21 23:38:06] [INFO ] Computed 91 invariants in 12 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
At refinement iteration 1 (OVERLAPS) 178/240 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 73/313 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 151/464 variables, 43/90 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/464 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 1/465 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/465 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 407/872 variables, 465/556 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/872 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp51 is UNSAT
At refinement iteration 11 (OVERLAPS) 13/885 variables, 7/563 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/885 variables, 0/563 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 2/887 variables, 2/565 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/887 variables, 0/565 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 0/887 variables, 0/565 constraints. Problems are: Problem set: 1 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 887/887 variables, and 565 constraints, problems are : Problem set: 1 solved, 35 unsolved in 4442 ms.
Refiners :[Positive P Invariants (semi-flows): 47/47 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 474/474 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/59 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 178/237 variables, 34/34 constraints. Problems are: Problem set: 1 solved, 35 unsolved
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 1 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:38:11] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 7/41 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 73/310 variables, 13/54 constraints. Problems are: Problem set: 1 solved, 35 unsolved
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:38:12] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 3 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 10/64 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 152/462 variables, 41/105 constraints. Problems are: Problem set: 1 solved, 35 unsolved
[2024-05-21 23:38:13] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:38:14] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 17 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 112 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:38:15] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:38:16] [INFO ] Deduced a trap composed of 99 places in 175 ms of which 4 ms to minimize.
SMT process timed out in 9661ms, After SMT, problems are : Problem set: 1 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 413/413 transitions.
Graph (trivial) has 186 edges and 474 vertex of which 4 / 474 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1020 edges and 471 vertex of which 470 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 470 transition count 361
Reduce places removed 47 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 423 transition count 358
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 102 place count 420 transition count 358
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 102 place count 420 transition count 284
Deduced a syphon composed of 74 places in 2 ms
Ensure Unique test removed 13 places
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 161 rules applied. Total rules applied 263 place count 333 transition count 284
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 276 place count 320 transition count 271
Iterating global reduction 3 with 13 rules applied. Total rules applied 289 place count 320 transition count 271
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 289 place count 320 transition count 269
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 293 place count 318 transition count 269
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 475 place count 227 transition count 178
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 477 place count 226 transition count 182
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 480 place count 226 transition count 179
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 483 place count 223 transition count 179
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 485 place count 223 transition count 179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 486 place count 222 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 487 place count 221 transition count 178
Applied a total of 487 rules in 232 ms. Remains 221 /474 variables (removed 253) and now considering 178/413 (removed 235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 221/474 places, 178/413 transitions.
RANDOM walk for 40000 steps (11 resets) in 965 ms. (41 steps per ms) remains 14/35 properties
BEST_FIRST walk for 40000 steps (11 resets) in 559 ms. (71 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (9 resets) in 173 ms. (229 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40000 steps (9 resets) in 389 ms. (102 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40000 steps (8 resets) in 365 ms. (109 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (13 resets) in 279 ms. (142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (9 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
// Phase 1: matrix 178 rows 221 cols
[2024-05-21 23:38:17] [INFO ] Computed 77 invariants in 3 ms
[2024-05-21 23:38:17] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 86/100 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 75/175 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 43/218 variables, 26/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 178/396 variables, 218/295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 3/399 variables, 3/303 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:38:17] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/399 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 304 constraints, problems are : Problem set: 0 solved, 5 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 221/221 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 86/100 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 75/175 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:38:18] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 51 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 1 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:38:19] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 15/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 2 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:38:20] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 53 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:38:21] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 49 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 49 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 2 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:38:22] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 1 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 51 places in 82 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:38:23] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 3 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 51 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 13/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 43/218 variables, 26/155 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 2 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:38:24] [INFO ] Deduced a trap composed of 50 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 4 ms to minimize.
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 1 ms to minimize.
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 1 ms to minimize.
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:38:25] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 18/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/218 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 178/396 variables, 218/392 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 5/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/396 variables, 5/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:38:26] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/396 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/396 variables, 3/409 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 3/399 variables, 3/412 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 3 ms to minimize.
[2024-05-21 23:38:27] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/399 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/399 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/399 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 414 constraints, problems are : Problem set: 0 solved, 5 unsolved in 10451 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 221/221 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 106/106 constraints]
After SMT, in 11034ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 915 ms.
Support contains 14 out of 221 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 221/221 places, 178/178 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 221 transition count 170
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 213 transition count 170
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 16 place count 213 transition count 156
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 49 place count 194 transition count 156
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 190 transition count 152
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 190 transition count 152
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 94 place count 170 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 169 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 169 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 168 transition count 145
Applied a total of 98 rules in 41 ms. Remains 168 /221 variables (removed 53) and now considering 145/178 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 168/221 places, 145/178 transitions.
RANDOM walk for 40000 steps (14 resets) in 403 ms. (99 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (10 resets) in 525 ms. (76 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (11 resets) in 453 ms. (88 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (14 resets) in 252 ms. (158 steps per ms) remains 5/5 properties
Probably explored full state space saw : 85796 states, properties seen :4
Probabilistic random walk after 424406 steps, saw 85796 distinct states, run finished after 1377 ms. (steps per millisecond=308 ) properties seen :4
Explored full state space saw : 85796 states, properties seen :0
Exhaustive walk after 424406 steps, saw 85796 distinct states, run finished after 1220 ms. (steps per millisecond=347 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA BusinessProcesses-PT-11-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:38:32] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:38:32] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:38:32] [INFO ] Input system was already deterministic with 413 transitions.
Computed a total of 458 stabilizing places and 397 stable transitions
Graph (complete) has 1024 edges and 474 vertex of which 473 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.38 ms
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 387
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 387
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 442 transition count 381
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 442 transition count 381
Applied a total of 64 rules in 69 ms. Remains 442 /474 variables (removed 32) and now considering 381/413 (removed 32) transitions.
// Phase 1: matrix 381 rows 442 cols
[2024-05-21 23:38:32] [INFO ] Computed 91 invariants in 6 ms
[2024-05-21 23:38:33] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-21 23:38:33] [INFO ] Invariant cache hit.
[2024-05-21 23:38:33] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2024-05-21 23:38:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/442 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:38:42] [INFO ] Deduced a trap composed of 81 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 90 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 6 ms to minimize.
[2024-05-21 23:38:43] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:38:44] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 3 ms to minimize.
[2024-05-21 23:38:44] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:38:44] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:38:44] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:38:44] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 1 ms to minimize.
[2024-05-21 23:38:44] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:38:44] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 1 ms to minimize.
[2024-05-21 23:38:44] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 79 places in 161 ms of which 2 ms to minimize.
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 20/111 constraints. Problems are: Problem set: 11 solved, 369 unsolved
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:38:45] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:38:46] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 77 places in 160 ms of which 2 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 75 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:38:47] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 78 places in 149 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 20/131 constraints. Problems are: Problem set: 11 solved, 369 unsolved
[2024-05-21 23:38:48] [INFO ] Deduced a trap composed of 83 places in 208 ms of which 3 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 75 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 84 places in 160 ms of which 2 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 80 places in 164 ms of which 3 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:38:49] [INFO ] Deduced a trap composed of 20 places in 151 ms of which 5 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 5 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 4 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 75 places in 143 ms of which 5 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 76 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:38:50] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 4 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 4 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 80 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:38:51] [INFO ] Deduced a trap composed of 90 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:38:52] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 20/151 constraints. Problems are: Problem set: 11 solved, 369 unsolved
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 86 places in 161 ms of which 2 ms to minimize.
[2024-05-21 23:38:54] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 88 places in 198 ms of which 4 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:38:55] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 77 places in 206 ms of which 5 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 6 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 84 places in 165 ms of which 5 ms to minimize.
[2024-05-21 23:38:56] [INFO ] Deduced a trap composed of 85 places in 163 ms of which 5 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 85 places in 171 ms of which 5 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 101 places in 154 ms of which 5 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 2 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:38:57] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
Problem TDEAD321 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 20/171 constraints. Problems are: Problem set: 15 solved, 365 unsolved
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 73 places in 160 ms of which 4 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 4 ms to minimize.
[2024-05-21 23:38:58] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 4 ms to minimize.
[2024-05-21 23:38:59] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 5 ms to minimize.
[2024-05-21 23:38:59] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 4 ms to minimize.
[2024-05-21 23:38:59] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:38:59] [INFO ] Deduced a trap composed of 79 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:38:59] [INFO ] Deduced a trap composed of 85 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:38:59] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:39:00] [INFO ] Deduced a trap composed of 50 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:39:00] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:39:00] [INFO ] Deduced a trap composed of 78 places in 178 ms of which 3 ms to minimize.
[2024-05-21 23:39:00] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:39:00] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 1 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 85 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 47 places in 175 ms of which 5 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 83 places in 180 ms of which 3 ms to minimize.
[2024-05-21 23:39:01] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 4 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD352 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 20/191 constraints. Problems are: Problem set: 23 solved, 357 unsolved
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 84 places in 169 ms of which 2 ms to minimize.
[2024-05-21 23:39:02] [INFO ] Deduced a trap composed of 88 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 85 places in 179 ms of which 3 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 2 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 79 places in 188 ms of which 6 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 5 ms to minimize.
[2024-05-21 23:39:03] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 5 ms to minimize.
[2024-05-21 23:39:04] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/823 variables, and 199 constraints, problems are : Problem set: 23 solved, 357 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 23 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 38/38 constraints. Problems are: Problem set: 23 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 0/38 constraints. Problems are: Problem set: 23 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 1/442 variables, 49/87 constraints. Problems are: Problem set: 23 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 4/91 constraints. Problems are: Problem set: 23 solved, 357 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 108/199 constraints. Problems are: Problem set: 23 solved, 357 unsolved
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 84 places in 186 ms of which 3 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:39:07] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 4 ms to minimize.
[2024-05-21 23:39:08] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 49 places in 6015 ms of which 4 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 84 places in 191 ms of which 3 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:39:14] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 86 places in 169 ms of which 2 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 107 places in 158 ms of which 5 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:39:15] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 82 places in 183 ms of which 4 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:39:16] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 72 places in 232 ms of which 4 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 4 ms to minimize.
[2024-05-21 23:39:17] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 3 ms to minimize.
Problem TDEAD334 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD365 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 20/219 constraints. Problems are: Problem set: 27 solved, 353 unsolved
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 71 places in 177 ms of which 3 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 4 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 62 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:39:18] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 90 places in 157 ms of which 4 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:39:19] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 2 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:20] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 85 places in 164 ms of which 3 ms to minimize.
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 3 ms to minimize.
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 79 places in 165 ms of which 3 ms to minimize.
[2024-05-21 23:39:21] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 60 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 3 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:39:22] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 20/239 constraints. Problems are: Problem set: 27 solved, 353 unsolved
[2024-05-21 23:39:23] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 3 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:39:24] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 2 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 30 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:39:25] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 76 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 4 ms to minimize.
[2024-05-21 23:39:26] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 3 ms to minimize.
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 79 places in 178 ms of which 4 ms to minimize.
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:39:27] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 20/259 constraints. Problems are: Problem set: 27 solved, 353 unsolved
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 68 places in 183 ms of which 3 ms to minimize.
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 74 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:39:28] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 46 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:39:29] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:39:30] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:39:30] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:39:30] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:39:31] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 2 ms to minimize.
[2024-05-21 23:39:31] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 2 ms to minimize.
[2024-05-21 23:39:31] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:39:31] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:39:31] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:39:32] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 20/279 constraints. Problems are: Problem set: 27 solved, 353 unsolved
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 66 places in 167 ms of which 2 ms to minimize.
[2024-05-21 23:39:33] [INFO ] Deduced a trap composed of 83 places in 167 ms of which 3 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 81 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:39:34] [INFO ] Deduced a trap composed of 83 places in 178 ms of which 3 ms to minimize.
SMT process timed out in 60317ms, After SMT, problems are : Problem set: 27 solved, 353 unsolved
Search for dead transitions found 27 dead transitions in 60333ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 442/474 places, 354/413 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 440 transition count 354
Applied a total of 2 rules in 8 ms. Remains 440 /442 variables (removed 2) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 440 cols
[2024-05-21 23:39:34] [INFO ] Computed 95 invariants in 5 ms
[2024-05-21 23:39:34] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-21 23:39:34] [INFO ] Invariant cache hit.
[2024-05-21 23:39:35] [INFO ] Implicit Places using invariants and state equation in 472 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 749 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 439/474 places, 354/413 transitions.
Applied a total of 0 rules in 7 ms. Remains 439 /439 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62147 ms. Remains : 439/474 places, 354/413 transitions.
[2024-05-21 23:39:35] [INFO ] Flatten gal took : 28 ms
[2024-05-21 23:39:35] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:39:35] [INFO ] Input system was already deterministic with 354 transitions.
[2024-05-21 23:39:35] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:39:35] [INFO ] Flatten gal took : 27 ms
[2024-05-21 23:39:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality3486296020380551280.gal : 24 ms
[2024-05-21 23:39:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality2023959595824625503.ctl : 13 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/CTLCardinality3486296020380551280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2023959595824625503.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:40:05] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:40:05] [INFO ] Applying decomposition
[2024-05-21 23:40:05] [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/graph1716471760278652609.txt' '-o' '/tmp/graph1716471760278652609.bin' '-w' '/tmp/graph1716471760278652609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1716471760278652609.bin' '-l' '-1' '-v' '-w' '/tmp/graph1716471760278652609.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:40:05] [INFO ] Decomposing Gal with order
[2024-05-21 23:40:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:40:05] [INFO ] Removed a total of 110 redundant transitions.
[2024-05-21 23:40:06] [INFO ] Flatten gal took : 132 ms
[2024-05-21 23:40:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 26 ms.
[2024-05-21 23:40:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality2986840157167778981.gal : 48 ms
[2024-05-21 23:40:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality13998204978187116759.ctl : 14 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/CTLCardinality2986840157167778981.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13998204978187116759.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.52424e+22,1.0932,33120,5998,36,59613,478,899,73380,59,1097,0


Converting to forward existential form...Done !
original formula: (AF(AX(EX(TRUE))) * EF(((((i20.u120.p405==0)||(i20.u119.p419==1))&&((i12.i2.u117.p397==0)||(i19.u102.p328==1)))&&((i12.i3.u115.p386==0)&&...177
=> equivalent forward existential formula: ([FwdG(Init,!(!(EX(!(EX(TRUE))))))] = FALSE * [(Init * !(E(TRUE U ((((i20.u120.p405==0)||(i20.u119.p419==1))&&((...256
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t9, t10, t154, t162, t174, t178, t182, t194, t202, t214, t226, t244, t252, t345, t346...1196
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,18.7845,472404,1,0,961620,478,6010,1.35843e+06,296,1097,2788486
FORMULA BusinessProcesses-PT-11-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 385
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 385
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 440 transition count 379
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 440 transition count 379
Applied a total of 68 rules in 37 ms. Remains 440 /474 variables (removed 34) and now considering 379/413 (removed 34) transitions.
// Phase 1: matrix 379 rows 440 cols
[2024-05-21 23:40:25] [INFO ] Computed 91 invariants in 4 ms
[2024-05-21 23:40:25] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-21 23:40:25] [INFO ] Invariant cache hit.
[2024-05-21 23:40:26] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2024-05-21 23:40:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/440 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-21 23:40:47] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 5 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 59 places in 149 ms of which 6 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 4 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 72 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:40:48] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 6 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 77 places in 161 ms of which 3 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 5 ms to minimize.
[2024-05-21 23:40:49] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 4 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 4 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:40:50] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 20/111 constraints. Problems are: Problem set: 9 solved, 369 unsolved
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 79 places in 215 ms of which 3 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 67 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:40:51] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 2 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:40:52] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 6 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 79 places in 162 ms of which 4 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 78 places in 171 ms of which 5 ms to minimize.
[2024-05-21 23:40:53] [INFO ] Deduced a trap composed of 60 places in 188 ms of which 5 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 66 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 64 places in 148 ms of which 3 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 20/131 constraints. Problems are: Problem set: 18 solved, 360 unsolved
[2024-05-21 23:40:54] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 84 places in 164 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:40:55] [INFO ] Deduced a trap composed of 79 places in 193 ms of which 2 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:40:56] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 4 ms to minimize.
SMT process timed out in 30192ms, After SMT, problems are : Problem set: 18 solved, 360 unsolved
Search for dead transitions found 18 dead transitions in 30198ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 440/474 places, 361/413 transitions.
Applied a total of 0 rules in 6 ms. Remains 440 /440 variables (removed 0) and now considering 361/361 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31144 ms. Remains : 440/474 places, 361/413 transitions.
[2024-05-21 23:40:56] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:40:56] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:40:56] [INFO ] Input system was already deterministic with 361 transitions.
[2024-05-21 23:40:56] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:40:56] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:40:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality17753584191654140658.gal : 2 ms
[2024-05-21 23:40:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality11924603941728210643.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/CTLCardinality17753584191654140658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11924603941728210643.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.19691e+22,22.6592,597832,2,263081,5,1.3744e+06,6,0,2122,3.29647e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:41:26] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:41:26] [INFO ] Applying decomposition
[2024-05-21 23:41:26] [INFO ] Flatten gal took : 23 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/graph7963289004616815563.txt' '-o' '/tmp/graph7963289004616815563.bin' '-w' '/tmp/graph7963289004616815563.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7963289004616815563.bin' '-l' '-1' '-v' '-w' '/tmp/graph7963289004616815563.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:41:26] [INFO ] Decomposing Gal with order
[2024-05-21 23:41:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:41:26] [INFO ] Removed a total of 141 redundant transitions.
[2024-05-21 23:41:26] [INFO ] Flatten gal took : 54 ms
[2024-05-21 23:41:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 23 ms.
[2024-05-21 23:41:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality17470158111067477029.gal : 16 ms
[2024-05-21 23:41:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality15690539160203913430.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/CTLCardinality17470158111067477029.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15690539160203913430.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.19691e+22,0.74813,27404,4029,52,41040,556,965,125625,64,1319,0


Converting to forward existential form...Done !
original formula: AF(AG(EX(((i12.i1.u106.p339==0) + AF((i18.u130.p471==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(EX(((i12.i1.u106.p339==0) + !(EG(!((i18.u130.p471==0)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t10, t152, t156, t172, t176, t180, t196, t208, t220, t224, t250, t353, t354, t356, i0...1155
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 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,11.152,384596,1,0,657209,950,7429,2.26937e+06,338,2405,1193155
FORMULA BusinessProcesses-PT-11-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Graph (trivial) has 229 edges and 474 vertex of which 7 / 474 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1017 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 466 transition count 344
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 406 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 405 transition count 343
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 124 place count 405 transition count 249
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 205 rules applied. Total rules applied 329 place count 294 transition count 249
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 355 place count 268 transition count 223
Iterating global reduction 3 with 26 rules applied. Total rules applied 381 place count 268 transition count 223
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 381 place count 268 transition count 222
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 383 place count 267 transition count 222
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 586 place count 164 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 587 place count 163 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 588 place count 162 transition count 121
Applied a total of 588 rules in 80 ms. Remains 162 /474 variables (removed 312) and now considering 121/413 (removed 292) transitions.
// Phase 1: matrix 121 rows 162 cols
[2024-05-21 23:41:38] [INFO ] Computed 70 invariants in 2 ms
[2024-05-21 23:41:38] [INFO ] Implicit Places using invariants in 119 ms returned [33, 51, 52, 55, 56]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 120 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 157/474 places, 121/413 transitions.
Applied a total of 0 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 208 ms. Remains : 157/474 places, 121/413 transitions.
[2024-05-21 23:41:38] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:41:38] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:41:38] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-21 23:41:38] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:41:38] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:41:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality13869070340132918813.gal : 1 ms
[2024-05-21 23:41:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality1838037435703260760.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/CTLCardinality13869070340132918813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1838037435703260760.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,52572,0.081668,7076,2,2416,5,12177,6,0,747,10225,0


Converting to forward existential form...Done !
original formula: EF((((p469==0) * EG((p37!=1))) * AG(((p208==0)&&(p186==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((p469==0) * EG((p37!=1)))) * !(E(TRUE U !(((p208==0)&&(p186==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t24, t27, t28, t29, t30, t31, t32, t56, t57, t58, t59, t60, t75, t90, t91, t92, t93, t97,...272
(forward)formula 0,1,1.43538,54788,1,0,274,248491,241,138,5577,208260,338
FORMULA BusinessProcesses-PT-11-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 450 transition count 389
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 450 transition count 389
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 443 transition count 382
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 443 transition count 382
Applied a total of 62 rules in 20 ms. Remains 443 /474 variables (removed 31) and now considering 382/413 (removed 31) transitions.
// Phase 1: matrix 382 rows 443 cols
[2024-05-21 23:41:39] [INFO ] Computed 91 invariants in 4 ms
[2024-05-21 23:41:40] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-21 23:41:40] [INFO ] Invariant cache hit.
[2024-05-21 23:41:40] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1174 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2024-05-21 23:41:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/443 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-21 23:41:49] [INFO ] Deduced a trap composed of 62 places in 207 ms of which 6 ms to minimize.
[2024-05-21 23:41:49] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 7 ms to minimize.
[2024-05-21 23:41:49] [INFO ] Deduced a trap composed of 83 places in 158 ms of which 5 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 4 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 81 places in 167 ms of which 8 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 5 ms to minimize.
[2024-05-21 23:41:50] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 4 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 5 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:41:51] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 1 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 2 ms to minimize.
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 20/111 constraints. Problems are: Problem set: 6 solved, 375 unsolved
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 68 places in 155 ms of which 5 ms to minimize.
[2024-05-21 23:41:52] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 4 ms to minimize.
[2024-05-21 23:41:53] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:41:53] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:41:53] [INFO ] Deduced a trap composed of 100 places in 164 ms of which 3 ms to minimize.
[2024-05-21 23:41:53] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 4 ms to minimize.
[2024-05-21 23:41:53] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 2 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 71 places in 158 ms of which 2 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 3 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:41:54] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 5 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 4 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 72 places in 166 ms of which 4 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 77 places in 161 ms of which 4 ms to minimize.
[2024-05-21 23:41:55] [INFO ] Deduced a trap composed of 75 places in 174 ms of which 4 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 60 places in 159 ms of which 4 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 20/131 constraints. Problems are: Problem set: 6 solved, 375 unsolved
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 4 ms to minimize.
[2024-05-21 23:41:56] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 4 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 5 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 62 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:41:57] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 1 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 5 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 65 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 20/151 constraints. Problems are: Problem set: 6 solved, 375 unsolved
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 75 places in 166 ms of which 3 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 84 places in 228 ms of which 5 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 86 places in 227 ms of which 5 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 4 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 77 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 80 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:42:06] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:42:06] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 20/171 constraints. Problems are: Problem set: 6 solved, 375 unsolved
[2024-05-21 23:42:06] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:42:07] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:42:07] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 3 ms to minimize.
[2024-05-21 23:42:07] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:42:08] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:42:08] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:42:08] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:42:08] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:42:08] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:42:08] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:42:08] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:42:08] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 7 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 2 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:42:10] [INFO ] Deduced a trap composed of 76 places in 176 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 20/191 constraints. Problems are: Problem set: 6 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 443/825 variables, and 191 constraints, problems are : Problem set: 6 solved, 375 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/443 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 6 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 38/38 constraints. Problems are: Problem set: 6 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/38 constraints. Problems are: Problem set: 6 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 1/443 variables, 49/87 constraints. Problems are: Problem set: 6 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 4/91 constraints. Problems are: Problem set: 6 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 100/191 constraints. Problems are: Problem set: 6 solved, 375 unsolved
[2024-05-21 23:42:14] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:42:14] [INFO ] Deduced a trap composed of 78 places in 207 ms of which 2 ms to minimize.
[2024-05-21 23:42:15] [INFO ] Deduced a trap composed of 77 places in 198 ms of which 2 ms to minimize.
[2024-05-21 23:42:15] [INFO ] Deduced a trap composed of 83 places in 181 ms of which 2 ms to minimize.
[2024-05-21 23:42:15] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:42:15] [INFO ] Deduced a trap composed of 84 places in 164 ms of which 2 ms to minimize.
[2024-05-21 23:42:16] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:42:16] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:42:16] [INFO ] Deduced a trap composed of 86 places in 175 ms of which 2 ms to minimize.
[2024-05-21 23:42:16] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:42:16] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:42:16] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:42:17] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:42:17] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 4 ms to minimize.
[2024-05-21 23:42:17] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 4 ms to minimize.
[2024-05-21 23:42:17] [INFO ] Deduced a trap composed of 47 places in 146 ms of which 5 ms to minimize.
[2024-05-21 23:42:17] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 5 ms to minimize.
[2024-05-21 23:42:18] [INFO ] Deduced a trap composed of 82 places in 177 ms of which 5 ms to minimize.
[2024-05-21 23:42:18] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 27 ms to minimize.
[2024-05-21 23:42:18] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 4 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 20/211 constraints. Problems are: Problem set: 21 solved, 360 unsolved
[2024-05-21 23:42:18] [INFO ] Deduced a trap composed of 71 places in 159 ms of which 4 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 4 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 3 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 4 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 78 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 82 places in 218 ms of which 4 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 70 places in 227 ms of which 4 ms to minimize.
[2024-05-21 23:42:20] [INFO ] Deduced a trap composed of 77 places in 211 ms of which 4 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 80 places in 210 ms of which 6 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 75 places in 203 ms of which 5 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 78 places in 164 ms of which 4 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 79 places in 165 ms of which 3 ms to minimize.
[2024-05-21 23:42:21] [INFO ] Deduced a trap composed of 84 places in 220 ms of which 4 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 3 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 72 places in 165 ms of which 3 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 4 ms to minimize.
[2024-05-21 23:42:22] [INFO ] Deduced a trap composed of 77 places in 162 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 20/231 constraints. Problems are: Problem set: 21 solved, 360 unsolved
[2024-05-21 23:42:23] [INFO ] Deduced a trap composed of 78 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 80 places in 156 ms of which 6 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 82 places in 183 ms of which 2 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 79 places in 178 ms of which 2 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 87 places in 192 ms of which 7 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 80 places in 178 ms of which 4 ms to minimize.
[2024-05-21 23:42:25] [INFO ] Deduced a trap composed of 89 places in 171 ms of which 4 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:42:26] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 4 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 1 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:42:27] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:42:28] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 4 ms to minimize.
[2024-05-21 23:42:28] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:42:28] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 6 ms to minimize.
[2024-05-21 23:42:28] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 41 places in 162 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 20/251 constraints. Problems are: Problem set: 21 solved, 360 unsolved
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 78 places in 186 ms of which 5 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 5 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 1 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 81 places in 163 ms of which 5 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 84 places in 165 ms of which 3 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 85 places in 167 ms of which 2 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 83 places in 167 ms of which 3 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 93 places in 176 ms of which 3 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 72 places in 221 ms of which 4 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 78 places in 158 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 77 places in 188 ms of which 5 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 77 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:42:32] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 5 ms to minimize.
Problem TDEAD364 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 20/271 constraints. Problems are: Problem set: 22 solved, 359 unsolved
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:42:33] [INFO ] Deduced a trap composed of 54 places in 138 ms of which 1 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 63 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:42:34] [INFO ] Deduced a trap composed of 86 places in 233 ms of which 31 ms to minimize.
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 27 ms to minimize.
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 79 places in 162 ms of which 8 ms to minimize.
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 82 places in 159 ms of which 5 ms to minimize.
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:42:35] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 4 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 84 places in 196 ms of which 5 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 5 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 4 ms to minimize.
[2024-05-21 23:42:36] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:42:37] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:42:38] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:42:38] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 1 ms to minimize.
[2024-05-21 23:42:38] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD366 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 20/291 constraints. Problems are: Problem set: 26 solved, 355 unsolved
[2024-05-21 23:42:39] [INFO ] Deduced a trap composed of 80 places in 182 ms of which 2 ms to minimize.
[2024-05-21 23:42:39] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 2 ms to minimize.
[2024-05-21 23:42:39] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:42:40] [INFO ] Deduced a trap composed of 77 places in 195 ms of which 3 ms to minimize.
[2024-05-21 23:42:40] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/825 variables, and 296 constraints, problems are : Problem set: 26 solved, 355 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/443 constraints, PredecessorRefiner: 0/381 constraints, Known Traps: 205/205 constraints]
After SMT, in 60167ms problems are : Problem set: 26 solved, 355 unsolved
Search for dead transitions found 26 dead transitions in 60176ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 443/474 places, 356/413 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 442 transition count 356
Applied a total of 1 rules in 7 ms. Remains 442 /443 variables (removed 1) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 442 cols
[2024-05-21 23:42:41] [INFO ] Computed 95 invariants in 9 ms
[2024-05-21 23:42:41] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-21 23:42:41] [INFO ] Invariant cache hit.
[2024-05-21 23:42:42] [INFO ] Implicit Places using invariants and state equation in 718 ms returned [59, 60]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1063 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 440/474 places, 356/413 transitions.
Applied a total of 0 rules in 7 ms. Remains 440 /440 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62450 ms. Remains : 440/474 places, 356/413 transitions.
[2024-05-21 23:42:42] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:42:42] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:42:42] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-21 23:42:42] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:42:42] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:42:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality14377638735247160525.gal : 2 ms
[2024-05-21 23:42:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality5056143458804082669.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/CTLCardinality14377638735247160525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5056143458804082669.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,4.25091e+22,27.043,644748,2,275342,5,1.55754e+06,6,0,2117,3.28835e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:43:12] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:43:12] [INFO ] Applying decomposition
[2024-05-21 23:43:12] [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/graph5910256683477296598.txt' '-o' '/tmp/graph5910256683477296598.bin' '-w' '/tmp/graph5910256683477296598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5910256683477296598.bin' '-l' '-1' '-v' '-w' '/tmp/graph5910256683477296598.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:43:12] [INFO ] Decomposing Gal with order
[2024-05-21 23:43:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:43:12] [INFO ] Removed a total of 107 redundant transitions.
[2024-05-21 23:43:12] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:43:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2024-05-21 23:43:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality6841020493573323756.gal : 7 ms
[2024-05-21 23:43:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality442201946171460532.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/CTLCardinality6841020493573323756.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality442201946171460532.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.25091e+22,0.718351,25584,3478,47,38193,634,957,116092,59,1641,0


Converting to forward existential form...Done !
original formula: ((A(!((EG(EF(((i19.u119.p438==0)||(i9.i1.u116.p391==1)))) * EG((i4.i1.u25.p72==0)))) U EX(!((((i19.u119.p497==0)||(i5.i0.u134.p492==1))&&...556
=> equivalent forward existential formula: (([((((EY((Init * (!((E(!(EX(!((((i19.u119.p497==0)||(i5.i0.u134.p492==1))&&(i6.i1.u56.p168==0))))) U (!(!((EG(E...1688
Reverse transition relation is NOT exact ! Due to transitions t10, t155, t163, t167, t175, t183, t191, t199, t203, t219, t227, t245, t253, t347, t349, t351...1249
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 387
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 387
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 58 place count 442 transition count 381
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 442 transition count 381
Applied a total of 64 rules in 35 ms. Remains 442 /474 variables (removed 32) and now considering 381/413 (removed 32) transitions.
// Phase 1: matrix 381 rows 442 cols
[2024-05-21 23:43:42] [INFO ] Computed 91 invariants in 6 ms
[2024-05-21 23:43:42] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-21 23:43:42] [INFO ] Invariant cache hit.
[2024-05-21 23:43:43] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2024-05-21 23:43:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/442 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 4 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:43:51] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 5 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 58 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 84 places in 138 ms of which 4 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:43:52] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 5 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:43:53] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 4 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 380 unsolved
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:43:54] [INFO ] Deduced a trap composed of 103 places in 166 ms of which 5 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 5 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:43:55] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:43:56] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:43:56] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:43:56] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:43:56] [INFO ] Deduced a trap composed of 80 places in 161 ms of which 4 ms to minimize.
[2024-05-21 23:43:56] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 4 ms to minimize.
[2024-05-21 23:43:56] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 4 ms to minimize.
[2024-05-21 23:43:57] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 5 ms to minimize.
[2024-05-21 23:43:57] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:43:57] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 4 ms to minimize.
[2024-05-21 23:43:57] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 2 ms to minimize.
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 20/131 constraints. Problems are: Problem set: 17 solved, 363 unsolved
[2024-05-21 23:43:57] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2024-05-21 23:43:58] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 1 ms to minimize.
[2024-05-21 23:43:58] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2024-05-21 23:43:58] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:43:58] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 2 ms to minimize.
[2024-05-21 23:43:58] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 4 ms to minimize.
[2024-05-21 23:43:58] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:43:59] [INFO ] Deduced a trap composed of 78 places in 173 ms of which 3 ms to minimize.
[2024-05-21 23:43:59] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:43:59] [INFO ] Deduced a trap composed of 77 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:43:59] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:43:59] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:43:59] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:44:00] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 1 ms to minimize.
[2024-05-21 23:44:00] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:44:00] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:44:00] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:44:00] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:44:00] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:44:01] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 2 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD352 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 20/151 constraints. Problems are: Problem set: 22 solved, 358 unsolved
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:44:03] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 103 places in 172 ms of which 2 ms to minimize.
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:44:04] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 3 ms to minimize.
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 75 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:44:05] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 1 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 20/171 constraints. Problems are: Problem set: 22 solved, 358 unsolved
[2024-05-21 23:44:06] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 4 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 74 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 5 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 5 ms to minimize.
[2024-05-21 23:44:07] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 3 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 4 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 69 places in 142 ms of which 5 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 2 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 76 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:44:08] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 1 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 5 ms to minimize.
[2024-05-21 23:44:09] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 20/191 constraints. Problems are: Problem set: 22 solved, 358 unsolved
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:44:10] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:44:11] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 2 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 86 places in 177 ms of which 2 ms to minimize.
[2024-05-21 23:44:12] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:44:13] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/823 variables, and 204 constraints, problems are : Problem set: 22 solved, 358 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/442 constraints, PredecessorRefiner: 380/380 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 22 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/441 variables, 38/38 constraints. Problems are: Problem set: 22 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/441 variables, 0/38 constraints. Problems are: Problem set: 22 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 1/442 variables, 49/87 constraints. Problems are: Problem set: 22 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 4/91 constraints. Problems are: Problem set: 22 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 113/204 constraints. Problems are: Problem set: 22 solved, 358 unsolved
[2024-05-21 23:44:16] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 57 places in 126 ms of which 1 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:44:17] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 4 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 81 places in 181 ms of which 3 ms to minimize.
[2024-05-21 23:44:18] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 5 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 5 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 83 places in 179 ms of which 6 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 83 places in 168 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:44:19] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 2 ms to minimize.
Problem TDEAD337 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 20/224 constraints. Problems are: Problem set: 23 solved, 357 unsolved
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 3 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 5 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 4 ms to minimize.
[2024-05-21 23:44:20] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 6 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:44:21] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 78 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 105 places in 176 ms of which 3 ms to minimize.
[2024-05-21 23:44:22] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 56 places in 187 ms of which 26 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:44:23] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 20/244 constraints. Problems are: Problem set: 23 solved, 357 unsolved
[2024-05-21 23:44:24] [INFO ] Deduced a trap composed of 60 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 64 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 2 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 80 places in 161 ms of which 5 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:44:25] [INFO ] Deduced a trap composed of 90 places in 159 ms of which 5 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 4 ms to minimize.
[2024-05-21 23:44:26] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 4 ms to minimize.
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 80 places in 5827 ms of which 2 ms to minimize.
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 80 places in 199 ms of which 3 ms to minimize.
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 83 places in 174 ms of which 2 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 3 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 63 places in 194 ms of which 4 ms to minimize.
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 20/264 constraints. Problems are: Problem set: 23 solved, 357 unsolved
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 89 places in 153 ms of which 2 ms to minimize.
[2024-05-21 23:44:35] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 3 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 84 places in 190 ms of which 5 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 85 places in 197 ms of which 5 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 84 places in 174 ms of which 4 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 103 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 6 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 102 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 7 ms to minimize.
[2024-05-21 23:44:38] [INFO ] Deduced a trap composed of 81 places in 212 ms of which 2 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:44:39] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 20/284 constraints. Problems are: Problem set: 27 solved, 353 unsolved
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 60 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 108 places in 101 ms of which 1 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:44:41] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:44:42] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 3 ms to minimize.
SMT process timed out in 60258ms, After SMT, problems are : Problem set: 27 solved, 353 unsolved
Search for dead transitions found 27 dead transitions in 60265ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 442/474 places, 354/413 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 441 transition count 354
Applied a total of 1 rules in 6 ms. Remains 441 /442 variables (removed 1) and now considering 354/354 (removed 0) transitions.
// Phase 1: matrix 354 rows 441 cols
[2024-05-21 23:44:43] [INFO ] Computed 96 invariants in 3 ms
[2024-05-21 23:44:43] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-21 23:44:43] [INFO ] Invariant cache hit.
[2024-05-21 23:44:44] [INFO ] Implicit Places using invariants and state equation in 483 ms returned [58, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 739 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 439/474 places, 354/413 transitions.
Applied a total of 0 rules in 6 ms. Remains 439 /439 variables (removed 0) and now considering 354/354 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61810 ms. Remains : 439/474 places, 354/413 transitions.
[2024-05-21 23:44:44] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:44:44] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:44:44] [INFO ] Input system was already deterministic with 354 transitions.
[2024-05-21 23:44:44] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:44:44] [INFO ] Flatten gal took : 20 ms
[2024-05-21 23:44:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality9922576765442949353.gal : 14 ms
[2024-05-21 23:44:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality8109645434146928724.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/CTLCardinality9922576765442949353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8109645434146928724.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:45:14] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:45:14] [INFO ] Applying decomposition
[2024-05-21 23:45:14] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14228007531578596834.txt' '-o' '/tmp/graph14228007531578596834.bin' '-w' '/tmp/graph14228007531578596834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14228007531578596834.bin' '-l' '-1' '-v' '-w' '/tmp/graph14228007531578596834.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:45:14] [INFO ] Decomposing Gal with order
[2024-05-21 23:45:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:45:14] [INFO ] Removed a total of 103 redundant transitions.
[2024-05-21 23:45:14] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:45:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 18 ms.
[2024-05-21 23:45:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality11787010500872847247.gal : 8 ms
[2024-05-21 23:45:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality5697990884056249943.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/CTLCardinality11787010500872847247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5697990884056249943.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.19748e+22,0.7582,25292,3994,29,44056,502,924,64790,48,1376,0


Converting to forward existential form...Done !
original formula: AG(((AG(((i8.i0.u57.p170==1)&&(((i16.u59.p175==0)||(i18.u143.p523==1))||((i0.u69.p206==0)||(i12.i1.u83.p249==1))))) + EG((((i15.u91.p272=...287
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((EX((i7.i1.u48.p147==1)) * EG((EG((i8.i2.u110.p360==0)) + (i11.u116.p391==1)))))) *...354
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t10, t154, t166, t174, t182, t194, t202, t210, t222, t226, t244, t252, t345, t347, t3...1209
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 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 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
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Graph (trivial) has 231 edges and 474 vertex of which 7 / 474 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1017 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 466 transition count 342
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 404 transition count 342
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 126 place count 404 transition count 249
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 330 place count 293 transition count 249
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 357 place count 266 transition count 222
Iterating global reduction 2 with 27 rules applied. Total rules applied 384 place count 266 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 384 place count 266 transition count 220
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 388 place count 264 transition count 220
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 595 place count 159 transition count 118
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 601 place count 159 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 602 place count 158 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 603 place count 157 transition count 117
Applied a total of 603 rules in 72 ms. Remains 157 /474 variables (removed 317) and now considering 117/413 (removed 296) transitions.
// Phase 1: matrix 117 rows 157 cols
[2024-05-21 23:45:44] [INFO ] Computed 69 invariants in 1 ms
[2024-05-21 23:45:45] [INFO ] Implicit Places using invariants in 137 ms returned [0, 4, 5, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 50, 51]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 140 ms to find 17 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 140/474 places, 117/413 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 117/117 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 216 ms. Remains : 140/474 places, 117/413 transitions.
[2024-05-21 23:45:45] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:45:45] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:45:45] [INFO ] Input system was already deterministic with 117 transitions.
[2024-05-21 23:45:45] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:45:45] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:45:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality2135475330202063747.gal : 1 ms
[2024-05-21 23:45:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality10044865548762389618.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/CTLCardinality2135475330202063747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10044865548762389618.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,19596,0.083561,7296,2,2056,5,13558,6,0,676,11024,0


Converting to forward existential form...Done !
original formula: AF(AG(((AG((p415==1)) + (p277==0)) + (p448==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(E(TRUE U !((p415==1)))) + (p277==0)) + (p448==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t23, t24, t25, t26, t27, t49, t50, t51, t52, t53, t73, t74, t75, t85, t89, t90, t91, t109, I...253
(forward)formula 0,0,0.832672,40644,1,0,272,176135,233,189,4999,167525,332
FORMULA BusinessProcesses-PT-11-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 445 transition count 384
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 445 transition count 384
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 438 transition count 377
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 438 transition count 377
Applied a total of 72 rules in 20 ms. Remains 438 /474 variables (removed 36) and now considering 377/413 (removed 36) transitions.
// Phase 1: matrix 377 rows 438 cols
[2024-05-21 23:45:46] [INFO ] Computed 91 invariants in 5 ms
[2024-05-21 23:45:46] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-21 23:45:46] [INFO ] Invariant cache hit.
[2024-05-21 23:45:46] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2024-05-21 23:45:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-21 23:46:05] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:46:06] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:06] [INFO ] Deduced a trap composed of 58 places in 153 ms of which 2 ms to minimize.
[2024-05-21 23:46:06] [INFO ] Deduced a trap composed of 77 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:46:06] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:46:06] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:46:06] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 2 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 84 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:46:07] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 76 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:46:08] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 3 ms to minimize.
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 20/111 constraints. Problems are: Problem set: 17 solved, 359 unsolved
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 83 places in 174 ms of which 3 ms to minimize.
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 83 places in 187 ms of which 5 ms to minimize.
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 5 ms to minimize.
[2024-05-21 23:46:09] [INFO ] Deduced a trap composed of 45 places in 201 ms of which 5 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 5 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 81 places in 146 ms of which 4 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:46:10] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 72 places in 149 ms of which 8 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:46:11] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 5 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 5 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 4 ms to minimize.
Problem TDEAD316 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 20/131 constraints. Problems are: Problem set: 23 solved, 353 unsolved
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:46:12] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:46:13] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:46:13] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 4 ms to minimize.
[2024-05-21 23:46:13] [INFO ] Deduced a trap composed of 77 places in 167 ms of which 3 ms to minimize.
[2024-05-21 23:46:13] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:46:13] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 4 ms to minimize.
[2024-05-21 23:46:13] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 3 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 5 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:46:14] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 79 places in 201 ms of which 5 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 70 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:46:15] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 20/151 constraints. Problems are: Problem set: 23 solved, 353 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/815 variables, and 151 constraints, problems are : Problem set: 23 solved, 353 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/438 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 23 solved, 353 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 38/38 constraints. Problems are: Problem set: 23 solved, 353 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 23 solved, 353 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 49/87 constraints. Problems are: Problem set: 23 solved, 353 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/91 constraints. Problems are: Problem set: 23 solved, 353 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 60/151 constraints. Problems are: Problem set: 23 solved, 353 unsolved
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 5 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 3 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 53 places in 164 ms of which 5 ms to minimize.
[2024-05-21 23:46:35] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 69 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 4 ms to minimize.
[2024-05-21 23:46:36] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 75 places in 177 ms of which 4 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:46:37] [INFO ] Deduced a trap composed of 80 places in 156 ms of which 4 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:46:38] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 3 ms to minimize.
Problem TDEAD323 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 20/171 constraints. Problems are: Problem set: 24 solved, 352 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/815 variables, and 171 constraints, problems are : Problem set: 24 solved, 352 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/438 constraints, PredecessorRefiner: 0/376 constraints, Known Traps: 80/80 constraints]
After SMT, in 60113ms problems are : Problem set: 24 solved, 352 unsolved
Search for dead transitions found 24 dead transitions in 60118ms
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 : 438/474 places, 353/413 transitions.
Applied a total of 0 rules in 10 ms. Remains 438 /438 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60960 ms. Remains : 438/474 places, 353/413 transitions.
[2024-05-21 23:46:47] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:46:47] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:46:47] [INFO ] Input system was already deterministic with 353 transitions.
[2024-05-21 23:46:47] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:46:47] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:46:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality4692575941778798458.gal : 2 ms
[2024-05-21 23:46:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality17784788825258092576.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/CTLCardinality4692575941778798458.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17784788825258092576.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,4.1963e+22,22.9432,594816,2,262799,5,1.37211e+06,6,0,2106,3.28844e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:47:17] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:47:17] [INFO ] Applying decomposition
[2024-05-21 23:47:17] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6637949554785043266.txt' '-o' '/tmp/graph6637949554785043266.bin' '-w' '/tmp/graph6637949554785043266.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6637949554785043266.bin' '-l' '-1' '-v' '-w' '/tmp/graph6637949554785043266.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:47:17] [INFO ] Decomposing Gal with order
[2024-05-21 23:47:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:47:17] [INFO ] Removed a total of 114 redundant transitions.
[2024-05-21 23:47:17] [INFO ] Flatten gal took : 45 ms
[2024-05-21 23:47:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 29 ms.
[2024-05-21 23:47:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality13336272828054624814.gal : 13 ms
[2024-05-21 23:47:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality9810007490761173059.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/CTLCardinality13336272828054624814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9810007490761173059.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1963e+22,1.02932,27668,3404,47,44381,723,928,113733,64,1612,0


Converting to forward existential form...Done !
original formula: EX(EF(((i7.i0.u46.p142==0)&&(i17.i0.u32.p98==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * ((i7.i0.u46.p142==0)&&(i17.i0.u32.p98==1)))] != FALSE
(forward)formula 0,1,1.50586,27932,1,0,44472,723,2140,113733,112,1612,122422
FORMULA BusinessProcesses-PT-11-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 452 transition count 391
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 452 transition count 391
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 447 transition count 386
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 447 transition count 386
Applied a total of 54 rules in 23 ms. Remains 447 /474 variables (removed 27) and now considering 386/413 (removed 27) transitions.
// Phase 1: matrix 386 rows 447 cols
[2024-05-21 23:47:18] [INFO ] Computed 91 invariants in 7 ms
[2024-05-21 23:47:19] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-21 23:47:19] [INFO ] Invariant cache hit.
[2024-05-21 23:47:19] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
Running 385 sub problems to find dead transitions.
[2024-05-21 23:47:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/447 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 385 unsolved
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 83 places in 163 ms of which 4 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 1 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:47:27] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 76 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:47:28] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 74 places in 138 ms of which 1 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 101 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:47:29] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 2 ms to minimize.
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/447 variables, 20/111 constraints. Problems are: Problem set: 16 solved, 369 unsolved
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:47:30] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 81 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 1 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 85 places in 163 ms of which 4 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 85 places in 141 ms of which 4 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 4 ms to minimize.
[2024-05-21 23:47:31] [INFO ] Deduced a trap composed of 79 places in 152 ms of which 5 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 4 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 80 places in 156 ms of which 4 ms to minimize.
[2024-05-21 23:47:32] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
Problem TDEAD327 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD355 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 20/131 constraints. Problems are: Problem set: 19 solved, 366 unsolved
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:47:33] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 77 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:47:34] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 5 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 1 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:47:35] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:47:36] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:47:36] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 4 ms to minimize.
[2024-05-21 23:47:36] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 20/151 constraints. Problems are: Problem set: 19 solved, 366 unsolved
[2024-05-21 23:47:39] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:47:39] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:47:39] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:47:39] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:47:39] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:47:39] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 2 ms to minimize.
[2024-05-21 23:47:40] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:47:40] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:47:40] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:47:40] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:47:40] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:47:40] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:47:41] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-21 23:47:41] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 1 ms to minimize.
[2024-05-21 23:47:41] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:47:41] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:47:41] [INFO ] Deduced a trap composed of 86 places in 185 ms of which 2 ms to minimize.
[2024-05-21 23:47:41] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:47:42] [INFO ] Deduced a trap composed of 79 places in 171 ms of which 2 ms to minimize.
[2024-05-21 23:47:42] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 20/171 constraints. Problems are: Problem set: 19 solved, 366 unsolved
[2024-05-21 23:47:42] [INFO ] Deduced a trap composed of 71 places in 199 ms of which 3 ms to minimize.
[2024-05-21 23:47:43] [INFO ] Deduced a trap composed of 75 places in 210 ms of which 5 ms to minimize.
[2024-05-21 23:47:43] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:47:43] [INFO ] Deduced a trap composed of 74 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:47:43] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:47:43] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:47:43] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 2 ms to minimize.
[2024-05-21 23:47:43] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:47:44] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:47:44] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:47:44] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:47:44] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 5 ms to minimize.
[2024-05-21 23:47:44] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 1 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 78 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 80 places in 176 ms of which 2 ms to minimize.
[2024-05-21 23:47:45] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:47:46] [INFO ] Deduced a trap composed of 29 places in 126 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 20/191 constraints. Problems are: Problem set: 19 solved, 366 unsolved
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 3 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 83 places in 191 ms of which 2 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:47:47] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:47:48] [INFO ] Deduced a trap composed of 80 places in 177 ms of which 5 ms to minimize.
[2024-05-21 23:47:49] [INFO ] Deduced a trap composed of 74 places in 198 ms of which 4 ms to minimize.
[2024-05-21 23:47:49] [INFO ] Deduced a trap composed of 82 places in 212 ms of which 23 ms to minimize.
[2024-05-21 23:47:49] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:47:49] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:47:49] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:47:49] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 3 ms to minimize.
SMT process timed out in 30156ms, After SMT, problems are : Problem set: 19 solved, 366 unsolved
Search for dead transitions found 19 dead transitions in 30163ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 447/474 places, 367/413 transitions.
Applied a total of 0 rules in 9 ms. Remains 447 /447 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31099 ms. Remains : 447/474 places, 367/413 transitions.
[2024-05-21 23:47:50] [INFO ] Flatten gal took : 33 ms
[2024-05-21 23:47:50] [INFO ] Flatten gal took : 26 ms
[2024-05-21 23:47:50] [INFO ] Input system was already deterministic with 367 transitions.
[2024-05-21 23:47:50] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:47:50] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:47:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality16532704778175184288.gal : 4 ms
[2024-05-21 23:47:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality17619799815823397264.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/CTLCardinality16532704778175184288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17619799815823397264.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:48:20] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:48:20] [INFO ] Applying decomposition
[2024-05-21 23:48:20] [INFO ] Flatten gal took : 36 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/graph1911276039615403746.txt' '-o' '/tmp/graph1911276039615403746.bin' '-w' '/tmp/graph1911276039615403746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1911276039615403746.bin' '-l' '-1' '-v' '-w' '/tmp/graph1911276039615403746.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:48:20] [INFO ] Decomposing Gal with order
[2024-05-21 23:48:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:48:20] [INFO ] Removed a total of 135 redundant transitions.
[2024-05-21 23:48:20] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:48:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-21 23:48:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality2992405398006507332.gal : 30 ms
[2024-05-21 23:48:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality16002243020176628111.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/CTLCardinality2992405398006507332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16002243020176628111.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.2528e+22,1.28763,36356,4724,42,61663,375,1030,119919,50,1034,0


Converting to forward existential form...Done !
original formula: E(AX(EX(E(EX((i3.i3.u108.p333==0)) U (i5.i1.u153.p539!=1)))) U (EF((!(EX((i5.i0.u29.p86==0))) + ((EG((i11.i0.u101.p307==1)) * (((i11.i1.u...688
=> equivalent forward existential formula: (([(EY(EY((((FwdU(Init,!(EX(!(EX(E(EX((i3.i3.u108.p333==0)) U (i5.i1.u153.p539!=1))))))) * E(TRUE U (!(EX((i5.i0...2718
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t158, t166, t170, t182, t198, t206, t218, t230, t248, t256, t358, t360, t362, i0...1327
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 445 transition count 384
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 445 transition count 384
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 438 transition count 377
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 438 transition count 377
Applied a total of 72 rules in 18 ms. Remains 438 /474 variables (removed 36) and now considering 377/413 (removed 36) transitions.
// Phase 1: matrix 377 rows 438 cols
[2024-05-21 23:48:50] [INFO ] Computed 91 invariants in 6 ms
[2024-05-21 23:48:50] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-21 23:48:50] [INFO ] Invariant cache hit.
[2024-05-21 23:48:51] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2024-05-21 23:48:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:48:58] [INFO ] Deduced a trap composed of 77 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 1 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:48:59] [INFO ] Deduced a trap composed of 76 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 78 places in 179 ms of which 5 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 4 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 4 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 4 ms to minimize.
[2024-05-21 23:49:00] [INFO ] Deduced a trap composed of 77 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 5 ms to minimize.
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 20/111 constraints. Problems are: Problem set: 17 solved, 359 unsolved
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:49:01] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:49:02] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 1 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 72 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:49:03] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 80 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 4 ms to minimize.
Problem TDEAD316 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 20/131 constraints. Problems are: Problem set: 23 solved, 353 unsolved
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:49:04] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:49:05] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 4 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 75 places in 156 ms of which 4 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 5 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 4 ms to minimize.
[2024-05-21 23:49:06] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 5 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 2 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:49:07] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 20/151 constraints. Problems are: Problem set: 23 solved, 353 unsolved
[2024-05-21 23:49:10] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:49:10] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:49:10] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:49:10] [INFO ] Deduced a trap composed of 62 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:49:10] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 2 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 3 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 73 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:49:11] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 2 ms to minimize.
[2024-05-21 23:49:12] [INFO ] Deduced a trap composed of 74 places in 178 ms of which 2 ms to minimize.
[2024-05-21 23:49:12] [INFO ] Deduced a trap composed of 73 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:49:12] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:49:12] [INFO ] Deduced a trap composed of 81 places in 169 ms of which 2 ms to minimize.
[2024-05-21 23:49:12] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 2 ms to minimize.
[2024-05-21 23:49:12] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:49:13] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:49:13] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 20/171 constraints. Problems are: Problem set: 23 solved, 353 unsolved
[2024-05-21 23:49:13] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:49:13] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 4 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 4 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 81 places in 162 ms of which 3 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 3 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:49:14] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 73 places in 152 ms of which 4 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 79 places in 152 ms of which 8 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 4 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 5 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 3 ms to minimize.
[2024-05-21 23:49:15] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 4 ms to minimize.
[2024-05-21 23:49:16] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 20/191 constraints. Problems are: Problem set: 23 solved, 353 unsolved
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 73 places in 211 ms of which 2 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 78 places in 164 ms of which 4 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:49:17] [INFO ] Deduced a trap composed of 78 places in 157 ms of which 4 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 4 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:49:18] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:49:19] [INFO ] Deduced a trap composed of 84 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:49:19] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 4 ms to minimize.
[2024-05-21 23:49:19] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:49:19] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 5 ms to minimize.
[2024-05-21 23:49:19] [INFO ] Deduced a trap composed of 78 places in 166 ms of which 2 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 80 places in 175 ms of which 3 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:49:20] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:49:21] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD361 is UNSAT
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/438 variables, 20/211 constraints. Problems are: Problem set: 26 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/815 variables, and 211 constraints, problems are : Problem set: 26 solved, 350 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/438 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 26 solved, 350 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 38/38 constraints. Problems are: Problem set: 26 solved, 350 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 26 solved, 350 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 49/87 constraints. Problems are: Problem set: 26 solved, 350 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/91 constraints. Problems are: Problem set: 26 solved, 350 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 120/211 constraints. Problems are: Problem set: 26 solved, 350 unsolved
[2024-05-21 23:49:24] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:49:24] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:49:25] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:49:25] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:49:25] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 3 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 11 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 78 places in 162 ms of which 2 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 78 places in 166 ms of which 2 ms to minimize.
[2024-05-21 23:49:26] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:49:27] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:49:27] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:49:28] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:49:28] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:49:28] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:49:28] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:49:29] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:49:29] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:49:29] [INFO ] Deduced a trap composed of 79 places in 157 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 20/231 constraints. Problems are: Problem set: 26 solved, 350 unsolved
[2024-05-21 23:49:29] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 3 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 3 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:49:30] [INFO ] Deduced a trap composed of 78 places in 167 ms of which 2 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 73 places in 208 ms of which 5 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 74 places in 204 ms of which 5 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 74 places in 198 ms of which 5 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 5 ms to minimize.
[2024-05-21 23:49:31] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 4 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 79 places in 157 ms of which 3 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 6 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 5 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 5 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 73 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:49:32] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 20/251 constraints. Problems are: Problem set: 26 solved, 350 unsolved
[2024-05-21 23:49:33] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:49:34] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:49:35] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:49:37] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:49:37] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:49:40] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:49:41] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-21 23:49:42] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:49:43] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:49:43] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:49:43] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 20/271 constraints. Problems are: Problem set: 26 solved, 350 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/815 variables, and 271 constraints, problems are : Problem set: 26 solved, 350 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/438 constraints, PredecessorRefiner: 0/376 constraints, Known Traps: 180/180 constraints]
After SMT, in 60163ms problems are : Problem set: 26 solved, 350 unsolved
Search for dead transitions found 26 dead transitions in 60168ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 438/474 places, 351/413 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 351
Applied a total of 1 rules in 6 ms. Remains 437 /438 variables (removed 1) and now considering 351/351 (removed 0) transitions.
// Phase 1: matrix 351 rows 437 cols
[2024-05-21 23:49:51] [INFO ] Computed 95 invariants in 4 ms
[2024-05-21 23:49:52] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-21 23:49:52] [INFO ] Invariant cache hit.
[2024-05-21 23:49:52] [INFO ] Implicit Places using invariants and state equation in 385 ms returned [58, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 680 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 435/474 places, 351/413 transitions.
Applied a total of 0 rules in 4 ms. Remains 435 /435 variables (removed 0) and now considering 351/351 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61927 ms. Remains : 435/474 places, 351/413 transitions.
[2024-05-21 23:49:52] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:49:52] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:49:52] [INFO ] Input system was already deterministic with 351 transitions.
[2024-05-21 23:49:52] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:49:52] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:49:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality7280842554661943607.gal : 3 ms
[2024-05-21 23:49:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality2379209510251534814.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/CTLCardinality7280842554661943607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2379209510251534814.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:50:22] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:50:22] [INFO ] Applying decomposition
[2024-05-21 23:50:22] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17336742885026973266.txt' '-o' '/tmp/graph17336742885026973266.bin' '-w' '/tmp/graph17336742885026973266.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17336742885026973266.bin' '-l' '-1' '-v' '-w' '/tmp/graph17336742885026973266.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:50:22] [INFO ] Decomposing Gal with order
[2024-05-21 23:50:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:50:22] [INFO ] Removed a total of 114 redundant transitions.
[2024-05-21 23:50:22] [INFO ] Flatten gal took : 47 ms
[2024-05-21 23:50:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-21 23:50:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality5944109556756928285.gal : 26 ms
[2024-05-21 23:50:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality10518594010353701876.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/CTLCardinality5944109556756928285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10518594010353701876.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.1963e+22,1.63328,39616,4034,30,61306,466,901,172181,50,1228,0


Converting to forward existential form...Done !
original formula: EF(EX(EF(((i8.u61.p181==0)&&(i17.i0.i0.u26.p87==1)))))
=> equivalent forward existential formula: [(FwdU(EY(FwdU(Init,TRUE)),TRUE) * ((i8.u61.p181==0)&&(i17.i0.i0.u26.p87==1)))] != FALSE
(forward)formula 0,1,2.23976,39880,1,0,62179,466,2108,226385,82,1228,125347
FORMULA BusinessProcesses-PT-11-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Graph (trivial) has 223 edges and 474 vertex of which 7 / 474 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1017 edges and 468 vertex of which 467 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 466 transition count 347
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 409 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 408 transition count 346
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 118 place count 408 transition count 256
Deduced a syphon composed of 90 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 314 place count 302 transition count 256
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 341 place count 275 transition count 229
Iterating global reduction 3 with 27 rules applied. Total rules applied 368 place count 275 transition count 229
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 368 place count 275 transition count 227
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 372 place count 273 transition count 227
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 562 place count 178 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 563 place count 177 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 564 place count 176 transition count 131
Applied a total of 564 rules in 101 ms. Remains 176 /474 variables (removed 298) and now considering 131/413 (removed 282) transitions.
// Phase 1: matrix 131 rows 176 cols
[2024-05-21 23:50:25] [INFO ] Computed 74 invariants in 3 ms
[2024-05-21 23:50:25] [INFO ] Implicit Places using invariants in 202 ms returned [0, 4, 5, 28, 29, 30, 31, 32, 46, 48, 50, 52, 55, 59, 60, 61, 62, 63, 64, 143]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 203 ms to find 20 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 156/474 places, 131/413 transitions.
Applied a total of 0 rules in 5 ms. Remains 156 /156 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 309 ms. Remains : 156/474 places, 131/413 transitions.
[2024-05-21 23:50:25] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:50:25] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:50:25] [INFO ] Input system was already deterministic with 131 transitions.
[2024-05-21 23:50:25] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:50:25] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:50:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality8550618960678492185.gal : 1 ms
[2024-05-21 23:50:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality1985300347857183016.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/CTLCardinality8550618960678492185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1985300347857183016.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,218562,0.186381,9748,2,3894,5,22227,6,0,755,16220,0


Converting to forward existential form...Done !
original formula: (EF((E(AF(((p155==0)||(p149==1))) U (AG(((p473==0)||(p564==1))) * (((p137==1)||(p184==0))||(p238==1)))) * (p553==1))) * EG(((p289==0)||(p...165
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U (E(!(EG(!(((p155==0)||(p149==1))))) U (!(E(TRUE U !(((p473==0)||(p564==1))))) * (((p137==...232
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t11, t32, t33, t34, t35, t37, t61, t62, t63, t64, t65, t83, t84, t85, t89, t90, t91, ...291
Hit Full ! (commute/partial/dont) 127/0/4
(forward)formula 0,1,5.06296,114988,1,0,320,557455,274,168,5803,503075,389
FORMULA BusinessProcesses-PT-11-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 446 transition count 385
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 446 transition count 385
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 439 transition count 378
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 439 transition count 378
Applied a total of 70 rules in 14 ms. Remains 439 /474 variables (removed 35) and now considering 378/413 (removed 35) transitions.
// Phase 1: matrix 378 rows 439 cols
[2024-05-21 23:50:30] [INFO ] Computed 91 invariants in 4 ms
[2024-05-21 23:50:30] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-21 23:50:30] [INFO ] Invariant cache hit.
[2024-05-21 23:50:31] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2024-05-21 23:50:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/439 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-21 23:50:38] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 6 ms to minimize.
[2024-05-21 23:50:38] [INFO ] Deduced a trap composed of 56 places in 204 ms of which 5 ms to minimize.
[2024-05-21 23:50:38] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:50:41] [INFO ] Deduced a trap composed of 78 places in 2954 ms of which 3 ms to minimize.
[2024-05-21 23:50:41] [INFO ] Deduced a trap composed of 83 places in 179 ms of which 3 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 80 places in 187 ms of which 3 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 80 places in 169 ms of which 5 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 90 places in 166 ms of which 5 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 5 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 78 places in 163 ms of which 5 ms to minimize.
[2024-05-21 23:50:42] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 77 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 5 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:50:43] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 77 places in 177 ms of which 2 ms to minimize.
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 377 unsolved
[2024-05-21 23:50:44] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 92 places in 189 ms of which 2 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 78 places in 179 ms of which 5 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 66 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:50:45] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 5 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 2 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 3 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:50:46] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 84 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 47 places in 148 ms of which 3 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:50:47] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/131 constraints. Problems are: Problem set: 13 solved, 364 unsolved
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 2 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:50:48] [INFO ] Deduced a trap composed of 80 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 79 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 3 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:50:49] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 79 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 3 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:50:50] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-05-21 23:50:51] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 2 ms to minimize.
Problem TDEAD331 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/151 constraints. Problems are: Problem set: 21 solved, 356 unsolved
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:50:53] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 2 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:50:54] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 3 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 3 ms to minimize.
[2024-05-21 23:50:55] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 3 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/171 constraints. Problems are: Problem set: 21 solved, 356 unsolved
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:50:56] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 76 places in 192 ms of which 3 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:50:57] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:50:58] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 3 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:50:59] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
Problem TDEAD362 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 20/191 constraints. Problems are: Problem set: 22 solved, 355 unsolved
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 83 places in 133 ms of which 2 ms to minimize.
[2024-05-21 23:51:00] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:51:01] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 3 ms to minimize.
SMT process timed out in 30231ms, After SMT, problems are : Problem set: 22 solved, 355 unsolved
Search for dead transitions found 22 dead transitions in 30242ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 439/474 places, 356/413 transitions.
Applied a total of 0 rules in 5 ms. Remains 439 /439 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30921 ms. Remains : 439/474 places, 356/413 transitions.
[2024-05-21 23:51:01] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:51:01] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:51:01] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-21 23:51:01] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:51:01] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:51:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality3624620901746275372.gal : 1 ms
[2024-05-21 23:51:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality4518745563886753470.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/CTLCardinality3624620901746275372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4518745563886753470.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,4.19729e+22,27.9628,596676,2,262847,5,1.37313e+06,6,0,2113,3.30037e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:51:31] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:51:31] [INFO ] Applying decomposition
[2024-05-21 23:51:31] [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/graph17301884651263787643.txt' '-o' '/tmp/graph17301884651263787643.bin' '-w' '/tmp/graph17301884651263787643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17301884651263787643.bin' '-l' '-1' '-v' '-w' '/tmp/graph17301884651263787643.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:51:31] [INFO ] Decomposing Gal with order
[2024-05-21 23:51:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:51:31] [INFO ] Removed a total of 119 redundant transitions.
[2024-05-21 23:51:31] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:51:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2024-05-21 23:51:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality12436711400286518712.gal : 8 ms
[2024-05-21 23:51:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality4987721709853570686.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/CTLCardinality12436711400286518712.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4987721709853570686.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.19729e+22,2.75597,71000,5439,53,97424,672,844,553578,66,1539,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(((i6.u124.p545==1)&&((i8.u46.p137==0)||(i16.u118.p438==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U ((i6.u124.p545==1)&&((i8.u46.p137==0)||(i16.u118.p438==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t151, t159, t163, t171, t175, t187, t195, t199, t211, t219, t223, t249, t347, t349, ...1111
(forward)formula 0,0,13.9815,333416,1,0,529787,1080,6731,2.07642e+06,341,2791,1265208
FORMULA BusinessProcesses-PT-11-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 448 transition count 387
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 448 transition count 387
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 59 place count 441 transition count 380
Iterating global reduction 0 with 7 rules applied. Total rules applied 66 place count 441 transition count 380
Applied a total of 66 rules in 34 ms. Remains 441 /474 variables (removed 33) and now considering 380/413 (removed 33) transitions.
// Phase 1: matrix 380 rows 441 cols
[2024-05-21 23:51:45] [INFO ] Computed 91 invariants in 6 ms
[2024-05-21 23:51:46] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-05-21 23:51:46] [INFO ] Invariant cache hit.
[2024-05-21 23:51:46] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2024-05-21 23:51:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 3 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:51:53] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:51:54] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 63 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:51:55] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 60 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:51:56] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 3 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 3 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:52:04] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 5 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 4 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 87 places in 164 ms of which 2 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:52:05] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 3 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 2 ms to minimize.
[2024-05-21 23:52:06] [INFO ] Deduced a trap composed of 78 places in 166 ms of which 2 ms to minimize.
Problem TDEAD334 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 20/131 constraints. Problems are: Problem set: 11 solved, 368 unsolved
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 3 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:52:07] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 2 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 3 ms to minimize.
[2024-05-21 23:52:08] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 1 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 2 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 84 places in 173 ms of which 3 ms to minimize.
[2024-05-21 23:52:09] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 3 ms to minimize.
[2024-05-21 23:52:10] [INFO ] Deduced a trap composed of 88 places in 181 ms of which 2 ms to minimize.
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 20/151 constraints. Problems are: Problem set: 16 solved, 363 unsolved
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 36 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 1 ms to minimize.
[2024-05-21 23:52:13] [INFO ] Deduced a trap composed of 78 places in 169 ms of which 3 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 71 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 86 places in 177 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 86 places in 163 ms of which 2 ms to minimize.
[2024-05-21 23:52:14] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 1 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 1 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 84 places in 148 ms of which 1 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:52:15] [INFO ] Deduced a trap composed of 75 places in 185 ms of which 3 ms to minimize.
[2024-05-21 23:52:16] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 4 ms to minimize.
[2024-05-21 23:52:16] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 4 ms to minimize.
[2024-05-21 23:52:16] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 2 ms to minimize.
[2024-05-21 23:52:16] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 20/171 constraints. Problems are: Problem set: 16 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/821 variables, and 171 constraints, problems are : Problem set: 16 solved, 363 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/441 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 16 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 38/38 constraints. Problems are: Problem set: 16 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 16 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 51/89 constraints. Problems are: Problem set: 16 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 2/91 constraints. Problems are: Problem set: 16 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 80/171 constraints. Problems are: Problem set: 16 solved, 363 unsolved
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 2 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 4 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 81 places in 174 ms of which 5 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 2 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:52:20] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 2 ms to minimize.
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 1 ms to minimize.
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 3 ms to minimize.
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 96 places in 163 ms of which 3 ms to minimize.
[2024-05-21 23:52:21] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 4 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 81 places in 175 ms of which 4 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 78 places in 202 ms of which 2 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 2 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 82 places in 170 ms of which 2 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 78 places in 165 ms of which 2 ms to minimize.
[2024-05-21 23:52:22] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 2 ms to minimize.
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 20/191 constraints. Problems are: Problem set: 20 solved, 359 unsolved
[2024-05-21 23:52:23] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 81 places in 169 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 87 places in 192 ms of which 2 ms to minimize.
[2024-05-21 23:52:24] [INFO ] Deduced a trap composed of 86 places in 173 ms of which 4 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 3 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 3 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 3 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 6 ms to minimize.
[2024-05-21 23:52:25] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 3 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 3 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 81 places in 188 ms of which 2 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 5 ms to minimize.
[2024-05-21 23:52:26] [INFO ] Deduced a trap composed of 81 places in 168 ms of which 3 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 20/211 constraints. Problems are: Problem set: 20 solved, 359 unsolved
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 1 ms to minimize.
[2024-05-21 23:52:27] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 1 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 5 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 78 places in 199 ms of which 3 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 2 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 2 ms to minimize.
[2024-05-21 23:52:28] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 1 ms to minimize.
[2024-05-21 23:52:29] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 3 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-21 23:52:30] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 20/231 constraints. Problems are: Problem set: 20 solved, 359 unsolved
[2024-05-21 23:52:31] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-21 23:52:31] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 3 ms to minimize.
[2024-05-21 23:52:31] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 3 ms to minimize.
[2024-05-21 23:52:31] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 3 ms to minimize.
[2024-05-21 23:52:31] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 2 ms to minimize.
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 2 ms to minimize.
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 1 ms to minimize.
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 83 places in 157 ms of which 2 ms to minimize.
[2024-05-21 23:52:32] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 4 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 82 places in 172 ms of which 3 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 85 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 90 places in 170 ms of which 4 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 4 ms to minimize.
[2024-05-21 23:52:33] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 4 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 1 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 4 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 22 places in 176 ms of which 5 ms to minimize.
[2024-05-21 23:52:34] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 5 ms to minimize.
Problem TDEAD320 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 20/251 constraints. Problems are: Problem set: 21 solved, 358 unsolved
[2024-05-21 23:52:35] [INFO ] Deduced a trap composed of 77 places in 187 ms of which 4 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 5 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 4 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 71 places in 175 ms of which 2 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 2 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 2 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-21 23:52:36] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 76 places in 166 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 80 places in 174 ms of which 2 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 3 ms to minimize.
[2024-05-21 23:52:37] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 4 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 4 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 2 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 4 ms to minimize.
[2024-05-21 23:52:38] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 20/271 constraints. Problems are: Problem set: 21 solved, 358 unsolved
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 5 ms to minimize.
[2024-05-21 23:52:39] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 85 places in 201 ms of which 5 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 3 ms to minimize.
[2024-05-21 23:52:40] [INFO ] Deduced a trap composed of 73 places in 272 ms of which 6 ms to minimize.
[2024-05-21 23:52:41] [INFO ] Deduced a trap composed of 80 places in 223 ms of which 5 ms to minimize.
[2024-05-21 23:52:41] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 3 ms to minimize.
[2024-05-21 23:52:41] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 3 ms to minimize.
[2024-05-21 23:52:41] [INFO ] Deduced a trap composed of 77 places in 179 ms of which 2 ms to minimize.
[2024-05-21 23:52:42] [INFO ] Deduced a trap composed of 79 places in 207 ms of which 5 ms to minimize.
[2024-05-21 23:52:42] [INFO ] Deduced a trap composed of 80 places in 195 ms of which 6 ms to minimize.
[2024-05-21 23:52:42] [INFO ] Deduced a trap composed of 84 places in 193 ms of which 2 ms to minimize.
[2024-05-21 23:52:42] [INFO ] Deduced a trap composed of 81 places in 186 ms of which 6 ms to minimize.
[2024-05-21 23:52:42] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 78 places in 167 ms of which 4 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 4 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 4 ms to minimize.
[2024-05-21 23:52:43] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 3 ms to minimize.
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 20/291 constraints. Problems are: Problem set: 24 solved, 355 unsolved
[2024-05-21 23:52:44] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 40 ms to minimize.
[2024-05-21 23:52:45] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 3 ms to minimize.
[2024-05-21 23:52:46] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:52:46] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 2 ms to minimize.
[2024-05-21 23:52:46] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/821 variables, and 296 constraints, problems are : Problem set: 24 solved, 355 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/441 constraints, PredecessorRefiner: 0/379 constraints, Known Traps: 205/205 constraints]
After SMT, in 60132ms problems are : Problem set: 24 solved, 355 unsolved
Search for dead transitions found 24 dead transitions in 60139ms
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 : 441/474 places, 356/413 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 356
Applied a total of 1 rules in 6 ms. Remains 440 /441 variables (removed 1) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 440 cols
[2024-05-21 23:52:46] [INFO ] Computed 93 invariants in 2 ms
[2024-05-21 23:52:47] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-21 23:52:47] [INFO ] Invariant cache hit.
[2024-05-21 23:52:47] [INFO ] Implicit Places using invariants and state equation in 761 ms returned [58, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1024 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 438/474 places, 356/413 transitions.
Applied a total of 0 rules in 4 ms. Remains 438 /438 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61929 ms. Remains : 438/474 places, 356/413 transitions.
[2024-05-21 23:52:47] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:52:47] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:52:47] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-21 23:52:47] [INFO ] Flatten gal took : 19 ms
[2024-05-21 23:52:47] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:52:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality5476591897273954928.gal : 2 ms
[2024-05-21 23:52:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality17565235043935100730.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/CTLCardinality5476591897273954928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17565235043935100730.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,4.34065e+22,28.7479,557732,2,264763,5,1.40372e+06,6,0,2109,2.76386e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:53:17] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:53:17] [INFO ] Applying decomposition
[2024-05-21 23:53:18] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2154874931986368690.txt' '-o' '/tmp/graph2154874931986368690.bin' '-w' '/tmp/graph2154874931986368690.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2154874931986368690.bin' '-l' '-1' '-v' '-w' '/tmp/graph2154874931986368690.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:53:18] [INFO ] Decomposing Gal with order
[2024-05-21 23:53:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:53:18] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-21 23:53:18] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:53:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-21 23:53:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality13800427755906849753.gal : 6 ms
[2024-05-21 23:53:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality1410761693317415873.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/CTLCardinality13800427755906849753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1410761693317415873.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.34065e+22,0.790482,32432,4963,40,56487,607,961,91040,56,1680,0


Converting to forward existential form...Done !
original formula: AF((EX(AF(((i2.u52.p157!=0) * EX((i2.u51.p155==1))))) + (((i17.u122.p429==0) * AF(((i17.u122.p497==0)||(i13.i1.u111.p366==1)))) * EG(!(A(...225
=> equivalent forward existential formula: [FwdG(Init,!((EX(!(EG(!(((i2.u52.p157!=0) * EX((i2.u51.p155==1))))))) + (((i17.u122.p429==0) * !(EG(!(((i17.u122...393
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t10, t153, t173, t181, t189, t201, t213, t225, t243, t251, t348, t349, t351, i0.i0.u1...1231
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 413/413 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 449 transition count 388
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 449 transition count 388
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 443 transition count 382
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 443 transition count 382
Applied a total of 62 rules in 16 ms. Remains 443 /474 variables (removed 31) and now considering 382/413 (removed 31) transitions.
// Phase 1: matrix 382 rows 443 cols
[2024-05-21 23:53:48] [INFO ] Computed 91 invariants in 2 ms
[2024-05-21 23:53:48] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-21 23:53:48] [INFO ] Invariant cache hit.
[2024-05-21 23:53:49] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2024-05-21 23:53:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/443 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/443 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 381 unsolved
[2024-05-21 23:53:56] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 7 ms to minimize.
[2024-05-21 23:53:56] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 4 ms to minimize.
[2024-05-21 23:53:57] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 2 ms to minimize.
[2024-05-21 23:53:57] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 3 ms to minimize.
[2024-05-21 23:53:57] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:53:57] [INFO ] Deduced a trap composed of 82 places in 175 ms of which 3 ms to minimize.
[2024-05-21 23:53:57] [INFO ] Deduced a trap composed of 81 places in 173 ms of which 2 ms to minimize.
[2024-05-21 23:53:57] [INFO ] Deduced a trap composed of 76 places in 139 ms of which 2 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 80 places in 171 ms of which 2 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 73 places in 169 ms of which 2 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 78 places in 160 ms of which 4 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 2 ms to minimize.
[2024-05-21 23:53:58] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-05-21 23:53:59] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 4 ms to minimize.
[2024-05-21 23:53:59] [INFO ] Deduced a trap composed of 75 places in 145 ms of which 4 ms to minimize.
[2024-05-21 23:53:59] [INFO ] Deduced a trap composed of 85 places in 192 ms of which 2 ms to minimize.
[2024-05-21 23:53:59] [INFO ] Deduced a trap composed of 76 places in 223 ms of which 2 ms to minimize.
[2024-05-21 23:53:59] [INFO ] Deduced a trap composed of 77 places in 198 ms of which 3 ms to minimize.
[2024-05-21 23:54:00] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:54:00] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 5 ms to minimize.
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/443 variables, 20/111 constraints. Problems are: Problem set: 11 solved, 370 unsolved
[2024-05-21 23:54:00] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2024-05-21 23:54:00] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 7 ms to minimize.
[2024-05-21 23:54:00] [INFO ] Deduced a trap composed of 80 places in 156 ms of which 2 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 78 places in 183 ms of which 4 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 85 places in 179 ms of which 5 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 5 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 5 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 4 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 4 ms to minimize.
[2024-05-21 23:54:01] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 5 ms to minimize.
[2024-05-21 23:54:02] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 4 ms to minimize.
[2024-05-21 23:54:02] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 6 ms to minimize.
[2024-05-21 23:54:02] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 5 ms to minimize.
[2024-05-21 23:54:02] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 2 ms to minimize.
[2024-05-21 23:54:02] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-05-21 23:54:03] [INFO ] Deduced a trap composed of 78 places in 179 ms of which 2 ms to minimize.
[2024-05-21 23:54:03] [INFO ] Deduced a trap composed of 81 places in 161 ms of which 2 ms to minimize.
[2024-05-21 23:54:03] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 2 ms to minimize.
[2024-05-21 23:54:03] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:54:03] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 0 ms to minimize.
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 20/131 constraints. Problems are: Problem set: 14 solved, 367 unsolved
[2024-05-21 23:54:07] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 3 ms to minimize.
[2024-05-21 23:54:08] [INFO ] Deduced a trap composed of 97 places in 160 ms of which 2 ms to minimize.
[2024-05-21 23:54:08] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 3 ms to minimize.
[2024-05-21 23:54:09] [INFO ] Deduced a trap composed of 83 places in 193 ms of which 2 ms to minimize.
[2024-05-21 23:54:09] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 2 ms to minimize.
[2024-05-21 23:54:11] [INFO ] Deduced a trap composed of 103 places in 2639 ms of which 27 ms to minimize.
[2024-05-21 23:54:12] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 3 ms to minimize.
[2024-05-21 23:54:12] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-21 23:54:13] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 5 ms to minimize.
[2024-05-21 23:54:13] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 5 ms to minimize.
[2024-05-21 23:54:13] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 6 ms to minimize.
[2024-05-21 23:54:14] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 5 ms to minimize.
[2024-05-21 23:54:14] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 2 ms to minimize.
[2024-05-21 23:54:14] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 2 ms to minimize.
[2024-05-21 23:54:14] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
[2024-05-21 23:54:14] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 2 ms to minimize.
[2024-05-21 23:54:15] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 2 ms to minimize.
[2024-05-21 23:54:15] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 5 ms to minimize.
[2024-05-21 23:54:15] [INFO ] Deduced a trap composed of 67 places in 155 ms of which 3 ms to minimize.
[2024-05-21 23:54:15] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 5 ms to minimize.
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 20/151 constraints. Problems are: Problem set: 17 solved, 364 unsolved
[2024-05-21 23:54:18] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2024-05-21 23:54:18] [INFO ] Deduced a trap composed of 78 places in 179 ms of which 5 ms to minimize.
[2024-05-21 23:54:19] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 3 ms to minimize.
[2024-05-21 23:54:19] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 5 ms to minimize.
[2024-05-21 23:54:19] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 2 ms to minimize.
SMT process timed out in 30165ms, After SMT, problems are : Problem set: 17 solved, 364 unsolved
Search for dead transitions found 17 dead transitions in 30168ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 443/474 places, 365/413 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 442 transition count 365
Applied a total of 1 rules in 6 ms. Remains 442 /443 variables (removed 1) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 442 cols
[2024-05-21 23:54:19] [INFO ] Computed 91 invariants in 2 ms
[2024-05-21 23:54:19] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-21 23:54:19] [INFO ] Invariant cache hit.
[2024-05-21 23:54:20] [INFO ] Implicit Places using invariants and state equation in 778 ms returned [58, 59]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1025 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 440/474 places, 365/413 transitions.
Applied a total of 0 rules in 5 ms. Remains 440 /440 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 32192 ms. Remains : 440/474 places, 365/413 transitions.
[2024-05-21 23:54:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:54:20] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:54:20] [INFO ] Input system was already deterministic with 365 transitions.
[2024-05-21 23:54:20] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:54:20] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:54:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality9196829346576498437.gal : 2 ms
[2024-05-21 23:54:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality18173242974978239964.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/CTLCardinality9196829346576498437.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18173242974978239964.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,4.49929e+22,28.0513,543612,2,270936,5,1.43149e+06,6,0,2126,2.44902e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:54:50] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:54:50] [INFO ] Applying decomposition
[2024-05-21 23:54:50] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5961960541659997788.txt' '-o' '/tmp/graph5961960541659997788.bin' '-w' '/tmp/graph5961960541659997788.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5961960541659997788.bin' '-l' '-1' '-v' '-w' '/tmp/graph5961960541659997788.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:54:50] [INFO ] Decomposing Gal with order
[2024-05-21 23:54:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:54:50] [INFO ] Removed a total of 151 redundant transitions.
[2024-05-21 23:54:50] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:54:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2024-05-21 23:54:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality17501856169846338388.gal : 3 ms
[2024-05-21 23:54:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality9826873622269408191.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/CTLCardinality17501856169846338388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9826873622269408191.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.49929e+22,0.557044,24772,3100,48,40449,647,969,93370,64,1339,0


Converting to forward existential form...Done !
original formula: (EF(AG(((i15.i1.u95.p288==0)||(i17.i2.u89.p268==1)))) * (AF(EG(E((i16.u121.p415==0) U (i16.u135.p485==0)))) + EF(EX((i15.i0.u93.p280==0))...158
=> equivalent forward existential formula: ([(Init * !(E(TRUE U !(E(TRUE U !(((i15.i1.u95.p288==0)||(i17.i2.u89.p268==1))))))))] = FALSE * [FwdG((Init * !(...252
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t10, t163, t175, t183, t195, t203, t211, t219, t223, t227, t253, t360, i0.i0....1202
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
[2024-05-21 23:55:20] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:55:20] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:55:20] [INFO ] Applying decomposition
[2024-05-21 23:55:20] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12527635103020410036.txt' '-o' '/tmp/graph12527635103020410036.bin' '-w' '/tmp/graph12527635103020410036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12527635103020410036.bin' '-l' '-1' '-v' '-w' '/tmp/graph12527635103020410036.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:55:20] [INFO ] Decomposing Gal with order
[2024-05-21 23:55:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:55:20] [INFO ] Removed a total of 211 redundant transitions.
[2024-05-21 23:55:20] [INFO ] Flatten gal took : 30 ms
[2024-05-21 23:55:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:55:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality3337522319789881123.gal : 28 ms
[2024-05-21 23:55:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality5742030099490098064.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/CTLCardinality3337522319789881123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5742030099490098064.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.96896e+22,2.45666,65664,5087,124,115725,1178,1056,280844,87,3961,0


Converting to forward existential form...Done !
original formula: ((A(!((EG(EF(((i18.u133.p438==0)||(i4.i2.u127.p391==1)))) * EG((i12.i0.u92.p72==0)))) U EX(!((((i17.u130.p497==0)||(i3.i0.u152.p492==1))&...572
=> equivalent forward existential formula: (([((((EY((Init * (!((E(!(EX(!((((i17.u130.p497==0)||(i3.i0.u152.p492==1))&&(i3.i1.u57.p168==0))))) U (!(!((EG(E...1714
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t80, t184, t192, t208, t220, t228, t240, t248, t256, t275, t283, t408, i0.t204, i...1546
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found 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
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
[2024-05-22 00:21:17] [INFO ] Applying decomposition
[2024-05-22 00:21:17] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:21:17] [INFO ] Decomposing Gal with order
[2024-05-22 00:21:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:21:17] [INFO ] Removed a total of 114 redundant transitions.
[2024-05-22 00:21:17] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:21:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-22 00:21:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality13165956620418282556.gal : 5 ms
[2024-05-22 00:21:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality12996534681795543025.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/CTLCardinality13165956620418282556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12996534681795543025.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.96896e+22,622.886,9667124,104875,2140,3.75957e+06,15344,1635,1.23275e+08,476,53909,0


Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
[2024-05-22 00:36:18] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:36:18] [INFO ] Input system was already deterministic with 413 transitions.
[2024-05-22 00:36:18] [INFO ] Transformed 474 places.
[2024-05-22 00:36:18] [INFO ] Transformed 413 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:36:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality2908871967746066509.gal : 2 ms
[2024-05-22 00:36:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality3969241885632707551.ctl : 8 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/CTLCardinality2908871967746066509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3969241885632707551.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 5 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-11"
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-11, 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-171620399700529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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