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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 159K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716336579520

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 00:09:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:09:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:09:41] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-22 00:09:41] [INFO ] Transformed 638 places.
[2024-05-22 00:09:41] [INFO ] Transformed 578 transitions.
[2024-05-22 00:09:41] [INFO ] Found NUPN structural information;
[2024-05-22 00:09:41] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 8 places in 10 ms
Reduce places removed 8 places and 8 transitions.
Support contains 125 out of 630 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 630/630 places, 570/570 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 625 transition count 570
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 78 place count 552 transition count 497
Iterating global reduction 1 with 73 rules applied. Total rules applied 151 place count 552 transition count 497
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 185 place count 518 transition count 463
Iterating global reduction 1 with 34 rules applied. Total rules applied 219 place count 518 transition count 463
Applied a total of 219 rules in 116 ms. Remains 518 /630 variables (removed 112) and now considering 463/570 (removed 107) transitions.
// Phase 1: matrix 463 rows 518 cols
[2024-05-22 00:09:41] [INFO ] Computed 95 invariants in 42 ms
[2024-05-22 00:09:41] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-22 00:09:41] [INFO ] Invariant cache hit.
[2024-05-22 00:09:42] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-05-22 00:09:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/517 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/517 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (OVERLAPS) 1/518 variables, 57/94 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 10 ms to minimize.
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 4 ms to minimize.
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 116 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 113 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 109 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 110 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:09:53] [INFO ] Deduced a trap composed of 112 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:09:53] [INFO ] Deduced a trap composed of 117 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:09:53] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:09:53] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:09:53] [INFO ] Deduced a trap composed of 112 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:09:53] [INFO ] Deduced a trap composed of 118 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:09:53] [INFO ] Deduced a trap composed of 102 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:09:53] [INFO ] Deduced a trap composed of 110 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 113 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 4 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 109 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 108 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 112 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 117 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 113 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 110 places in 143 ms of which 4 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 109 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 110 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 4 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 119 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 11 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 117 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 115 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:10:04] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:10:04] [INFO ] Deduced a trap composed of 102 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:10:04] [INFO ] Deduced a trap composed of 120 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:10:04] [INFO ] Deduced a trap composed of 113 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:10:04] [INFO ] Deduced a trap composed of 105 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:10:04] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:10:05] [INFO ] Deduced a trap composed of 113 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:10:05] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:10:05] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:10:05] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:10:05] [INFO ] Deduced a trap composed of 112 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:10:05] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:10:05] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:10:06] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:10:06] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:10:06] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:10:06] [INFO ] Deduced a trap composed of 117 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:10:06] [INFO ] Deduced a trap composed of 105 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:10:06] [INFO ] Deduced a trap composed of 123 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 111 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 118 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 112 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 119 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 113 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD408 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 20/195 constraints. Problems are: Problem set: 3 solved, 459 unsolved
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 115 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 110 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 109 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 4 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 114 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:10:11] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:10:12] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 2 ms to minimize.
SMT process timed out in 30220ms, After SMT, problems are : Problem set: 3 solved, 459 unsolved
Search for dead transitions found 3 dead transitions in 30236ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 518/630 places, 460/570 transitions.
Applied a total of 0 rules in 20 ms. Remains 518 /518 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31176 ms. Remains : 518/630 places, 460/570 transitions.
Support contains 125 out of 518 places after structural reductions.
[2024-05-22 00:10:12] [INFO ] Flatten gal took : 73 ms
[2024-05-22 00:10:12] [INFO ] Flatten gal took : 35 ms
[2024-05-22 00:10:12] [INFO ] Input system was already deterministic with 460 transitions.
Support contains 124 out of 518 places (down from 125) after GAL structural reductions.
RANDOM walk for 40000 steps (262 resets) in 1660 ms. (24 steps per ms) remains 35/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
// Phase 1: matrix 460 rows 518 cols
[2024-05-22 00:10:13] [INFO ] Computed 95 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 280/349 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 64/413 variables, 18/57 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 96/509 variables, 38/95 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:10:14] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 96 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 4 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 4 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 4 ms to minimize.
[2024-05-22 00:10:15] [INFO ] Deduced a trap composed of 50 places in 134 ms of which 4 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 4 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:10:16] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:10:17] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:10:17] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:10:17] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:10:17] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:10:17] [INFO ] Deduced a trap composed of 96 places in 170 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-22 00:10:18] [INFO ] Deduced a trap composed of 99 places in 178 ms of which 4 ms to minimize.
[2024-05-22 00:10:18] [INFO ] Deduced a trap composed of 104 places in 185 ms of which 5 ms to minimize.
[2024-05-22 00:10:18] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:10:18] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:10:18] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 3 ms to minimize.
SMT process timed out in 5088ms, After SMT, problems are : Problem set: 0 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 69 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 460/460 transitions.
Graph (complete) has 1143 edges and 518 vertex of which 517 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 517 transition count 408
Reduce places removed 51 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 54 rules applied. Total rules applied 106 place count 466 transition count 405
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 109 place count 463 transition count 405
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 109 place count 463 transition count 326
Deduced a syphon composed of 79 places in 3 ms
Ensure Unique test removed 11 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 169 rules applied. Total rules applied 278 place count 373 transition count 326
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 294 place count 357 transition count 310
Iterating global reduction 3 with 16 rules applied. Total rules applied 310 place count 357 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 310 place count 357 transition count 309
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 312 place count 356 transition count 309
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 313 place count 355 transition count 308
Iterating global reduction 3 with 1 rules applied. Total rules applied 314 place count 355 transition count 308
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 521 place count 251 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 522 place count 251 transition count 204
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 4 with 2 rules applied. Total rules applied 524 place count 250 transition count 208
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 531 place count 250 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 532 place count 249 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 533 place count 248 transition count 207
Applied a total of 533 rules in 186 ms. Remains 248 /518 variables (removed 270) and now considering 207/460 (removed 253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 248/518 places, 207/460 transitions.
RANDOM walk for 40000 steps (1792 resets) in 1113 ms. (35 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (36 resets) in 25 ms. (154 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (24 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (31 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (32 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (33 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (36 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (31 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (33 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (34 resets) in 21 ms. (182 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (34 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (34 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (36 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (32 resets) in 46 ms. (85 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (33 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (34 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (31 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (31 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (35 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (33 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (36 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (23 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (33 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (30 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (34 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (24 resets) in 11 ms. (333 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (34 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (34 resets) in 10 ms. (363 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (33 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (32 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
Interrupted probabilistic random walk after 371891 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :12 out of 35
Probabilistic random walk after 371891 steps, saw 61596 distinct states, run finished after 3005 ms. (steps per millisecond=123 ) properties seen :12
// Phase 1: matrix 207 rows 248 cols
[2024-05-22 00:10:22] [INFO ] Computed 82 invariants in 3 ms
[2024-05-22 00:10:22] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 126/173 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 27/200 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 39/239 variables, 25/79 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 63 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
Problem AtomicPropp30 is UNSAT
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
Problem AtomicPropp31 is UNSAT
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 14 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 20/119 constraints. Problems are: Problem set: 3 solved, 20 unsolved
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
Problem AtomicPropp45 is UNSAT
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
Problem AtomicPropp48 is UNSAT
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
Problem AtomicPropp54 is UNSAT
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 2 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
Problem AtomicPropp64 is UNSAT
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 20/139 constraints. Problems are: Problem set: 7 solved, 16 unsolved
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 52 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 2 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 4/143 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/143 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 207/446 variables, 239/382 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 4/386 constraints. Problems are: Problem set: 7 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/386 constraints. Problems are: Problem set: 7 solved, 16 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 14 (OVERLAPS) 9/455 variables, 9/395 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/455 variables, 3/398 constraints. Problems are: Problem set: 10 solved, 13 unsolved
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/455 variables, 3/401 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/455 variables, 0/401 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 0/455 variables, 0/401 constraints. Problems are: Problem set: 10 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 401 constraints, problems are : Problem set: 10 solved, 13 unsolved in 6707 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 248/248 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 10 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 101/121 variables, 18/18 constraints. Problems are: Problem set: 10 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 1/19 constraints. Problems are: Problem set: 10 solved, 13 unsolved
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
Problem AtomicPropp10 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 8/27 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/27 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 66/187 variables, 36/63 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 2/65 constraints. Problems are: Problem set: 11 solved, 12 unsolved
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 20/85 constraints. Problems are: Problem set: 11 solved, 12 unsolved
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 3 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 20/105 constraints. Problems are: Problem set: 11 solved, 12 unsolved
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 56 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 3 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 20/125 constraints. Problems are: Problem set: 11 solved, 12 unsolved
[2024-05-22 00:10:33] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 2 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 56 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 2 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 57 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 7/132 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/132 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 52/239 variables, 25/157 constraints. Problems are: Problem set: 11 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 64/221 constraints. Problems are: Problem set: 11 solved, 12 unsolved
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
Problem AtomicPropp34 is UNSAT
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:10:34] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
Problem AtomicPropp34 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 20/241 constraints. Problems are: Problem set: 12 solved, 11 unsolved
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 20/261 constraints. Problems are: Problem set: 12 solved, 11 unsolved
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 55 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:10:39] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:10:39] [INFO ] Deduced a trap composed of 53 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:10:39] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:10:39] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:10:39] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:10:39] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:10:39] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/239 variables, 20/281 constraints. Problems are: Problem set: 12 solved, 11 unsolved
[2024-05-22 00:10:39] [INFO ] Deduced a trap composed of 58 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:10:39] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:10:42] [INFO ] Deduced a trap composed of 54 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:10:42] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:10:42] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/239 variables, 20/301 constraints. Problems are: Problem set: 12 solved, 11 unsolved
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 57 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 4 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 11 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:10:45] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/239 variables, 18/319 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/239 variables, 0/319 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 207/446 variables, 239/558 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/446 variables, 4/562 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/446 variables, 10/572 constraints. Problems are: Problem set: 12 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/446 variables, 0/572 constraints. Problems are: Problem set: 12 solved, 11 unsolved
Problem AtomicPropp66 is UNSAT
At refinement iteration 24 (OVERLAPS) 9/455 variables, 9/581 constraints. Problems are: Problem set: 13 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/455 variables, 3/584 constraints. Problems are: Problem set: 13 solved, 10 unsolved
[2024-05-22 00:10:46] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:10:46] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:10:46] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:10:46] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:10:46] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/455 variables, 5/589 constraints. Problems are: Problem set: 13 solved, 10 unsolved
[2024-05-22 00:10:47] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/455 variables, 1/590 constraints. Problems are: Problem set: 13 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/455 variables, 0/590 constraints. Problems are: Problem set: 13 solved, 10 unsolved
At refinement iteration 29 (OVERLAPS) 0/455 variables, 0/590 constraints. Problems are: Problem set: 13 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 455/455 variables, and 590 constraints, problems are : Problem set: 13 solved, 10 unsolved in 19376 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 248/248 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 10/23 constraints, Known Traps: 246/246 constraints]
After SMT, in 26127ms problems are : Problem set: 13 solved, 10 unsolved
Parikh walk visited 3 properties in 1896 ms.
Support contains 9 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 207/207 transitions.
Graph (trivial) has 48 edges and 248 vertex of which 2 / 248 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 247 transition count 197
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 239 transition count 197
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 17 place count 239 transition count 179
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 59 place count 215 transition count 179
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 210 transition count 174
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 210 transition count 174
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 69 place count 210 transition count 172
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 73 place count 208 transition count 172
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 129 place count 178 transition count 146
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 131 place count 177 transition count 157
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 177 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 135 place count 175 transition count 155
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 137 place count 173 transition count 153
Applied a total of 137 rules in 49 ms. Remains 173 /248 variables (removed 75) and now considering 153/207 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 173/248 places, 153/207 transitions.
RANDOM walk for 40000 steps (1622 resets) in 284 ms. (140 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (742 resets) in 240 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (797 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (810 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (259 resets) in 67 ms. (588 steps per ms) remains 1/4 properties
// Phase 1: matrix 153 rows 173 cols
[2024-05-22 00:10:51] [INFO ] Computed 72 invariants in 2 ms
[2024-05-22 00:10:51] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/13 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 104/117 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 36/153 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 21/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/171 variables, 17/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 43/214 variables, 16/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/214 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 5/219 variables, 5/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/219 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/221 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/221 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 104/325 variables, 118/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/325 variables, 25/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/325 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/325 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1/326 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/326 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/326 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 250 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 173/173 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/13 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 104/117 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 36/153 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 21/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/171 variables, 17/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/171 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 43/214 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/214 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/219 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/219 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/221 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/221 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 104/325 variables, 118/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/325 variables, 25/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/325 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/325 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/326 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/326 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/326 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 251 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 173/173 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 327ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 65 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=65 )
Parikh walk visited 1 properties in 3 ms.
Successfully simplified 13 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:10:51] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-22 00:10:51] [INFO ] Flatten gal took : 50 ms
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:10:51] [INFO ] Flatten gal took : 47 ms
[2024-05-22 00:10:51] [INFO ] Input system was already deterministic with 460 transitions.
Support contains 67 out of 518 places (down from 87) after GAL structural reductions.
Computed a total of 142 stabilizing places and 135 stable transitions
Graph (complete) has 1143 edges and 518 vertex of which 517 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.37 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Graph (trivial) has 261 edges and 518 vertex of which 6 / 518 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1137 edges and 513 vertex of which 512 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 511 transition count 382
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 441 transition count 382
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 142 place count 441 transition count 281
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 219 rules applied. Total rules applied 361 place count 323 transition count 281
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 396 place count 288 transition count 246
Ensure Unique test removed 1 places
Iterating global reduction 2 with 36 rules applied. Total rules applied 432 place count 287 transition count 246
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 432 place count 287 transition count 242
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 440 place count 283 transition count 242
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 664 place count 169 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 665 place count 168 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 666 place count 167 transition count 131
Applied a total of 666 rules in 83 ms. Remains 167 /518 variables (removed 351) and now considering 131/460 (removed 329) transitions.
// Phase 1: matrix 131 rows 167 cols
[2024-05-22 00:10:51] [INFO ] Computed 72 invariants in 2 ms
[2024-05-22 00:10:52] [INFO ] Implicit Places using invariants in 178 ms returned [0, 1, 2, 3, 4, 5, 6, 14, 15, 19, 20, 21, 22, 26, 49, 50, 51, 52]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 180 ms to find 18 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 149/518 places, 131/460 transitions.
Applied a total of 0 rules in 5 ms. Remains 149 /149 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 270 ms. Remains : 149/518 places, 131/460 transitions.
[2024-05-22 00:10:52] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:10:52] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:10:52] [INFO ] Input system was already deterministic with 131 transitions.
[2024-05-22 00:10:52] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:10:52] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:10:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2558906872487275583.gal : 5 ms
[2024-05-22 00:10:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4203653515216997102.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2558906872487275583.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4203653515216997102.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (8383 resets) in 458 ms. (87 steps per ms) remains 1/1 properties

BEST_FIRST walk for 40002 steps (2433 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Finished probabilistic random walk after 6001 steps, run visited all 1 properties in 28 ms. (steps per millisecond=214 )
Probabilistic random walk after 6001 steps, saw 1831 distinct states, run finished after 31 ms. (steps per millisecond=193 ) properties seen :1
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 481 transition count 423
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 481 transition count 423
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 84 place count 471 transition count 413
Iterating global reduction 0 with 10 rules applied. Total rules applied 94 place count 471 transition count 413
Applied a total of 94 rules in 36 ms. Remains 471 /518 variables (removed 47) and now considering 413/460 (removed 47) transitions.
// Phase 1: matrix 413 rows 471 cols
[2024-05-22 00:10:52] [INFO ] Computed 95 invariants in 4 ms
[2024-05-22 00:10:52] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-22 00:10:52] [INFO ] Invariant cache hit.
[2024-05-22 00:10:53] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-22 00:10:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/471 variables, 58/88 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 00:11:00] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 3 ms to minimize.
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 20/115 constraints. Problems are: Problem set: 16 solved, 396 unsolved
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 94 places in 161 ms of which 2 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 76 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 77 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 20/135 constraints. Problems are: Problem set: 16 solved, 396 unsolved
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:08] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:11:08] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:11:08] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:11:08] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:11:08] [INFO ] Deduced a trap composed of 79 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:11:08] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:11:08] [INFO ] Deduced a trap composed of 84 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:11:09] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:11:09] [INFO ] Deduced a trap composed of 77 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:11:09] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:11:09] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:11:09] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 20/155 constraints. Problems are: Problem set: 16 solved, 396 unsolved
[2024-05-22 00:11:12] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:11:12] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 4 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 97 places in 170 ms of which 4 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 86 places in 138 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 20/175 constraints. Problems are: Problem set: 16 solved, 396 unsolved
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 85 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 83 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:11:18] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:11:18] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:11:18] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-05-22 00:11:18] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:11:18] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:11:19] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:11:19] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:11:19] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:11:19] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:11:19] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
Problem TDEAD313 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 20/195 constraints. Problems are: Problem set: 21 solved, 391 unsolved
[2024-05-22 00:11:20] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:11:20] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:11:20] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:11:20] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:11:21] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:11:21] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 5 ms to minimize.
[2024-05-22 00:11:21] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:11:21] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:11:21] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:11:23] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:11:23] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/884 variables, and 214 constraints, problems are : Problem set: 21 solved, 391 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/471 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 119/119 constraints]
Escalating to Integer solving :Problem set: 21 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 30/30 constraints. Problems are: Problem set: 21 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/30 constraints. Problems are: Problem set: 21 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 1/471 variables, 58/88 constraints. Problems are: Problem set: 21 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 7/95 constraints. Problems are: Problem set: 21 solved, 391 unsolved
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD356 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 119/214 constraints. Problems are: Problem set: 26 solved, 386 unsolved
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 94 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 18 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 20/234 constraints. Problems are: Problem set: 26 solved, 386 unsolved
[2024-05-22 00:11:29] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:11:29] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:29] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 6 ms to minimize.
[2024-05-22 00:11:29] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:11:29] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:11:29] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:11:29] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:11:29] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 20/254 constraints. Problems are: Problem set: 26 solved, 386 unsolved
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:11:33] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:33] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:11:33] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:11:33] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:11:33] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:33] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:33] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 77 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 76 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 20/274 constraints. Problems are: Problem set: 26 solved, 386 unsolved
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 0 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 80 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 80 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 3 ms to minimize.
Problem TDEAD316 is UNSAT
Problem TDEAD344 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 20/294 constraints. Problems are: Problem set: 28 solved, 384 unsolved
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:41] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:11:41] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:11:41] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:11:41] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:11:41] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:11:41] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 78 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 20/314 constraints. Problems are: Problem set: 28 solved, 384 unsolved
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 5 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
Problem TDEAD335 is UNSAT
Problem TDEAD341 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 20/334 constraints. Problems are: Problem set: 30 solved, 382 unsolved
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 4 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 5 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 48 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 79 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:11:52] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:11:53] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:11:53] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:11:53] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/884 variables, and 353 constraints, problems are : Problem set: 30 solved, 382 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/471 constraints, PredecessorRefiner: 0/412 constraints, Known Traps: 258/258 constraints]
After SMT, in 60289ms problems are : Problem set: 30 solved, 382 unsolved
Search for dead transitions found 30 dead transitions in 60293ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 471/518 places, 383/460 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 469 transition count 383
Applied a total of 2 rules in 24 ms. Remains 469 /471 variables (removed 2) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 469 cols
[2024-05-22 00:11:53] [INFO ] Computed 99 invariants in 7 ms
[2024-05-22 00:11:53] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-22 00:11:53] [INFO ] Invariant cache hit.
[2024-05-22 00:11:54] [INFO ] Implicit Places using invariants and state equation in 518 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 802 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 468/518 places, 383/460 transitions.
Applied a total of 0 rules in 9 ms. Remains 468 /468 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61802 ms. Remains : 468/518 places, 383/460 transitions.
[2024-05-22 00:11:54] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:11:54] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:11:54] [INFO ] Input system was already deterministic with 383 transitions.
[2024-05-22 00:11:54] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:11:54] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:11:54] [INFO ] Time to serialize gal into /tmp/CTLFireability1579300568611143588.gal : 4 ms
[2024-05-22 00:11:54] [INFO ] Time to serialize properties into /tmp/CTLFireability1698581075073320481.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1579300568611143588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1698581075073320481.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-22 00:12:24] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:12:24] [INFO ] Applying decomposition
[2024-05-22 00:12:24] [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/graph7253858639508107993.txt' '-o' '/tmp/graph7253858639508107993.bin' '-w' '/tmp/graph7253858639508107993.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7253858639508107993.bin' '-l' '-1' '-v' '-w' '/tmp/graph7253858639508107993.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:12:24] [INFO ] Decomposing Gal with order
[2024-05-22 00:12:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:12:24] [INFO ] Removed a total of 135 redundant transitions.
[2024-05-22 00:12:24] [INFO ] Flatten gal took : 98 ms
[2024-05-22 00:12:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 42 ms.
[2024-05-22 00:12:24] [INFO ] Time to serialize gal into /tmp/CTLFireability9841071777113372374.gal : 21 ms
[2024-05-22 00:12:24] [INFO ] Time to serialize properties into /tmp/CTLFireability11810237935163232864.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/CTLFireability9841071777113372374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11810237935163232864.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07055e+27,9.5463,253932,18549,39,347987,631,970,1.08191e+06,64,1426,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 483 transition count 425
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 483 transition count 425
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 79 place count 474 transition count 416
Iterating global reduction 0 with 9 rules applied. Total rules applied 88 place count 474 transition count 416
Applied a total of 88 rules in 41 ms. Remains 474 /518 variables (removed 44) and now considering 416/460 (removed 44) transitions.
// Phase 1: matrix 416 rows 474 cols
[2024-05-22 00:12:54] [INFO ] Computed 95 invariants in 8 ms
[2024-05-22 00:12:55] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-22 00:12:55] [INFO ] Invariant cache hit.
[2024-05-22 00:12:55] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2024-05-22 00:12:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/474 variables, 57/94 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 101 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 105 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 2 ms to minimize.
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 20/115 constraints. Problems are: Problem set: 6 solved, 409 unsolved
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
Problem TDEAD341 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 20/135 constraints. Problems are: Problem set: 7 solved, 408 unsolved
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 109 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 20/155 constraints. Problems are: Problem set: 18 solved, 397 unsolved
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 89 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 20/175 constraints. Problems are: Problem set: 22 solved, 393 unsolved
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 20/195 constraints. Problems are: Problem set: 27 solved, 388 unsolved
[2024-05-22 00:13:20] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:13:20] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 106 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:22] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 125 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 35 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 5 ms to minimize.
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 20/215 constraints. Problems are: Problem set: 30 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/890 variables, and 215 constraints, problems are : Problem set: 30 solved, 385 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/474 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 30 solved, 385 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 37/37 constraints. Problems are: Problem set: 30 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/37 constraints. Problems are: Problem set: 30 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/474 variables, 57/94 constraints. Problems are: Problem set: 30 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/474 variables, 1/95 constraints. Problems are: Problem set: 30 solved, 385 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 120/215 constraints. Problems are: Problem set: 30 solved, 385 unsolved
[2024-05-22 00:13:28] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 7 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:29] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 20/235 constraints. Problems are: Problem set: 30 solved, 385 unsolved
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:13:35] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:13:35] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:13:35] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:35] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:13:35] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:35] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:13:35] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 20/255 constraints. Problems are: Problem set: 30 solved, 385 unsolved
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 68 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 69 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 20/275 constraints. Problems are: Problem set: 30 solved, 385 unsolved
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 5 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 20/295 constraints. Problems are: Problem set: 30 solved, 385 unsolved
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 83 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 1 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 89 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 20/315 constraints. Problems are: Problem set: 30 solved, 385 unsolved
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:13:53] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 20/335 constraints. Problems are: Problem set: 30 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/890 variables, and 335 constraints, problems are : Problem set: 30 solved, 385 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/474 constraints, PredecessorRefiner: 0/415 constraints, Known Traps: 240/240 constraints]
After SMT, in 60131ms problems are : Problem set: 30 solved, 385 unsolved
Search for dead transitions found 30 dead transitions in 60135ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 474/518 places, 386/460 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 386
Applied a total of 1 rules in 15 ms. Remains 473 /474 variables (removed 1) and now considering 386/386 (removed 0) transitions.
// Phase 1: matrix 386 rows 473 cols
[2024-05-22 00:13:55] [INFO ] Computed 100 invariants in 3 ms
[2024-05-22 00:13:56] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 00:13:56] [INFO ] Invariant cache hit.
[2024-05-22 00:13:56] [INFO ] Implicit Places using invariants and state equation in 464 ms returned [149, 150]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 659 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 471/518 places, 386/460 transitions.
Applied a total of 0 rules in 8 ms. Remains 471 /471 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61668 ms. Remains : 471/518 places, 386/460 transitions.
[2024-05-22 00:13:56] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:13:56] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:13:56] [INFO ] Input system was already deterministic with 386 transitions.
[2024-05-22 00:13:56] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:13:56] [INFO ] Flatten gal took : 29 ms
[2024-05-22 00:13:56] [INFO ] Time to serialize gal into /tmp/CTLFireability12814816464425082870.gal : 3 ms
[2024-05-22 00:13:56] [INFO ] Time to serialize properties into /tmp/CTLFireability5846442323586206793.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/CTLFireability12814816464425082870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5846442323586206793.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.14281e+27,10.1233,282748,24467,39,478674,597,978,1.05708e+06,66,1351,0


Converting to forward existential form...Done !
original formula: E((i18.u138.p523==1) U EX(EF(EX((i13.i2.u108.p353==1)))))
=> equivalent forward existential formula: [(EY(FwdU(EY(FwdU(Init,(i18.u138.p523==1))),TRUE)) * (i13.i2.u108.p353==1))] != FALSE
(forward)formula 0,1,17.9154,361684,1,0,647805,597,2351,1.46909e+06,112,1351,1491239
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 483 transition count 425
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 483 transition count 425
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 475 transition count 417
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 475 transition count 417
Applied a total of 86 rules in 38 ms. Remains 475 /518 variables (removed 43) and now considering 417/460 (removed 43) transitions.
// Phase 1: matrix 417 rows 475 cols
[2024-05-22 00:14:45] [INFO ] Computed 95 invariants in 4 ms
[2024-05-22 00:14:45] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-22 00:14:45] [INFO ] Invariant cache hit.
[2024-05-22 00:14:45] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-22 00:14:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 1/475 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-22 00:14:53] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 5 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 1 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 2 ms to minimize.
Problem TDEAD315 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 20/115 constraints. Problems are: Problem set: 9 solved, 407 unsolved
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 1 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 111 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 35 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:14:58] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:14:58] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:14:58] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:14:58] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:14:59] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:14:59] [INFO ] Deduced a trap composed of 65 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:14:59] [INFO ] Deduced a trap composed of 82 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:14:59] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:14:59] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:15:00] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 2 ms to minimize.
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 20/135 constraints. Problems are: Problem set: 20 solved, 396 unsolved
[2024-05-22 00:15:00] [INFO ] Deduced a trap composed of 93 places in 173 ms of which 2 ms to minimize.
[2024-05-22 00:15:00] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:15:00] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:15:00] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 20/155 constraints. Problems are: Problem set: 20 solved, 396 unsolved
[2024-05-22 00:15:05] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 86 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:15:07] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:15:07] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:15:07] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:15:07] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:15:07] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:15:07] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 66 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 1 ms to minimize.
Problem TDEAD316 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 20/175 constraints. Problems are: Problem set: 29 solved, 387 unsolved
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 20/195 constraints. Problems are: Problem set: 29 solved, 387 unsolved
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 20/215 constraints. Problems are: Problem set: 29 solved, 387 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/892 variables, and 215 constraints, problems are : Problem set: 29 solved, 387 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/475 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 29 solved, 387 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 37/37 constraints. Problems are: Problem set: 29 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/37 constraints. Problems are: Problem set: 29 solved, 387 unsolved
At refinement iteration 2 (OVERLAPS) 1/475 variables, 56/93 constraints. Problems are: Problem set: 29 solved, 387 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 2/95 constraints. Problems are: Problem set: 29 solved, 387 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 120/215 constraints. Problems are: Problem set: 29 solved, 387 unsolved
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 106 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
Problem TDEAD317 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 20/235 constraints. Problems are: Problem set: 32 solved, 384 unsolved
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 86 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:15:25] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 20/255 constraints. Problems are: Problem set: 32 solved, 384 unsolved
[2024-05-22 00:15:25] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:15:25] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 20/275 constraints. Problems are: Problem set: 32 solved, 384 unsolved
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 20/295 constraints. Problems are: Problem set: 32 solved, 384 unsolved
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 102 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:15:35] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:15:35] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 20/315 constraints. Problems are: Problem set: 32 solved, 384 unsolved
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 65 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/475 variables, 20/335 constraints. Problems are: Problem set: 32 solved, 384 unsolved
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
Problem TDEAD347 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 20/355 constraints. Problems are: Problem set: 33 solved, 383 unsolved
[2024-05-22 00:15:43] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:15:43] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 111 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/892 variables, and 366 constraints, problems are : Problem set: 33 solved, 383 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/475 constraints, PredecessorRefiner: 0/416 constraints, Known Traps: 271/271 constraints]
After SMT, in 60139ms problems are : Problem set: 33 solved, 383 unsolved
Search for dead transitions found 33 dead transitions in 60145ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 475/518 places, 384/460 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 472 transition count 384
Applied a total of 3 rules in 9 ms. Remains 472 /475 variables (removed 3) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 472 cols
[2024-05-22 00:15:45] [INFO ] Computed 101 invariants in 3 ms
[2024-05-22 00:15:46] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 00:15:46] [INFO ] Invariant cache hit.
[2024-05-22 00:15:46] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 472/518 places, 384/460 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61473 ms. Remains : 472/518 places, 384/460 transitions.
[2024-05-22 00:15:46] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:15:46] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:15:46] [INFO ] Input system was already deterministic with 384 transitions.
[2024-05-22 00:15:46] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:15:46] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:15:46] [INFO ] Time to serialize gal into /tmp/CTLFireability2907539664762847585.gal : 2 ms
[2024-05-22 00:15:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12568456017367962261.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/CTLFireability2907539664762847585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12568456017367962261.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07058e+27,3.89344,118832,14189,42,203175,803,890,439385,62,1802,0


Converting to forward existential form...Done !
original formula: AX(((AX(EG(((i18.i0.i1.u57.p187==0)||(i18.i0.i1.u151.p583==0)))) * (i0.u0.p0==0)) * (!(A((i17.u149.p577==1) U (((i8.u24.p76==1)&&(i8.u125...297
=> equivalent forward existential formula: (([(EY(EY(Init)) * !(EG(((i18.i0.i1.u57.p187==0)||(i18.i0.i1.u151.p583==0)))))] = FALSE * [(EY(Init) * !((i0.u0....657
Reverse transition relation is NOT exact ! Due to transitions t7, t173, t245, t267, t281, t352, t353, t361, t362, t369, t373, t376, t378, i0.u79.t167, i0.u...1221
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 484 transition count 426
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 484 transition count 426
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 475 transition count 417
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 475 transition count 417
Applied a total of 86 rules in 39 ms. Remains 475 /518 variables (removed 43) and now considering 417/460 (removed 43) transitions.
// Phase 1: matrix 417 rows 475 cols
[2024-05-22 00:16:46] [INFO ] Computed 95 invariants in 3 ms
[2024-05-22 00:16:47] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-22 00:16:47] [INFO ] Invariant cache hit.
[2024-05-22 00:16:47] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-22 00:16:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 1/475 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-22 00:16:55] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:16:55] [INFO ] Deduced a trap composed of 99 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:16:55] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:16:55] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:16:55] [INFO ] Deduced a trap composed of 101 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:16:55] [INFO ] Deduced a trap composed of 102 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:16:55] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:16:56] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:16:56] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:16:56] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:16:56] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:16:56] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:16:56] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:16:56] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:16:56] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:16:57] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:16:57] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:16:57] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:16:57] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:16:57] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 20/115 constraints. Problems are: Problem set: 21 solved, 395 unsolved
[2024-05-22 00:16:57] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:16:57] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:16:58] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:16:58] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:16:58] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:16:58] [INFO ] Deduced a trap composed of 107 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:16:58] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:16:58] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:16:58] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:16:58] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:16:59] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:16:59] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:16:59] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:16:59] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:16:59] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:16:59] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:16:59] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:00] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:17:00] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:17:00] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 20/135 constraints. Problems are: Problem set: 21 solved, 395 unsolved
[2024-05-22 00:17:00] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:17:00] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:17:01] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:17:01] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:17:01] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:17:01] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:17:01] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:17:01] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:17:01] [INFO ] Deduced a trap composed of 84 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:17:01] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:17:02] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:17:02] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:17:02] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:17:02] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:17:02] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:17:02] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:17:02] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:17:02] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:17:02] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:17:03] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 20/155 constraints. Problems are: Problem set: 21 solved, 395 unsolved
[2024-05-22 00:17:05] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:17:05] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 87 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:17:08] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:17:08] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 20/175 constraints. Problems are: Problem set: 21 solved, 395 unsolved
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 79 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 78 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 94 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
Problem TDEAD325 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 20/195 constraints. Problems are: Problem set: 24 solved, 392 unsolved
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 1 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 20/215 constraints. Problems are: Problem set: 24 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 475/892 variables, and 215 constraints, problems are : Problem set: 24 solved, 392 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/475 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 24 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 37/37 constraints. Problems are: Problem set: 24 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/37 constraints. Problems are: Problem set: 24 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/475 variables, 56/93 constraints. Problems are: Problem set: 24 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 2/95 constraints. Problems are: Problem set: 24 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 120/215 constraints. Problems are: Problem set: 24 solved, 392 unsolved
[2024-05-22 00:17:20] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:17:20] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
Problem TDEAD315 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 20/235 constraints. Problems are: Problem set: 29 solved, 387 unsolved
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 74 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 79 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 20/255 constraints. Problems are: Problem set: 29 solved, 387 unsolved
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:28] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:28] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:17:28] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:17:28] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:17:28] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:17:28] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:17:28] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 20/275 constraints. Problems are: Problem set: 29 solved, 387 unsolved
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 69 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:17:31] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:17:31] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:17:31] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:31] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:17:31] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:17:31] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:17:31] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:17:31] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:17:32] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:32] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:17:32] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:17:32] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 20/295 constraints. Problems are: Problem set: 29 solved, 387 unsolved
[2024-05-22 00:17:33] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:17:33] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:17:33] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:17:33] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:17:33] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:34] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:17:34] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:17:34] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:17:34] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:17:34] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:17:34] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:17:34] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:17:35] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:17:35] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:17:35] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:17:35] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:17:35] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:17:35] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:17:36] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:17:36] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 20/315 constraints. Problems are: Problem set: 29 solved, 387 unsolved
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 81 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:17:39] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 3 ms to minimize.
Problem TDEAD320 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/475 variables, 20/335 constraints. Problems are: Problem set: 30 solved, 386 unsolved
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/475 variables, 20/355 constraints. Problems are: Problem set: 30 solved, 386 unsolved
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 475/892 variables, and 356 constraints, problems are : Problem set: 30 solved, 386 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/475 constraints, PredecessorRefiner: 0/416 constraints, Known Traps: 261/261 constraints]
After SMT, in 60128ms problems are : Problem set: 30 solved, 386 unsolved
Search for dead transitions found 30 dead transitions in 60134ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 475/518 places, 387/460 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 474 transition count 387
Applied a total of 1 rules in 7 ms. Remains 474 /475 variables (removed 1) and now considering 387/387 (removed 0) transitions.
// Phase 1: matrix 387 rows 474 cols
[2024-05-22 00:17:47] [INFO ] Computed 100 invariants in 2 ms
[2024-05-22 00:17:47] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-22 00:17:48] [INFO ] Invariant cache hit.
[2024-05-22 00:17:48] [INFO ] Implicit Places using invariants and state equation in 351 ms returned [152, 153]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 587 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 472/518 places, 387/460 transitions.
Applied a total of 0 rules in 6 ms. Remains 472 /472 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61499 ms. Remains : 472/518 places, 387/460 transitions.
[2024-05-22 00:17:48] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:17:48] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:17:48] [INFO ] Input system was already deterministic with 387 transitions.
[2024-05-22 00:17:48] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:17:48] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:17:48] [INFO ] Time to serialize gal into /tmp/CTLFireability9664340212982826305.gal : 2 ms
[2024-05-22 00:17:48] [INFO ] Time to serialize properties into /tmp/CTLFireability7942858627098712341.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/CTLFireability9664340212982826305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7942858627098712341.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-22 00:18:18] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:18:18] [INFO ] Applying decomposition
[2024-05-22 00:18:18] [INFO ] Flatten gal took : 18 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/graph4660712044256303294.txt' '-o' '/tmp/graph4660712044256303294.bin' '-w' '/tmp/graph4660712044256303294.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4660712044256303294.bin' '-l' '-1' '-v' '-w' '/tmp/graph4660712044256303294.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:18:18] [INFO ] Decomposing Gal with order
[2024-05-22 00:18:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:18:18] [INFO ] Removed a total of 138 redundant transitions.
[2024-05-22 00:18:18] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:18:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 9 ms.
[2024-05-22 00:18:18] [INFO ] Time to serialize gal into /tmp/CTLFireability16760882132870011988.gal : 6 ms
[2024-05-22 00:18:18] [INFO ] Time to serialize properties into /tmp/CTLFireability12564401493030968145.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/CTLFireability16760882132870011988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12564401493030968145.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 482 transition count 424
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 482 transition count 424
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 82 place count 472 transition count 414
Iterating global reduction 0 with 10 rules applied. Total rules applied 92 place count 472 transition count 414
Applied a total of 92 rules in 20 ms. Remains 472 /518 variables (removed 46) and now considering 414/460 (removed 46) transitions.
// Phase 1: matrix 414 rows 472 cols
[2024-05-22 00:18:48] [INFO ] Computed 95 invariants in 7 ms
[2024-05-22 00:18:48] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-22 00:18:48] [INFO ] Invariant cache hit.
[2024-05-22 00:18:49] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Running 413 sub problems to find dead transitions.
[2024-05-22 00:18:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 413 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 102 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 413 unsolved
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 98 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 100 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:19:00] [INFO ] Deduced a trap composed of 89 places in 87 ms of which 2 ms to minimize.
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 20/135 constraints. Problems are: Problem set: 20 solved, 393 unsolved
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 84 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 103 places in 154 ms of which 3 ms to minimize.
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 20/155 constraints. Problems are: Problem set: 26 solved, 387 unsolved
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 80 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 1 ms to minimize.
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 20/175 constraints. Problems are: Problem set: 29 solved, 384 unsolved
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 27 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 20/195 constraints. Problems are: Problem set: 29 solved, 384 unsolved
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 1 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 1 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 20/215 constraints. Problems are: Problem set: 29 solved, 384 unsolved
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 78 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 83 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:18] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:19:19] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 20/235 constraints. Problems are: Problem set: 29 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 472/886 variables, and 235 constraints, problems are : Problem set: 29 solved, 384 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/472 constraints, PredecessorRefiner: 413/413 constraints, Known Traps: 140/140 constraints]
Escalating to Integer solving :Problem set: 29 solved, 384 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 37/37 constraints. Problems are: Problem set: 29 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/37 constraints. Problems are: Problem set: 29 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/472 variables, 56/93 constraints. Problems are: Problem set: 29 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/472 variables, 2/95 constraints. Problems are: Problem set: 29 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 140/235 constraints. Problems are: Problem set: 29 solved, 384 unsolved
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 20/255 constraints. Problems are: Problem set: 29 solved, 384 unsolved
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 20/275 constraints. Problems are: Problem set: 29 solved, 384 unsolved
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:19:31] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:19:31] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 20/295 constraints. Problems are: Problem set: 29 solved, 384 unsolved
[2024-05-22 00:19:32] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:19:32] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:19:32] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:19:32] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:19:32] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:19:33] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:19:33] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:19:33] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:19:33] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:19:34] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:19:34] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:19:34] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:19:34] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:19:34] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:19:34] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:19:35] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:19:35] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:19:35] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:19:35] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:19:35] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 20/315 constraints. Problems are: Problem set: 29 solved, 384 unsolved
[2024-05-22 00:19:36] [INFO ] Deduced a trap composed of 99 places in 166 ms of which 2 ms to minimize.
[2024-05-22 00:19:36] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:19:36] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:19:37] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:19:37] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:19:37] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 133 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:19:38] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:19:39] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:19:40] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/472 variables, 20/335 constraints. Problems are: Problem set: 29 solved, 384 unsolved
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:41] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:19:42] [INFO ] Deduced a trap composed of 22 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 23 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 112 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:19:43] [INFO ] Deduced a trap composed of 96 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:19:44] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 136 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:19:45] [INFO ] Deduced a trap composed of 138 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 81 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:19:46] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 20/355 constraints. Problems are: Problem set: 31 solved, 382 unsolved
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:19:48] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:19:49] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:19:49] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:19:49] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 1)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 472/886 variables, and 363 constraints, problems are : Problem set: 31 solved, 382 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/472 constraints, PredecessorRefiner: 0/413 constraints, Known Traps: 268/268 constraints]
After SMT, in 60097ms problems are : Problem set: 31 solved, 382 unsolved
Search for dead transitions found 31 dead transitions in 60103ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 472/518 places, 383/460 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 470 transition count 383
Applied a total of 2 rules in 8 ms. Remains 470 /472 variables (removed 2) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 470 cols
[2024-05-22 00:19:49] [INFO ] Computed 100 invariants in 3 ms
[2024-05-22 00:19:49] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 00:19:49] [INFO ] Invariant cache hit.
[2024-05-22 00:19:50] [INFO ] Implicit Places using invariants and state equation in 593 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 750 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 469/518 places, 383/460 transitions.
Applied a total of 0 rules in 8 ms. Remains 469 /469 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61656 ms. Remains : 469/518 places, 383/460 transitions.
[2024-05-22 00:19:50] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:19:50] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:19:50] [INFO ] Input system was already deterministic with 383 transitions.
[2024-05-22 00:19:50] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:19:50] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:19:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1452207105365793452.gal : 2 ms
[2024-05-22 00:19:50] [INFO ] Time to serialize properties into /tmp/CTLFireability12587200180941841217.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/CTLFireability1452207105365793452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12587200180941841217.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 484 transition count 426
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 484 transition count 426
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 475 transition count 417
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 475 transition count 417
Applied a total of 86 rules in 36 ms. Remains 475 /518 variables (removed 43) and now considering 417/460 (removed 43) transitions.
// Phase 1: matrix 417 rows 475 cols
[2024-05-22 00:20:50] [INFO ] Computed 95 invariants in 7 ms
[2024-05-22 00:20:51] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-22 00:20:51] [INFO ] Invariant cache hit.
[2024-05-22 00:20:51] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-22 00:20:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 1/475 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 104 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 105 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:20:58] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 102 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 102 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 101 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 91 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:20:59] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 20/115 constraints. Problems are: Problem set: 9 solved, 407 unsolved
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 113 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:21:00] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 99 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:21:01] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 4 ms to minimize.
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 20/135 constraints. Problems are: Problem set: 9 solved, 407 unsolved
[2024-05-22 00:21:02] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:21:03] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:21:03] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:21:03] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:21:03] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:21:03] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:03] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:21:03] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:21:03] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:21:04] [INFO ] Deduced a trap composed of 105 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:21:04] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:21:04] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:21:04] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:21:04] [INFO ] Deduced a trap composed of 99 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:21:04] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:21:04] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:21:04] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:21:04] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:21:05] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:21:05] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 1 ms to minimize.
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/475 variables, 20/155 constraints. Problems are: Problem set: 11 solved, 405 unsolved
[2024-05-22 00:21:08] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:21:08] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:21:08] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:21:08] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:21:08] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:09] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:21:10] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
Problem TDEAD322 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/475 variables, 20/175 constraints. Problems are: Problem set: 23 solved, 393 unsolved
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 90 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 106 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:21:11] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:21:12] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:21:12] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:21:12] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:21:12] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:21:12] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:21:12] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:21:12] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:13] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:21:13] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:21:13] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:21:13] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:21:13] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:21:13] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:21:13] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/475 variables, 20/195 constraints. Problems are: Problem set: 26 solved, 390 unsolved
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:21:14] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2024-05-22 00:21:15] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:21:16] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:21:17] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:21:17] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:21:17] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 3 ms to minimize.
Problem TDEAD339 is UNSAT
Problem TDEAD342 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 20/215 constraints. Problems are: Problem set: 28 solved, 388 unsolved
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:21:20] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 102 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:21:21] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 28 solved, 388 unsolved
Search for dead transitions found 28 dead transitions in 30175ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in LTL mode, iteration 1 : 475/518 places, 389/460 transitions.
Applied a total of 0 rules in 5 ms. Remains 475 /475 variables (removed 0) and now considering 389/389 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30957 ms. Remains : 475/518 places, 389/460 transitions.
[2024-05-22 00:21:21] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:21:21] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:21:21] [INFO ] Input system was already deterministic with 389 transitions.
[2024-05-22 00:21:21] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:21:21] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:21:21] [INFO ] Time to serialize gal into /tmp/CTLFireability4217711845286368248.gal : 2 ms
[2024-05-22 00:21:21] [INFO ] Time to serialize properties into /tmp/CTLFireability2155207709006524164.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/CTLFireability4217711845286368248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2155207709006524164.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-22 00:21:51] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:21:51] [INFO ] Applying decomposition
[2024-05-22 00:21:51] [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/graph10800075471191713711.txt' '-o' '/tmp/graph10800075471191713711.bin' '-w' '/tmp/graph10800075471191713711.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10800075471191713711.bin' '-l' '-1' '-v' '-w' '/tmp/graph10800075471191713711.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:21:51] [INFO ] Decomposing Gal with order
[2024-05-22 00:21:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:21:52] [INFO ] Removed a total of 143 redundant transitions.
[2024-05-22 00:21:52] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:21:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2024-05-22 00:21:52] [INFO ] Time to serialize gal into /tmp/CTLFireability6537820379244645793.gal : 5 ms
[2024-05-22 00:21:52] [INFO ] Time to serialize properties into /tmp/CTLFireability17269504947455068324.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/CTLFireability6537820379244645793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17269504947455068324.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13379e+27,6.81481,179368,17829,40,274839,539,1063,696367,56,1561,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Graph (trivial) has 253 edges and 518 vertex of which 6 / 518 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1137 edges and 513 vertex of which 512 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 511 transition count 385
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 444 transition count 385
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 136 place count 444 transition count 288
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 15 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 345 place count 332 transition count 288
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 378 place count 299 transition count 255
Ensure Unique test removed 1 places
Iterating global reduction 2 with 34 rules applied. Total rules applied 412 place count 298 transition count 255
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 412 place count 298 transition count 252
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 418 place count 295 transition count 252
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 642 place count 182 transition count 141
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 648 place count 182 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 649 place count 181 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 650 place count 180 transition count 140
Applied a total of 650 rules in 45 ms. Remains 180 /518 variables (removed 338) and now considering 140/460 (removed 320) transitions.
// Phase 1: matrix 140 rows 180 cols
[2024-05-22 00:22:22] [INFO ] Computed 76 invariants in 2 ms
[2024-05-22 00:22:22] [INFO ] Implicit Places using invariants in 139 ms returned [0, 1, 2, 3, 4, 7, 15, 16, 20, 22, 24, 25, 26, 27, 31, 32, 56, 57, 58, 59, 146]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 152 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 159/518 places, 140/460 transitions.
Applied a total of 0 rules in 5 ms. Remains 159 /159 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 204 ms. Remains : 159/518 places, 140/460 transitions.
[2024-05-22 00:22:22] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:22:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:22] [INFO ] Input system was already deterministic with 140 transitions.
[2024-05-22 00:22:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:22] [INFO ] Time to serialize gal into /tmp/CTLFireability6264507607029591138.gal : 1 ms
[2024-05-22 00:22:22] [INFO ] Time to serialize properties into /tmp/CTLFireability14127025186872076347.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/CTLFireability6264507607029591138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14127025186872076347.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,91764,0.670838,25528,2,9054,5,98287,6,0,775,52411,0


Converting to forward existential form...Done !
original formula: EF(EG((((p155==0)&&(p375==0))&&(((p71==1)||(((p120==1)&&(p397==1))&&(p537==1)))||(((p193==1)&&(p422==1))&&((p579==1)&&(p540==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((p155==0)&&(p375==0))&&(((p71==1)||(((p120==1)&&(p397==1))&&(p537==1)))||(((p193==1)&&(p...201
Hit Full ! (commute/partial/dont) 110/10/30
(forward)formula 0,1,3.20987,84660,1,0,9,359097,19,2,4447,107362,8
FORMULA BusinessProcesses-PT-16-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 482 transition count 424
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 482 transition count 424
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 473 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 473 transition count 415
Applied a total of 90 rules in 38 ms. Remains 473 /518 variables (removed 45) and now considering 415/460 (removed 45) transitions.
// Phase 1: matrix 415 rows 473 cols
[2024-05-22 00:22:25] [INFO ] Computed 95 invariants in 3 ms
[2024-05-22 00:22:25] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-22 00:22:25] [INFO ] Invariant cache hit.
[2024-05-22 00:22:26] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 414 sub problems to find dead transitions.
[2024-05-22 00:22:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:22:34] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:22:35] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:22:35] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:22:35] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:22:35] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:22:35] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:22:35] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:22:35] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:22:35] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:22:35] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
Problem TDEAD337 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 20/115 constraints. Problems are: Problem set: 1 solved, 413 unsolved
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:22:36] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:22:37] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:22:38] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:22:38] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:22:38] [INFO ] Deduced a trap composed of 100 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:22:38] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:22:38] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:22:38] [INFO ] Deduced a trap composed of 27 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:22:38] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 2 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/135 constraints. Problems are: Problem set: 16 solved, 398 unsolved
[2024-05-22 00:22:39] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:22:39] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:22:39] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:22:39] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:22:39] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:22:39] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:22:39] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:22:39] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:22:39] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:22:40] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:22:40] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:22:40] [INFO ] Deduced a trap composed of 95 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:22:40] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:22:40] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:22:40] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:22:40] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:22:40] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:22:40] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:22:41] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:22:41] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 3 ms to minimize.
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 20/155 constraints. Problems are: Problem set: 26 solved, 388 unsolved
[2024-05-22 00:22:44] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:22:44] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:22:44] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:22:44] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:22:44] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:22:45] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:22:45] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:22:45] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:22:45] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:22:45] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:22:45] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:22:45] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:22:45] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:22:45] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:22:46] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 3 ms to minimize.
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 20/175 constraints. Problems are: Problem set: 28 solved, 386 unsolved
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:22:47] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:22:48] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 82 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:22:49] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
Problem TDEAD324 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD355 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 20/195 constraints. Problems are: Problem set: 31 solved, 383 unsolved
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:22:50] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 102 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:22:51] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:22:52] [INFO ] Deduced a trap composed of 94 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:22:52] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:22:52] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:22:52] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:22:52] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
Problem TDEAD357 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 20/215 constraints. Problems are: Problem set: 32 solved, 382 unsolved
[2024-05-22 00:22:55] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:22:56] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:22:56] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:22:56] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:22:56] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:22:56] [INFO ] Deduced a trap composed of 109 places in 103 ms of which 2 ms to minimize.
SMT process timed out in 30179ms, After SMT, problems are : Problem set: 32 solved, 382 unsolved
Search for dead transitions found 32 dead transitions in 30184ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 473/518 places, 383/460 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 471 transition count 383
Applied a total of 2 rules in 10 ms. Remains 471 /473 variables (removed 2) and now considering 383/383 (removed 0) transitions.
// Phase 1: matrix 383 rows 471 cols
[2024-05-22 00:22:56] [INFO ] Computed 101 invariants in 3 ms
[2024-05-22 00:22:56] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 00:22:56] [INFO ] Invariant cache hit.
[2024-05-22 00:22:57] [INFO ] Implicit Places using invariants and state equation in 389 ms returned [149]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 550 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 470/518 places, 383/460 transitions.
Applied a total of 0 rules in 6 ms. Remains 470 /470 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31454 ms. Remains : 470/518 places, 383/460 transitions.
[2024-05-22 00:22:57] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:22:57] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:57] [INFO ] Input system was already deterministic with 383 transitions.
[2024-05-22 00:22:57] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:57] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2591677619273129584.gal : 1 ms
[2024-05-22 00:22:57] [INFO ] Time to serialize properties into /tmp/CTLFireability16854937342381764747.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/CTLFireability2591677619273129584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16854937342381764747.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07056e+27,23.0943,583336,47947,46,922390,679,949,2.07977e+06,67,1473,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 486 transition count 428
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 486 transition count 428
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 73 place count 477 transition count 419
Iterating global reduction 0 with 9 rules applied. Total rules applied 82 place count 477 transition count 419
Applied a total of 82 rules in 40 ms. Remains 477 /518 variables (removed 41) and now considering 419/460 (removed 41) transitions.
// Phase 1: matrix 419 rows 477 cols
[2024-05-22 00:23:57] [INFO ] Computed 95 invariants in 5 ms
[2024-05-22 00:23:57] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-22 00:23:57] [INFO ] Invariant cache hit.
[2024-05-22 00:23:58] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2024-05-22 00:23:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/477 variables, 56/93 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 1 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 85 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 75 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 2 ms to minimize.
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 20/115 constraints. Problems are: Problem set: 15 solved, 403 unsolved
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 100 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:24:09] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:24:09] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:24:09] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:09] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:24:09] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:24:09] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
Problem TDEAD318 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD365 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 20/135 constraints. Problems are: Problem set: 23 solved, 395 unsolved
[2024-05-22 00:24:09] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:24:10] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:24:10] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:24:10] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:24:10] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:10] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:24:10] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:24:10] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:24:10] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:24:10] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:11] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:24:11] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:11] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:24:11] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:24:11] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:24:11] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:24:11] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:24:11] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:24:12] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:12] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 1 ms to minimize.
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 20/155 constraints. Problems are: Problem set: 29 solved, 389 unsolved
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 103 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 1 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 98 places in 109 ms of which 1 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 20/175 constraints. Problems are: Problem set: 29 solved, 389 unsolved
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 136 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 141 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 135 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 20/195 constraints. Problems are: Problem set: 29 solved, 389 unsolved
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 25 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:24:21] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:24:22] [INFO ] Deduced a trap composed of 86 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:24:23] [INFO ] Deduced a trap composed of 86 places in 90 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 20/215 constraints. Problems are: Problem set: 29 solved, 389 unsolved
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 90 places in 93 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 477/896 variables, and 222 constraints, problems are : Problem set: 29 solved, 389 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/477 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 127/127 constraints]
Escalating to Integer solving :Problem set: 29 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 37/37 constraints. Problems are: Problem set: 29 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/37 constraints. Problems are: Problem set: 29 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 1/477 variables, 56/93 constraints. Problems are: Problem set: 29 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 2/95 constraints. Problems are: Problem set: 29 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 127/222 constraints. Problems are: Problem set: 29 solved, 389 unsolved
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 121 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 129 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 51 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 48 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 20/242 constraints. Problems are: Problem set: 29 solved, 389 unsolved
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 137 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 136 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 114 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 111 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 130 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 116 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 133 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 20/262 constraints. Problems are: Problem set: 29 solved, 389 unsolved
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 79 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 3 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 20/282 constraints. Problems are: Problem set: 29 solved, 389 unsolved
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 20/302 constraints. Problems are: Problem set: 29 solved, 389 unsolved
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 94 places in 167 ms of which 2 ms to minimize.
[2024-05-22 00:24:52] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:53] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:24:54] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 20/322 constraints. Problems are: Problem set: 29 solved, 389 unsolved
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:24:55] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:24:56] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:24:56] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:24:57] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:24:58] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
SMT process timed out in 60101ms, After SMT, problems are : Problem set: 29 solved, 389 unsolved
Search for dead transitions found 29 dead transitions in 60107ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 477/518 places, 390/460 transitions.
Applied a total of 0 rules in 7 ms. Remains 477 /477 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60764 ms. Remains : 477/518 places, 390/460 transitions.
[2024-05-22 00:24:58] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:24:58] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:24:58] [INFO ] Input system was already deterministic with 390 transitions.
[2024-05-22 00:24:58] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:24:58] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:24:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15870060649288202517.gal : 2 ms
[2024-05-22 00:24:58] [INFO ] Time to serialize properties into /tmp/CTLFireability6357607952465902482.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/CTLFireability15870060649288202517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6357607952465902482.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26454e+27,28.4392,505340,6994,56,792400,904,1009,1.3019e+06,70,1947,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Graph (trivial) has 261 edges and 518 vertex of which 6 / 518 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1137 edges and 513 vertex of which 512 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 511 transition count 381
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 440 transition count 381
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 144 place count 440 transition count 281
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 361 place count 323 transition count 281
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 394 place count 290 transition count 248
Ensure Unique test removed 1 places
Iterating global reduction 2 with 34 rules applied. Total rules applied 428 place count 289 transition count 248
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 428 place count 289 transition count 244
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 436 place count 285 transition count 244
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 664 place count 169 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 665 place count 168 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 666 place count 167 transition count 131
Applied a total of 666 rules in 60 ms. Remains 167 /518 variables (removed 351) and now considering 131/460 (removed 329) transitions.
// Phase 1: matrix 131 rows 167 cols
[2024-05-22 00:25:58] [INFO ] Computed 72 invariants in 2 ms
[2024-05-22 00:25:58] [INFO ] Implicit Places using invariants in 161 ms returned [0, 1, 2, 3, 4, 5, 6, 15, 16, 20, 21, 22, 23, 24, 25, 48, 49, 50, 51]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 162 ms to find 19 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 148/518 places, 131/460 transitions.
Applied a total of 0 rules in 8 ms. Remains 148 /148 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 230 ms. Remains : 148/518 places, 131/460 transitions.
[2024-05-22 00:25:58] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:25:58] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:25:58] [INFO ] Input system was already deterministic with 131 transitions.
[2024-05-22 00:25:58] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:25:58] [INFO ] Flatten gal took : 28 ms
[2024-05-22 00:25:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15499053872386558639.gal : 2 ms
[2024-05-22 00:25:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9126957191368217151.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15499053872386558639.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9126957191368217151.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9126957191368217151.prop.
RANDOM walk for 40000 steps (8472 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 24
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :24 after 48
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :60 after 330
BEST_FIRST walk for 40003 steps (2444 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 184 steps, run visited all 1 properties in 5 ms. (steps per millisecond=36 )
Probabilistic random walk after 184 steps, saw 124 distinct states, run finished after 5 ms. (steps per millisecond=36 ) properties seen :1
FORMULA BusinessProcesses-PT-16-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 460/460 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 482 transition count 424
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 482 transition count 424
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 473 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 473 transition count 415
Applied a total of 90 rules in 33 ms. Remains 473 /518 variables (removed 45) and now considering 415/460 (removed 45) transitions.
// Phase 1: matrix 415 rows 473 cols
[2024-05-22 00:25:58] [INFO ] Computed 95 invariants in 3 ms
[2024-05-22 00:25:59] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-22 00:25:59] [INFO ] Invariant cache hit.
[2024-05-22 00:25:59] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Running 414 sub problems to find dead transitions.
[2024-05-22 00:25:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 57/94 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 1 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 104 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 100 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 82 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 1 ms to minimize.
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/135 constraints. Problems are: Problem set: 12 solved, 402 unsolved
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 94 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:26:14] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 3 ms to minimize.
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD352 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 20/155 constraints. Problems are: Problem set: 21 solved, 393 unsolved
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:26:17] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 95 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 99 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
Problem TDEAD314 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 20/175 constraints. Problems are: Problem set: 29 solved, 385 unsolved
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 3 ms to minimize.
Problem TDEAD323 is UNSAT
Problem TDEAD331 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 20/195 constraints. Problems are: Problem set: 31 solved, 383 unsolved
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 88 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 5 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 20/215 constraints. Problems are: Problem set: 31 solved, 383 unsolved
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 94 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 2 ms to minimize.
SMT process timed out in 30171ms, After SMT, problems are : Problem set: 31 solved, 383 unsolved
Search for dead transitions found 31 dead transitions in 30174ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 473/518 places, 384/460 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 471 transition count 384
Applied a total of 2 rules in 6 ms. Remains 471 /473 variables (removed 2) and now considering 384/384 (removed 0) transitions.
// Phase 1: matrix 384 rows 471 cols
[2024-05-22 00:26:29] [INFO ] Computed 100 invariants in 2 ms
[2024-05-22 00:26:29] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 00:26:29] [INFO ] Invariant cache hit.
[2024-05-22 00:26:30] [INFO ] Implicit Places using invariants and state equation in 305 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 458 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 470/518 places, 384/460 transitions.
Applied a total of 0 rules in 5 ms. Remains 470 /470 variables (removed 0) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31370 ms. Remains : 470/518 places, 384/460 transitions.
[2024-05-22 00:26:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:26:30] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:26:30] [INFO ] Input system was already deterministic with 384 transitions.
[2024-05-22 00:26:30] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:26:30] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:26:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1548573080054546901.gal : 2 ms
[2024-05-22 00:26:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17168221691064832943.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/CTLFireability1548573080054546901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17168221691064832943.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.99293e+27,2.17945,63048,7937,88,87211,1147,1244,315622,82,3612,0


Converting to forward existential form...Done !
original formula: AG((AX(AF((((i5.i0.u19.p51!=1)||(i5.i1.u111.p337!=1))||(i3.i1.u154.p491!=1)))) + EG((((i2.i1.u24.p69!=1)||(i9.i1.u117.p361!=1))||(i19.u16...169
=> equivalent forward existential formula: [FwdG(EY((FwdU(Init,TRUE) * !(EG((((i2.i1.u24.p69!=1)||(i9.i1.u117.p361!=1))||(i19.u160.p603!=1)))))),!((((i5.i0...224
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t10, t21, t204, t311, t321, t438, t450, i0.t208, i0.u75.t219, i0.u77.t215, i0.u79.t21...1806
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-22 00:30:30] [INFO ] Applying decomposition
[2024-05-22 00:30:30] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:30:30] [INFO ] Decomposing Gal with order
[2024-05-22 00:30:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:30:30] [INFO ] Removed a total of 129 redundant transitions.
[2024-05-22 00:30:30] [INFO ] Flatten gal took : 36 ms
[2024-05-22 00:30:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 109 ms.
[2024-05-22 00:30:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13604945602340772462.gal : 9 ms
[2024-05-22 00:30:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12004602984304457451.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/CTLFireability13604945602340772462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12004602984304457451.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 8 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 00:36:56] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:36:56] [INFO ] Input system was already deterministic with 460 transitions.
[2024-05-22 00:36:56] [INFO ] Transformed 518 places.
[2024-05-22 00:36:56] [INFO ] Transformed 460 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:37:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10594221921857290294.gal : 5 ms
[2024-05-22 00:37:26] [INFO ] Time to serialize properties into /tmp/CTLFireability15232591378563171932.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/CTLFireability10594221921857290294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15232591378563171932.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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2523049 ms.

BK_STOP 1716339104164

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-16"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-16, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399800570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-16.tgz
mv BusinessProcesses-PT-16 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;