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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 16:29 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 157K 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-15-CTLFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2023-12
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2023-13
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2023-14
FORMULA_NAME BusinessProcesses-PT-15-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716336270834

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-22 00:04:32] [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:04:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:04:32] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-05-22 00:04:32] [INFO ] Transformed 630 places.
[2024-05-22 00:04:32] [INFO ] Transformed 566 transitions.
[2024-05-22 00:04:32] [INFO ] Found NUPN structural information;
[2024-05-22 00:04:32] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 326 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Deduced a syphon composed of 4 places in 16 ms
Reduce places removed 4 places and 4 transitions.
Support contains 121 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 74 place count 552 transition count 491
Iterating global reduction 1 with 71 rules applied. Total rules applied 145 place count 552 transition count 491
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 182 place count 515 transition count 454
Iterating global reduction 1 with 37 rules applied. Total rules applied 219 place count 515 transition count 454
Applied a total of 219 rules in 193 ms. Remains 515 /626 variables (removed 111) and now considering 454/562 (removed 108) transitions.
// Phase 1: matrix 454 rows 515 cols
[2024-05-22 00:04:33] [INFO ] Computed 99 invariants in 51 ms
[2024-05-22 00:04:33] [INFO ] Implicit Places using invariants in 517 ms returned []
[2024-05-22 00:04:33] [INFO ] Invariant cache hit.
[2024-05-22 00:04:34] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2024-05-22 00:04:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/515 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:04:47] [INFO ] Deduced a trap composed of 79 places in 165 ms of which 29 ms to minimize.
[2024-05-22 00:04:47] [INFO ] Deduced a trap composed of 91 places in 209 ms of which 3 ms to minimize.
[2024-05-22 00:04:47] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 2 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 11 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:04:48] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 105 places in 181 ms of which 2 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:04:49] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:04:50] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:04:50] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:04:50] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:04:50] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:04:50] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 15 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 75 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 98 places in 163 ms of which 4 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 72 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 77 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:04:51] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:04:52] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:04:52] [INFO ] Deduced a trap composed of 85 places in 186 ms of which 5 ms to minimize.
[2024-05-22 00:04:52] [INFO ] Deduced a trap composed of 97 places in 188 ms of which 4 ms to minimize.
[2024-05-22 00:04:52] [INFO ] Deduced a trap composed of 73 places in 155 ms of which 4 ms to minimize.
[2024-05-22 00:04:52] [INFO ] Deduced a trap composed of 75 places in 154 ms of which 6 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 3 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 94 places in 167 ms of which 2 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:04:53] [INFO ] Deduced a trap composed of 98 places in 201 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:04:54] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 4 ms to minimize.
[2024-05-22 00:04:54] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:04:54] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:04:54] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:04:54] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 9 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 73 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 95 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:04:55] [INFO ] Deduced a trap composed of 78 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 95 places in 178 ms of which 5 ms to minimize.
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:04:56] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 6 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 75 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:04:57] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:05:01] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:05:01] [INFO ] Deduced a trap composed of 99 places in 240 ms of which 16 ms to minimize.
[2024-05-22 00:05:02] [INFO ] Deduced a trap composed of 98 places in 227 ms of which 3 ms to minimize.
[2024-05-22 00:05:02] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:05:02] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:05:02] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:05:02] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:05:02] [INFO ] Deduced a trap composed of 101 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:05:02] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:05:03] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:05:03] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:05:03] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:05:03] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 6 ms to minimize.
[2024-05-22 00:05:03] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:05:03] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:05:03] [INFO ] Deduced a trap composed of 109 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:05:04] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:05:04] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:05:04] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:05:04] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 515/969 variables, and 179 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/515 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 1/515 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/515 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 80/179 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:05:08] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:05:08] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:05:08] [INFO ] Deduced a trap composed of 100 places in 182 ms of which 5 ms to minimize.
[2024-05-22 00:05:08] [INFO ] Deduced a trap composed of 103 places in 173 ms of which 5 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 94 places in 183 ms of which 2 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:05:10] [INFO ] Deduced a trap composed of 95 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:05:10] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 0 ms to minimize.
[2024-05-22 00:05:10] [INFO ] Deduced a trap composed of 92 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:05:10] [INFO ] Deduced a trap composed of 91 places in 174 ms of which 2 ms to minimize.
[2024-05-22 00:05:10] [INFO ] Deduced a trap composed of 89 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:05:10] [INFO ] Deduced a trap composed of 87 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:05:11] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:05:11] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:05:11] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:05:11] [INFO ] Deduced a trap composed of 104 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 101 places in 179 ms of which 2 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 5 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:05:12] [INFO ] Deduced a trap composed of 92 places in 186 ms of which 30 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 72 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 4 ms to minimize.
[2024-05-22 00:05:13] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 97 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:05:14] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 90 places in 164 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 103 places in 188 ms of which 3 ms to minimize.
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 101 places in 174 ms of which 4 ms to minimize.
[2024-05-22 00:05:15] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 104 places in 160 ms of which 4 ms to minimize.
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 103 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 104 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:05:16] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 4 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 86 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 85 places in 170 ms of which 5 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:05:17] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 85 places in 181 ms of which 3 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:05:18] [INFO ] Deduced a trap composed of 89 places in 167 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 97 places in 155 ms of which 4 ms to minimize.
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:05:19] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:05:20] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:05:20] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:05:20] [INFO ] Deduced a trap composed of 132 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:05:20] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:05:20] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:05:20] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:05:20] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:05:21] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 93 places in 194 ms of which 4 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 20/259 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:05:22] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 99 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:05:23] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:05:24] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:05:25] [INFO ] Deduced a trap composed of 126 places in 161 ms of which 2 ms to minimize.
[2024-05-22 00:05:25] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:05:25] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:05:25] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 20/279 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 113 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:05:26] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:05:27] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:05:28] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:05:29] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:05:29] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 20/299 constraints. Problems are: Problem set: 0 solved, 453 unsolved
[2024-05-22 00:05:29] [INFO ] Deduced a trap composed of 105 places in 170 ms of which 4 ms to minimize.
[2024-05-22 00:05:29] [INFO ] Deduced a trap composed of 107 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:05:30] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:05:30] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:05:30] [INFO ] Deduced a trap composed of 103 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:05:30] [INFO ] Deduced a trap composed of 96 places in 243 ms of which 6 ms to minimize.
[2024-05-22 00:05:30] [INFO ] Deduced a trap composed of 103 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:05:31] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:05:31] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:05:31] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:05:31] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:05:31] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 93 places in 214 ms of which 6 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 4 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 4 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 92 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:05:32] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:05:33] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:05:33] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 20/319 constraints. Problems are: Problem set: 3 solved, 450 unsolved
[2024-05-22 00:05:33] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 75 places in 161 ms of which 27 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 75 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:05:34] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
SMT process timed out in 60322ms, After SMT, problems are : Problem set: 3 solved, 450 unsolved
Search for dead transitions found 3 dead transitions in 60339ms
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 : 515/626 places, 451/562 transitions.
Applied a total of 0 rules in 21 ms. Remains 515 /515 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61691 ms. Remains : 515/626 places, 451/562 transitions.
Support contains 121 out of 515 places after structural reductions.
[2024-05-22 00:05:34] [INFO ] Flatten gal took : 78 ms
[2024-05-22 00:05:35] [INFO ] Flatten gal took : 36 ms
[2024-05-22 00:05:35] [INFO ] Input system was already deterministic with 451 transitions.
Support contains 116 out of 515 places (down from 121) after GAL structural reductions.
RANDOM walk for 40000 steps (267 resets) in 2625 ms. (15 steps per ms) remains 33/73 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
// Phase 1: matrix 451 rows 515 cols
[2024-05-22 00:05:36] [INFO ] Computed 99 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 132/189 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 174/363 variables, 37/56 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp65 is UNSAT
At refinement iteration 5 (OVERLAPS) 143/506 variables, 40/96 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 3/509 variables, 3/99 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 447/956 variables, 509/608 constraints. Problems are: Problem set: 1 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/956 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 32 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 11 (OVERLAPS) 9/965 variables, 5/613 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/965 variables, 0/613 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 1/966 variables, 1/614 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/966 variables, 0/614 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 15 (OVERLAPS) 0/966 variables, 0/614 constraints. Problems are: Problem set: 3 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 966/966 variables, and 614 constraints, problems are : Problem set: 3 solved, 30 unsolved in 2811 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 515/515 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 128/174 variables, 18/18 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 183/357 variables, 38/56 constraints. Problems are: Problem set: 3 solved, 30 unsolved
[2024-05-22 00:05:39] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:05:39] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-05-22 00:05:39] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:05:39] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:05:39] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 5/61 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 149/506 variables, 40/101 constraints. Problems are: Problem set: 3 solved, 30 unsolved
[2024-05-22 00:05:40] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 4 ms to minimize.
[2024-05-22 00:05:40] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:05:41] [INFO ] Deduced a trap composed of 101 places in 254 ms of which 3 ms to minimize.
[2024-05-22 00:05:41] [INFO ] Deduced a trap composed of 108 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:05:41] [INFO ] Deduced a trap composed of 110 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:05:41] [INFO ] Deduced a trap composed of 107 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:05:41] [INFO ] Deduced a trap composed of 99 places in 177 ms of which 4 ms to minimize.
[2024-05-22 00:05:41] [INFO ] Deduced a trap composed of 111 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:05:42] [INFO ] Deduced a trap composed of 104 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:05:42] [INFO ] Deduced a trap composed of 94 places in 190 ms of which 4 ms to minimize.
[2024-05-22 00:05:42] [INFO ] Deduced a trap composed of 97 places in 184 ms of which 4 ms to minimize.
[2024-05-22 00:05:42] [INFO ] Deduced a trap composed of 89 places in 225 ms of which 3 ms to minimize.
[2024-05-22 00:05:42] [INFO ] Deduced a trap composed of 96 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:05:43] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:05:43] [INFO ] Deduced a trap composed of 109 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:05:43] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 2 ms to minimize.
[2024-05-22 00:05:43] [INFO ] Deduced a trap composed of 92 places in 190 ms of which 2 ms to minimize.
[2024-05-22 00:05:43] [INFO ] Deduced a trap composed of 111 places in 186 ms of which 4 ms to minimize.
[2024-05-22 00:05:44] [INFO ] Deduced a trap composed of 98 places in 199 ms of which 2 ms to minimize.
[2024-05-22 00:05:44] [INFO ] Deduced a trap composed of 96 places in 190 ms of which 2 ms to minimize.
SMT process timed out in 8042ms, After SMT, problems are : Problem set: 3 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 515 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 515/515 places, 451/451 transitions.
Graph (complete) has 1142 edges and 515 vertex of which 514 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
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 514 transition count 399
Reduce places removed 51 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 53 rules applied. Total rules applied 105 place count 463 transition count 397
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 107 place count 461 transition count 397
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 107 place count 461 transition count 312
Deduced a syphon composed of 85 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 291 place count 362 transition count 312
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 302 place count 351 transition count 301
Iterating global reduction 3 with 11 rules applied. Total rules applied 313 place count 351 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 313 place count 351 transition count 300
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 315 place count 350 transition count 300
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 235 rules applied. Total rules applied 550 place count 231 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 551 place count 231 transition count 183
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 552 place count 231 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 553 place count 230 transition count 182
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 560 place count 230 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 561 place count 229 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 562 place count 228 transition count 181
Applied a total of 562 rules in 208 ms. Remains 228 /515 variables (removed 287) and now considering 181/451 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 228/515 places, 181/451 transitions.
RANDOM walk for 40000 steps (2609 resets) in 1226 ms. (32 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (62 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (54 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (59 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (59 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (42 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (58 resets) in 31 ms. (125 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (57 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (60 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (50 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (57 resets) in 46 ms. (85 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (58 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (45 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (58 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (57 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (63 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (53 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (58 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (55 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (59 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (60 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (57 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (56 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (57 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (61 resets) in 13 ms. (285 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (61 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (51 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (61 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (58 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (59 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 446255 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :25 out of 30
Probabilistic random walk after 446255 steps, saw 75360 distinct states, run finished after 3014 ms. (steps per millisecond=148 ) properties seen :25
// Phase 1: matrix 181 rows 228 cols
[2024-05-22 00:05:48] [INFO ] Computed 81 invariants in 2 ms
[2024-05-22 00:05:48] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 46/117 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 51/168 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 5/173 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 178/351 variables, 173/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 58/409 variables, 55/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 25/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/409 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/409 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 310 constraints, problems are : Problem set: 0 solved, 5 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 228/228 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 59/71 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 46/117 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:05:48] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:05:48] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:05:49] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:05:49] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:05:49] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp59 is UNSAT
At refinement iteration 6 (OVERLAPS) 51/168 variables, 24/56 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 5/173 variables, 5/61 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 178/351 variables, 173/234 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 1/235 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 2/237 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 00:05:49] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-05-22 00:05:49] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:05:49] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:05:49] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:05:49] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:05:49] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 6/243 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/351 variables, 0/243 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 15 (OVERLAPS) 58/409 variables, 55/298 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/409 variables, 25/323 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/409 variables, 1/324 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-22 00:05:49] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:05:50] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:05:50] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/409 variables, 3/327 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/409 variables, 0/327 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-22 00:05:50] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/409 variables, 1/328 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/409 variables, 0/328 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/409 variables, 0/328 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 409/409 variables, and 328 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1603 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 228/228 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 15/15 constraints]
After SMT, in 2003ms problems are : Problem set: 2 solved, 3 unsolved
Parikh walk visited 0 properties in 544 ms.
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 181/181 transitions.
Graph (trivial) has 48 edges and 228 vertex of which 2 / 228 are part of one of the 1 SCC in 4 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 227 transition count 167
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 215 transition count 167
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 25 place count 215 transition count 149
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 66 place count 192 transition count 149
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 190 transition count 147
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 190 transition count 147
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 101 place count 174 transition count 132
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 103 place count 173 transition count 143
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 106 place count 173 transition count 140
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 109 place count 170 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 169 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 168 transition count 139
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 168 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 167 transition count 138
Applied a total of 113 rules in 111 ms. Remains 167 /228 variables (removed 61) and now considering 138/181 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 167/228 places, 138/181 transitions.
RANDOM walk for 40000 steps (3008 resets) in 391 ms. (102 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1281 resets) in 165 ms. (240 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1317 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1326 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 152 steps, run visited all 3 properties in 8 ms. (steps per millisecond=19 )
Probabilistic random walk after 152 steps, saw 86 distinct states, run finished after 11 ms. (steps per millisecond=13 ) properties seen :3
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:05:51] [INFO ] Flatten gal took : 29 ms
[2024-05-22 00:05:51] [INFO ] Flatten gal took : 29 ms
[2024-05-22 00:05:51] [INFO ] Input system was already deterministic with 451 transitions.
Computed a total of 218 stabilizing places and 190 stable transitions
Graph (complete) has 1142 edges and 515 vertex of which 514 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 451/451 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 494 transition count 430
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 494 transition count 430
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 488 transition count 424
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 488 transition count 424
Applied a total of 54 rules in 69 ms. Remains 488 /515 variables (removed 27) and now considering 424/451 (removed 27) transitions.
// Phase 1: matrix 424 rows 488 cols
[2024-05-22 00:05:51] [INFO ] Computed 99 invariants in 4 ms
[2024-05-22 00:05:51] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-22 00:05:51] [INFO ] Invariant cache hit.
[2024-05-22 00:05:52] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 913 ms to find 0 implicit places.
Running 423 sub problems to find dead transitions.
[2024-05-22 00:05:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 1/488 variables, 56/95 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-22 00:06:00] [INFO ] Deduced a trap composed of 92 places in 209 ms of which 3 ms to minimize.
[2024-05-22 00:06:00] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 3 ms to minimize.
[2024-05-22 00:06:00] [INFO ] Deduced a trap composed of 78 places in 196 ms of which 3 ms to minimize.
[2024-05-22 00:06:00] [INFO ] Deduced a trap composed of 69 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:06:00] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:06:01] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:06:01] [INFO ] Deduced a trap composed of 90 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:06:01] [INFO ] Deduced a trap composed of 89 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:06:01] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:06:01] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 4 ms to minimize.
[2024-05-22 00:06:01] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:06:02] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:06:02] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:06:02] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:06:02] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:06:02] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:06:03] [INFO ] Deduced a trap composed of 69 places in 1289 ms of which 29 ms to minimize.
[2024-05-22 00:06:04] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 2 ms to minimize.
[2024-05-22 00:06:04] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:06:04] [INFO ] Deduced a trap composed of 50 places in 184 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-22 00:06:05] [INFO ] Deduced a trap composed of 91 places in 231 ms of which 4 ms to minimize.
[2024-05-22 00:06:05] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:06:05] [INFO ] Deduced a trap composed of 90 places in 179 ms of which 4 ms to minimize.
[2024-05-22 00:06:05] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 5 ms to minimize.
[2024-05-22 00:06:05] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:06:05] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:06:06] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:06:06] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:06:06] [INFO ] Deduced a trap composed of 68 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 86 places in 5898 ms of which 29 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 96 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 91 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 113 places in 181 ms of which 3 ms to minimize.
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 20/139 constraints. Problems are: Problem set: 10 solved, 413 unsolved
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 94 places in 185 ms of which 2 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 92 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 104 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 91 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 95 places in 205 ms of which 3 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 90 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 88 places in 188 ms of which 2 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 75 places in 164 ms of which 3 ms to minimize.
Problem TDEAD365 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD397 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 20/159 constraints. Problems are: Problem set: 20 solved, 403 unsolved
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 4 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 5 ms to minimize.
[2024-05-22 00:06:22] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:06:22] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:06:22] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:06:22] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:06:22] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:06:22] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
SMT process timed out in 30200ms, After SMT, problems are : Problem set: 20 solved, 403 unsolved
Search for dead transitions found 20 dead transitions in 30207ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 488/515 places, 404/451 transitions.
Applied a total of 0 rules in 9 ms. Remains 488 /488 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31202 ms. Remains : 488/515 places, 404/451 transitions.
[2024-05-22 00:06:22] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:06:22] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:06:22] [INFO ] Input system was already deterministic with 404 transitions.
[2024-05-22 00:06:22] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:06:22] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:06:22] [INFO ] Time to serialize gal into /tmp/CTLFireability17562846411360145653.gal : 12 ms
[2024-05-22 00:06:22] [INFO ] Time to serialize properties into /tmp/CTLFireability4091249465293572501.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/CTLFireability17562846411360145653.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4091249465293572501.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:06:52] [INFO ] Flatten gal took : 50 ms
[2024-05-22 00:06:52] [INFO ] Applying decomposition
[2024-05-22 00:06:52] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7200215651352892744.txt' '-o' '/tmp/graph7200215651352892744.bin' '-w' '/tmp/graph7200215651352892744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7200215651352892744.bin' '-l' '-1' '-v' '-w' '/tmp/graph7200215651352892744.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:06:53] [INFO ] Decomposing Gal with order
[2024-05-22 00:06:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:06:53] [INFO ] Removed a total of 161 redundant transitions.
[2024-05-22 00:06:53] [INFO ] Flatten gal took : 148 ms
[2024-05-22 00:06:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 35 ms.
[2024-05-22 00:06:53] [INFO ] Time to serialize gal into /tmp/CTLFireability34253725890060043.gal : 19 ms
[2024-05-22 00:06:53] [INFO ] Time to serialize properties into /tmp/CTLFireability13843400363735692900.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/CTLFireability34253725890060043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13843400363735692900.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.61218e+25,4.27135,105512,4060,62,128883,572,1109,721595,66,1893,0


Converting to forward existential form...Done !
original formula: AF(!(A(((i2.i1.u114.p373==1)||((i5.i1.u25.p75==1)&&(i17.u134.p460==1))) U EX((EF((i18.u136.p470==1)) + EG((i16.i2.u119.p388==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(EX((E(TRUE U (i18.u136.p470==1)) + EG((i16.i2.u119.p388==1))))) U (!(((i2.i1.u114.p373==1)...355
Reverse transition relation is NOT exact ! Due to transitions t64, t170, t190, t272, t276, t384, t385, t386, t388, t389, i0.i0.u62.t207, i0.i1.u98.t162, i0...1383
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 451/451 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 493 transition count 429
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 493 transition count 429
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 486 transition count 422
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 486 transition count 422
Applied a total of 58 rules in 60 ms. Remains 486 /515 variables (removed 29) and now considering 422/451 (removed 29) transitions.
// Phase 1: matrix 422 rows 486 cols
[2024-05-22 00:07:23] [INFO ] Computed 99 invariants in 8 ms
[2024-05-22 00:07:33] [INFO ] Implicit Places using invariants in 9874 ms returned []
[2024-05-22 00:07:33] [INFO ] Invariant cache hit.
[2024-05-22 00:07:34] [INFO ] Implicit Places using invariants and state equation in 854 ms returned []
Implicit Place search using SMT with State Equation took 10746 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-05-22 00:07:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 00:07:43] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:07:43] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:07:43] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 5 ms to minimize.
[2024-05-22 00:07:44] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:07:44] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:07:44] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:07:44] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:07:44] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:07:44] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:07:44] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 84 places in 219 ms of which 5 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:07:45] [INFO ] Deduced a trap composed of 86 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 90 places in 278 ms of which 5 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 67 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 104 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:07:47] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:07:48] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 2 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:07:49] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 2 ms to minimize.
Problem TDEAD348 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 20/139 constraints. Problems are: Problem set: 9 solved, 412 unsolved
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:07:50] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:07:51] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:07:51] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:07:51] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:07:51] [INFO ] Deduced a trap composed of 87 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:07:51] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 47 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 88 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:07:53] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:07:53] [INFO ] Deduced a trap composed of 77 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:07:53] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:07:53] [INFO ] Deduced a trap composed of 66 places in 145 ms of which 3 ms to minimize.
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 20/159 constraints. Problems are: Problem set: 21 solved, 400 unsolved
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:07:57] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:07:58] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 22 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 3 ms to minimize.
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 20/179 constraints. Problems are: Problem set: 26 solved, 395 unsolved
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 91 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
SMT process timed out in 30198ms, After SMT, problems are : Problem set: 26 solved, 395 unsolved
Search for dead transitions found 26 dead transitions in 30203ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 486/515 places, 396/451 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 485 transition count 396
Applied a total of 1 rules in 8 ms. Remains 485 /486 variables (removed 1) and now considering 396/396 (removed 0) transitions.
// Phase 1: matrix 396 rows 485 cols
[2024-05-22 00:08:04] [INFO ] Computed 101 invariants in 10 ms
[2024-05-22 00:08:05] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-22 00:08:05] [INFO ] Invariant cache hit.
[2024-05-22 00:08:05] [INFO ] Implicit Places using invariants and state equation in 545 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 765 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 484/515 places, 396/451 transitions.
Applied a total of 0 rules in 7 ms. Remains 484 /484 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 41790 ms. Remains : 484/515 places, 396/451 transitions.
[2024-05-22 00:08:05] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:08:05] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:08:05] [INFO ] Input system was already deterministic with 396 transitions.
[2024-05-22 00:08:05] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:08:05] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:08:05] [INFO ] Time to serialize gal into /tmp/CTLFireability16130001760045529519.gal : 3 ms
[2024-05-22 00:08:05] [INFO ] Time to serialize properties into /tmp/CTLFireability16696762131097020019.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/CTLFireability16130001760045529519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16696762131097020019.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.6102e+25,0.820332,31548,3436,34,51742,384,996,100924,47,1024,0


Converting to forward existential form...Done !
original formula: E(((!(AF(((i18.i0.u62.p185!=1) * EX((((i15.u63.p187==1)&&(i15.u101.p296==1))&&(i19.u134.p595==1)))))) + AG(!(AG(AX((i2.u69.p204==1)))))) ...386
=> equivalent forward existential formula: [(FwdU(FwdU(Init,((!(!(EG(!(((i18.i0.u62.p185!=1) * EX((((i15.u63.p187==1)&&(i15.u101.p296==1))&&(i19.u134.p595=...619
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t168, t176, t188, t270, t283, t376, t377, t378, t380, t381, t389, i0.i0.u81.t171, i0....1317
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 451/451 transitions.
Graph (trivial) has 246 edges and 515 vertex of which 6 / 515 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 1136 edges and 510 vertex of which 509 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 508 transition count 377
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 442 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 441 transition count 376
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 136 place count 441 transition count 276
Deduced a syphon composed of 100 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 356 place count 321 transition count 276
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 373 place count 304 transition count 259
Iterating global reduction 3 with 17 rules applied. Total rules applied 390 place count 304 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 390 place count 304 transition count 258
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 392 place count 303 transition count 258
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 638 place count 178 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 639 place count 177 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 640 place count 176 transition count 136
Applied a total of 640 rules in 98 ms. Remains 176 /515 variables (removed 339) and now considering 136/451 (removed 315) transitions.
// Phase 1: matrix 136 rows 176 cols
[2024-05-22 00:09:06] [INFO ] Computed 74 invariants in 1 ms
[2024-05-22 00:09:06] [INFO ] Implicit Places using invariants in 136 ms returned [0, 1, 2, 3, 4, 10, 11, 34, 35, 36, 37, 42, 43, 44, 48, 49, 50, 51, 52, 53, 54]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 137 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 155/515 places, 136/451 transitions.
Applied a total of 0 rules in 31 ms. Remains 155 /155 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 266 ms. Remains : 155/515 places, 136/451 transitions.
[2024-05-22 00:09:06] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:09:06] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:09:06] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-22 00:09:06] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:09:06] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:09:06] [INFO ] Time to serialize gal into /tmp/CTLFireability4493470927841891528.gal : 1 ms
[2024-05-22 00:09:06] [INFO ] Time to serialize properties into /tmp/CTLFireability16084859341654276709.ctl : 10 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/CTLFireability4493470927841891528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16084859341654276709.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,47559,0.145403,7148,2,1693,5,11826,6,0,755,8959,0


Converting to forward existential form...Done !
original formula: AG(EF(!(A((((p433==1)||(p335==1)) * EF((p73==1))) U A(((p607==1)&&(p610==1)) U (p557==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!((E(!(!((E(!((p557==1)) U (!(((p607==1)&&(p610==1))) * !((p557==1)))) + EG(!((...421
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t8, t11, t30, t33, t34, t35, t36, t37, t38, t39, t70, t71, t72, t73, t105, t106, t107...281
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.98949,58524,1,0,354,288804,278,209,5721,289569,478
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 451/451 transitions.
Graph (trivial) has 252 edges and 515 vertex of which 6 / 515 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 1136 edges and 510 vertex of which 509 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 508 transition count 375
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 440 transition count 375
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 138 place count 440 transition count 271
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 366 place count 316 transition count 271
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 387 place count 295 transition count 250
Iterating global reduction 2 with 21 rules applied. Total rules applied 408 place count 295 transition count 250
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 408 place count 295 transition count 248
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 412 place count 293 transition count 248
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 650 place count 172 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 651 place count 171 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 652 place count 170 transition count 130
Applied a total of 652 rules in 98 ms. Remains 170 /515 variables (removed 345) and now considering 130/451 (removed 321) transitions.
// Phase 1: matrix 130 rows 170 cols
[2024-05-22 00:09:08] [INFO ] Computed 74 invariants in 1 ms
[2024-05-22 00:09:08] [INFO ] Implicit Places using invariants in 173 ms returned [0, 1, 2, 3, 4, 11, 34, 35, 36, 37, 42, 43, 44, 48, 49, 50, 51, 52, 53, 54]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 174 ms to find 20 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/515 places, 130/451 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 277 ms. Remains : 150/515 places, 130/451 transitions.
[2024-05-22 00:09:08] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:09:08] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:09:08] [INFO ] Input system was already deterministic with 130 transitions.
[2024-05-22 00:09:08] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:09:08] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:09:08] [INFO ] Time to serialize gal into /tmp/CTLFireability15465844172556683053.gal : 1 ms
[2024-05-22 00:09:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12994066626104720347.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/CTLFireability15465844172556683053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12994066626104720347.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,18714,0.108265,7400,2,1692,5,12766,6,0,730,10792,0


Converting to forward existential form...Done !
original formula: EF(AG(EF((p81==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U (p81==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t26, t28, t29, t30, t31, t32, t63, t64, t65, t66, t67, t82, t83, t84, t101, t104, t105, t...266
(forward)formula 0,1,0.662744,23464,1,0,171,89348,247,90,5338,58918,239
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 451/451 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 491 transition count 427
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 491 transition count 427
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 484 transition count 420
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 484 transition count 420
Applied a total of 62 rules in 30 ms. Remains 484 /515 variables (removed 31) and now considering 420/451 (removed 31) transitions.
// Phase 1: matrix 420 rows 484 cols
[2024-05-22 00:09:09] [INFO ] Computed 99 invariants in 9 ms
[2024-05-22 00:09:09] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-22 00:09:09] [INFO ] Invariant cache hit.
[2024-05-22 00:09:10] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2024-05-22 00:09:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 56/95 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 12 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 115 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 88 places in 156 ms of which 4 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 71 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 20/139 constraints. Problems are: Problem set: 14 solved, 405 unsolved
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 93 places in 210 ms of which 3 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:09:27] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:09:27] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:09:27] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:09:27] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:09:27] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:09:27] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:09:27] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:09:28] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:09:28] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:09:28] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:09:28] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
Problem TDEAD381 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 20/159 constraints. Problems are: Problem set: 15 solved, 404 unsolved
[2024-05-22 00:09:31] [INFO ] Deduced a trap composed of 98 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:09:31] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:09:31] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:09:31] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:09:31] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 4 ms to minimize.
[2024-05-22 00:09:32] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:09:32] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:09:32] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:09:32] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:09:32] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:09:32] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 4 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
Problem TDEAD367 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 20/179 constraints. Problems are: Problem set: 21 solved, 398 unsolved
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 48 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:09:37] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
Problem TDEAD355 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 20/199 constraints. Problems are: Problem set: 25 solved, 394 unsolved
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 67 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:09:38] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:09:39] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/904 variables, and 208 constraints, problems are : Problem set: 25 solved, 394 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/484 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 25 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 39/39 constraints. Problems are: Problem set: 25 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/39 constraints. Problems are: Problem set: 25 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 56/95 constraints. Problems are: Problem set: 25 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 4/99 constraints. Problems are: Problem set: 25 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 109/208 constraints. Problems are: Problem set: 25 solved, 394 unsolved
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 77 places in 213 ms of which 9 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:09:44] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 4 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 93 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 69 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:09:45] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 2 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 2 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:09:47] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 20/228 constraints. Problems are: Problem set: 25 solved, 394 unsolved
[2024-05-22 00:09:48] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:09:49] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:09:50] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:09:51] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:09:52] [INFO ] Deduced a trap composed of 30 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 20/248 constraints. Problems are: Problem set: 25 solved, 394 unsolved
[2024-05-22 00:09:53] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:09:53] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:09:53] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:09:53] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:09:54] [INFO ] Deduced a trap composed of 84 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:09:55] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 4 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:09:56] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:09:57] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 20/268 constraints. Problems are: Problem set: 25 solved, 394 unsolved
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:09:58] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:09:59] [INFO ] Deduced a trap composed of 85 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:10:00] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:10:01] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:10:02] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
Problem TDEAD364 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 20/288 constraints. Problems are: Problem set: 26 solved, 393 unsolved
[2024-05-22 00:10:03] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:10:03] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:10:03] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:10:03] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:10:04] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:10:05] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:10:05] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:10:05] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:10:05] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:10:06] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:10:06] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:10:06] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:10:06] [INFO ] Deduced a trap composed of 87 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:10:07] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
Problem TDEAD369 is UNSAT
Problem TDEAD392 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 20/308 constraints. Problems are: Problem set: 28 solved, 391 unsolved
[2024-05-22 00:10:08] [INFO ] Deduced a trap composed of 77 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 88 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:10:09] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:10:10] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/904 variables, and 319 constraints, problems are : Problem set: 28 solved, 391 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/484 constraints, PredecessorRefiner: 0/419 constraints, Known Traps: 220/220 constraints]
After SMT, in 60124ms problems are : Problem set: 28 solved, 391 unsolved
Search for dead transitions found 28 dead transitions in 60129ms
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 : 484/515 places, 392/451 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 483 transition count 392
Applied a total of 1 rules in 14 ms. Remains 483 /484 variables (removed 1) and now considering 392/392 (removed 0) transitions.
// Phase 1: matrix 392 rows 483 cols
[2024-05-22 00:10:10] [INFO ] Computed 102 invariants in 5 ms
[2024-05-22 00:10:10] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-22 00:10:10] [INFO ] Invariant cache hit.
[2024-05-22 00:10:11] [INFO ] Implicit Places using invariants and state equation in 516 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 735 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 481/515 places, 392/451 transitions.
Applied a total of 0 rules in 11 ms. Remains 481 /481 variables (removed 0) and now considering 392/392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61880 ms. Remains : 481/515 places, 392/451 transitions.
[2024-05-22 00:10:11] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:10:11] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:10:11] [INFO ] Input system was already deterministic with 392 transitions.
[2024-05-22 00:10:11] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:10:11] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:10:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4586414384601048203.gal : 3 ms
[2024-05-22 00:10:11] [INFO ] Time to serialize properties into /tmp/CTLFireability6672068839174397651.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/CTLFireability4586414384601048203.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6672068839174397651.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:10:41] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:10:41] [INFO ] Applying decomposition
[2024-05-22 00:10:41] [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/graph17967238597504420732.txt' '-o' '/tmp/graph17967238597504420732.bin' '-w' '/tmp/graph17967238597504420732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17967238597504420732.bin' '-l' '-1' '-v' '-w' '/tmp/graph17967238597504420732.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:10:41] [INFO ] Decomposing Gal with order
[2024-05-22 00:10:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:10:41] [INFO ] Removed a total of 132 redundant transitions.
[2024-05-22 00:10:41] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:10:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 9 ms.
[2024-05-22 00:10:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11032275765914316116.gal : 7 ms
[2024-05-22 00:10:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14946611965792657444.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/CTLFireability11032275765914316116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14946611965792657444.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.61016e+25,1.17769,36848,4738,50,57135,578,1003,107680,66,1386,0


Converting to forward existential form...Done !
original formula: E((!(((i15.i0.u21.p60!=1) * AX(EF((i11.u121.p399==1))))) + AX((i14.u93.p277==1))) U (i2.i1.u9.p23==1))
=> equivalent forward existential formula: [(FwdU(Init,(!(((i15.i0.u21.p60!=1) * !(EX(!(E(TRUE U (i11.u121.p399==1))))))) + !(EX(!((i14.u93.p277==1)))))) *...184
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t166, t170, t186, t260, t272, t281, t372, t373, t374, t376, t377, t385, i0.i0.u84...1321
(forward)formula 0,0,7.45607,235376,1,0,441410,578,6397,684658,320,1429,1181291
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 451/451 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 495 transition count 431
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 495 transition count 431
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 491 transition count 427
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 491 transition count 427
Applied a total of 48 rules in 47 ms. Remains 491 /515 variables (removed 24) and now considering 427/451 (removed 24) transitions.
// Phase 1: matrix 427 rows 491 cols
[2024-05-22 00:10:49] [INFO ] Computed 99 invariants in 5 ms
[2024-05-22 00:10:49] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-22 00:10:49] [INFO ] Invariant cache hit.
[2024-05-22 00:10:50] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-05-22 00:10:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (OVERLAPS) 1/491 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-22 00:10:58] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:10:58] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:10:58] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:10:59] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:10:59] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:10:59] [INFO ] Deduced a trap composed of 73 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:10:59] [INFO ] Deduced a trap composed of 72 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:10:59] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:10:59] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:11:00] [INFO ] Deduced a trap composed of 91 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:11:00] [INFO ] Deduced a trap composed of 94 places in 186 ms of which 2 ms to minimize.
[2024-05-22 00:11:00] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:11:00] [INFO ] Deduced a trap composed of 96 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:11:00] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:11:00] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:11:00] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 20/119 constraints. Problems are: Problem set: 9 solved, 417 unsolved
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 20/139 constraints. Problems are: Problem set: 12 solved, 414 unsolved
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 86 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 1 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 96 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 20/159 constraints. Problems are: Problem set: 12 solved, 414 unsolved
[2024-05-22 00:11:10] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:11:10] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:11:10] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:11:10] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:11:10] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:11:10] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:11:10] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:11:10] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:11:11] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:11:11] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:11:11] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:11:11] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:11:11] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:11:11] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:11:11] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:11] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:11:12] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:11:12] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:11:12] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:11:12] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 20/179 constraints. Problems are: Problem set: 18 solved, 408 unsolved
[2024-05-22 00:11:12] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:11:12] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:11:12] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:11:12] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
Problem TDEAD353 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD395 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 20/199 constraints. Problems are: Problem set: 24 solved, 402 unsolved
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 96 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 95 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:11:17] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD400 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 20/219 constraints. Problems are: Problem set: 28 solved, 398 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 491/918 variables, and 219 constraints, problems are : Problem set: 28 solved, 398 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/491 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 28 solved, 398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 39/39 constraints. Problems are: Problem set: 28 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 0/39 constraints. Problems are: Problem set: 28 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/491 variables, 58/97 constraints. Problems are: Problem set: 28 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/491 variables, 2/99 constraints. Problems are: Problem set: 28 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/491 variables, 120/219 constraints. Problems are: Problem set: 28 solved, 398 unsolved
[2024-05-22 00:11:23] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 2 ms to minimize.
[2024-05-22 00:11:23] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:11:23] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:11:23] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:11:23] [INFO ] Deduced a trap composed of 75 places in 169 ms of which 2 ms to minimize.
[2024-05-22 00:11:24] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:11:24] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:11:24] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:11:24] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:11:24] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:11:24] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:11:25] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:11:25] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:25] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:11:25] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:11:25] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:11:25] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:11:25] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:11:25] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:11:25] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/491 variables, 20/239 constraints. Problems are: Problem set: 28 solved, 398 unsolved
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:11:27] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:27] [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 74 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 116 places in 100 ms of which 1 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 61 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:11:28] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 20/259 constraints. Problems are: Problem set: 28 solved, 398 unsolved
[2024-05-22 00:11:29] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:11:29] [INFO ] Deduced a trap composed of 90 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:11:30] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 20/279 constraints. Problems are: Problem set: 28 solved, 398 unsolved
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:11:33] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:11:33] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:11:33] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:11:33] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:11:34] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 72 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:11:35] [INFO ] Deduced a trap composed of 20 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:11:36] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 4 ms to minimize.
Problem TDEAD399 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 20/299 constraints. Problems are: Problem set: 29 solved, 397 unsolved
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 83 places in 214 ms of which 5 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 86 places in 230 ms of which 6 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 89 places in 162 ms of which 4 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 7 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:38] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 36 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:11:39] [INFO ] Deduced a trap composed of 84 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:11:41] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:11:41] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 20/319 constraints. Problems are: Problem set: 29 solved, 397 unsolved
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:11:42] [INFO ] Deduced a trap composed of 98 places in 160 ms of which 2 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:11:43] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 4 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:11:44] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2024-05-22 00:11:45] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 3 ms to minimize.
Problem TDEAD359 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 20/339 constraints. Problems are: Problem set: 31 solved, 395 unsolved
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:11:46] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 67 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:47] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:11:48] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:49] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 20/359 constraints. Problems are: Problem set: 31 solved, 395 unsolved
[2024-05-22 00:11:50] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 491/918 variables, and 360 constraints, problems are : Problem set: 31 solved, 395 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/491 constraints, PredecessorRefiner: 0/426 constraints, Known Traps: 261/261 constraints]
After SMT, in 60121ms problems are : Problem set: 31 solved, 395 unsolved
Search for dead transitions found 31 dead transitions in 60127ms
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 : 491/515 places, 396/451 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 489 transition count 396
Applied a total of 2 rules in 7 ms. Remains 489 /491 variables (removed 2) and now considering 396/396 (removed 0) transitions.
// Phase 1: matrix 396 rows 489 cols
[2024-05-22 00:11:50] [INFO ] Computed 104 invariants in 5 ms
[2024-05-22 00:11:50] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-22 00:11:50] [INFO ] Invariant cache hit.
[2024-05-22 00:11:50] [INFO ] Implicit Places using invariants and state equation in 413 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 589 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 488/515 places, 396/451 transitions.
Applied a total of 0 rules in 10 ms. Remains 488 /488 variables (removed 0) and now considering 396/396 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61633 ms. Remains : 488/515 places, 396/451 transitions.
[2024-05-22 00:11:50] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:11:50] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:11:50] [INFO ] Input system was already deterministic with 396 transitions.
[2024-05-22 00:11:50] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:11:51] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:11:51] [INFO ] Time to serialize gal into /tmp/CTLFireability2975101342650105900.gal : 15 ms
[2024-05-22 00:11:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6414969267756441680.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/CTLFireability2975101342650105900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6414969267756441680.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:21] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:12:21] [INFO ] Applying decomposition
[2024-05-22 00:12:21] [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/graph7112462863886371974.txt' '-o' '/tmp/graph7112462863886371974.bin' '-w' '/tmp/graph7112462863886371974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7112462863886371974.bin' '-l' '-1' '-v' '-w' '/tmp/graph7112462863886371974.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:12:21] [INFO ] Decomposing Gal with order
[2024-05-22 00:12:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:12:21] [INFO ] Removed a total of 113 redundant transitions.
[2024-05-22 00:12:21] [INFO ] Flatten gal took : 51 ms
[2024-05-22 00:12:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-22 00:12:21] [INFO ] Time to serialize gal into /tmp/CTLFireability14543521419663950068.gal : 6 ms
[2024-05-22 00:12:21] [INFO ] Time to serialize properties into /tmp/CTLFireability905969522798889705.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/CTLFireability14543521419663950068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability905969522798889705.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.67917e+25,0.809219,33508,3641,39,56110,601,1036,98596,69,1279,0


Converting to forward existential form...Done !
original formula: E((EX(((AG((((i6.i0.u29.p95==1)&&(i5.u24.p75==1))&&((i6.i1.u107.p326==1)&&(i19.u133.p595==1)))) * E((i13.u90.p270==1) U (i4.i0.u11.p27==1...755
=> equivalent forward existential formula: [((FwdU(EY(FwdU(Init,(EX(((!(E(TRUE U !((((i6.i0.u29.p95==1)&&(i5.u24.p75==1))&&((i6.i1.u107.p326==1)&&(i19.u133...856
Reverse transition relation is NOT exact ! Due to transitions t6, t170, t178, t182, t190, t267, t275, t279, t288, t377, t378, t380, t381, i0.i0.u132.t69, i...1390
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 451/451 transitions.
Graph (trivial) has 251 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1136 edges and 510 vertex of which 509 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 508 transition count 374
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 140 place count 439 transition count 374
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 140 place count 439 transition count 273
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 221 rules applied. Total rules applied 361 place count 319 transition count 273
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 382 place count 298 transition count 252
Iterating global reduction 2 with 21 rules applied. Total rules applied 403 place count 298 transition count 252
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 403 place count 298 transition count 250
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 407 place count 296 transition count 250
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 647 place count 174 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 648 place count 173 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 649 place count 172 transition count 131
Applied a total of 649 rules in 66 ms. Remains 172 /515 variables (removed 343) and now considering 131/451 (removed 320) transitions.
// Phase 1: matrix 131 rows 172 cols
[2024-05-22 00:12:51] [INFO ] Computed 75 invariants in 1 ms
[2024-05-22 00:12:51] [INFO ] Implicit Places using invariants in 178 ms returned [0, 1, 2, 3, 4, 8, 9, 32, 33, 34, 35, 36, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 180 ms to find 22 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/515 places, 131/451 transitions.
Applied a total of 0 rules in 3 ms. Remains 150 /150 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 249 ms. Remains : 150/515 places, 131/451 transitions.
[2024-05-22 00:12:51] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:12:51] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:12:51] [INFO ] Input system was already deterministic with 131 transitions.
[2024-05-22 00:12:51] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:12:51] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:12:51] [INFO ] Time to serialize gal into /tmp/CTLFireability10526921400174974082.gal : 1 ms
[2024-05-22 00:12:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13336296772042289163.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/CTLFireability10526921400174974082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13336296772042289163.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,11010,0.091118,6592,2,1364,5,9530,6,0,731,7425,0


Converting to forward existential form...Done !
original formula: EF((EF(((p625==1)&&(p628==1))) * (p533==1)))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (p533==1)),TRUE) * ((p625==1)&&(p628==1)))] != FALSE
(forward)formula 0,0,0.098304,6856,1,0,9,9530,10,2,1190,7425,4
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 451/451 transitions.
Graph (trivial) has 252 edges and 515 vertex of which 6 / 515 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 1136 edges and 510 vertex of which 509 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 508 transition count 375
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 440 transition count 375
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 138 place count 440 transition count 271
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 366 place count 316 transition count 271
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 387 place count 295 transition count 250
Iterating global reduction 2 with 21 rules applied. Total rules applied 408 place count 295 transition count 250
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 408 place count 295 transition count 248
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 412 place count 293 transition count 248
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 650 place count 172 transition count 131
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 651 place count 171 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 652 place count 170 transition count 130
Applied a total of 652 rules in 42 ms. Remains 170 /515 variables (removed 345) and now considering 130/451 (removed 321) transitions.
// Phase 1: matrix 130 rows 170 cols
[2024-05-22 00:12:51] [INFO ] Computed 74 invariants in 1 ms
[2024-05-22 00:12:52] [INFO ] Implicit Places using invariants in 161 ms returned [0, 1, 2, 6, 10, 11, 34, 35, 36, 37, 42, 43, 44, 48, 49, 50, 51, 52, 53, 54]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 162 ms to find 20 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/515 places, 130/451 transitions.
Applied a total of 0 rules in 3 ms. Remains 150 /150 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 207 ms. Remains : 150/515 places, 130/451 transitions.
[2024-05-22 00:12:52] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:12:52] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:12:52] [INFO ] Input system was already deterministic with 130 transitions.
[2024-05-22 00:12:52] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:12:52] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:12:52] [INFO ] Time to serialize gal into /tmp/CTLFireability9794005994490674336.gal : 2 ms
[2024-05-22 00:12:52] [INFO ] Time to serialize properties into /tmp/CTLFireability643085332441190118.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/CTLFireability9794005994490674336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability643085332441190118.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,31662,0.084308,6868,2,1560,5,11491,6,0,730,8579,0


Converting to forward existential form...Done !
original formula: EG(AG((p52==0)))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !((p52==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t26, t28, t29, t30, t31, t32, t63, t64, t65, t66, t67, t82, t83, t84, t100, t104, t105, t...266
(forward)formula 0,0,0.472241,24764,1,0,175,92588,254,93,5432,58258,241
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 451/451 transitions.
Graph (trivial) has 238 edges and 515 vertex of which 6 / 515 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1136 edges and 510 vertex of which 509 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 508 transition count 380
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 128 place count 445 transition count 380
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 128 place count 445 transition count 284
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 337 place count 332 transition count 284
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 355 place count 314 transition count 266
Iterating global reduction 2 with 18 rules applied. Total rules applied 373 place count 314 transition count 266
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 373 place count 314 transition count 265
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 375 place count 313 transition count 265
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 613 place count 192 transition count 148
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 619 place count 192 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 620 place count 191 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 621 place count 190 transition count 147
Applied a total of 621 rules in 32 ms. Remains 190 /515 variables (removed 325) and now considering 147/451 (removed 304) transitions.
// Phase 1: matrix 147 rows 190 cols
[2024-05-22 00:12:52] [INFO ] Computed 77 invariants in 1 ms
[2024-05-22 00:12:52] [INFO ] Implicit Places using invariants in 108 ms returned [0, 1, 2, 3, 4, 8, 9, 34, 38, 39, 46, 47, 48, 53, 57, 58, 59, 60, 61, 62, 63, 158]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 109 ms to find 22 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 168/515 places, 147/451 transitions.
Applied a total of 0 rules in 4 ms. Remains 168 /168 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 146 ms. Remains : 168/515 places, 147/451 transitions.
[2024-05-22 00:12:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:12:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:12:52] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-22 00:12:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:12:52] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:12:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7253081596902265247.gal : 1 ms
[2024-05-22 00:12:52] [INFO ] Time to serialize properties into /tmp/CTLFireability6973536849992324728.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/CTLFireability7253081596902265247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6973536849992324728.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,125664,0.089798,7236,2,2054,5,12071,6,0,817,10432,0


Converting to forward existential form...Done !
original formula: E((p596!=1) U ((E((((p162==1)&&(p382==1))&&(p542==1)) U (p207==1)) * !(A((p147==1) U (p300==1)))) * (AG(!(((p194==1)||(((p122==1)&&(p327=...233
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,(p596!=1)) * (E((((p162==1)&&(p382==1))&&(p542==1)) U (p207==1)) * !(!((E(!((p300==1)) U (!(...631
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t13, t15, t17, t49, t51, t52, t53, t54, t76, t77, t78, t79, t80, t100, t101, t102, t...284
Hit Full ! (commute/partial/dont) 145/0/2
(forward)formula 0,0,2.28727,79480,1,0,503,396924,322,260,6199,434379,626
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 515/515 places, 451/451 transitions.
Graph (trivial) has 248 edges and 515 vertex of which 6 / 515 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 1136 edges and 510 vertex of which 509 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 508 transition count 376
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 441 transition count 376
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 136 place count 441 transition count 274
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 359 place count 320 transition count 274
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 379 place count 300 transition count 254
Iterating global reduction 2 with 20 rules applied. Total rules applied 399 place count 300 transition count 254
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 399 place count 300 transition count 252
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 403 place count 298 transition count 252
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 635 place count 180 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 636 place count 179 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 637 place count 178 transition count 137
Applied a total of 637 rules in 31 ms. Remains 178 /515 variables (removed 337) and now considering 137/451 (removed 314) transitions.
// Phase 1: matrix 137 rows 178 cols
[2024-05-22 00:12:55] [INFO ] Computed 75 invariants in 1 ms
[2024-05-22 00:12:55] [INFO ] Implicit Places using invariants in 96 ms returned [34, 35, 36, 37, 42, 43, 46, 50, 51, 52, 53, 54, 55, 56]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 96 ms to find 14 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 164/515 places, 137/451 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 130 ms. Remains : 164/515 places, 137/451 transitions.
[2024-05-22 00:12:55] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:12:55] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:12:55] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-22 00:12:55] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:12:55] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:12:55] [INFO ] Time to serialize gal into /tmp/CTLFireability2212533076261592635.gal : 1 ms
[2024-05-22 00:12:55] [INFO ] Time to serialize properties into /tmp/CTLFireability5562394785537486826.ctl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2212533076261592635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5562394785537486826.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,25360,0.091684,8008,2,2496,5,13788,6,0,792,9822,0


Converting to forward existential form...Done !
original formula: !(E(!((!(EF(AG((p495==1)))) * !(E((((p184==1)&&(p397==1))&&(p554==1)) U (p394==1))))) U AG((p23==1))))
=> equivalent forward existential formula: [(FwdU(Init,!((!(E(TRUE U !(E(TRUE U !((p495==1)))))) * !(E((((p184==1)&&(p397==1))&&(p554==1)) U (p394==1))))))...192
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t31, t33, t34, t35, t36, t38, t69, t70, t71, t72, t73, t76, t78, t87, t90, t91, t107,...280
(forward)formula 0,1,0.879295,38764,1,0,194,122123,262,97,5900,76778,253
FORMULA BusinessProcesses-PT-15-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 451/451 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 493 transition count 429
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 493 transition count 429
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 486 transition count 422
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 486 transition count 422
Applied a total of 58 rules in 20 ms. Remains 486 /515 variables (removed 29) and now considering 422/451 (removed 29) transitions.
// Phase 1: matrix 422 rows 486 cols
[2024-05-22 00:12:56] [INFO ] Computed 99 invariants in 12 ms
[2024-05-22 00:12:56] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-22 00:12:56] [INFO ] Invariant cache hit.
[2024-05-22 00:12:56] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 803 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-05-22 00:12:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:13:05] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 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 96 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 82 places in 80 ms of which 2 ms to minimize.
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 20/139 constraints. Problems are: Problem set: 6 solved, 415 unsolved
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 108 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 1 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 20/159 constraints. Problems are: Problem set: 6 solved, 415 unsolved
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 1 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 20/179 constraints. Problems are: Problem set: 19 solved, 402 unsolved
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 93 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 85 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 111 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 83 places in 97 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.
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 20/199 constraints. Problems are: Problem set: 25 solved, 396 unsolved
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 89 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 75 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:13:19] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:20] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:13:20] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:13:20] [INFO ] Deduced a trap composed of 118 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:13:20] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:13:20] [INFO ] Deduced a trap composed of 129 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:20] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 20/219 constraints. Problems are: Problem set: 25 solved, 396 unsolved
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 89 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 113 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:24] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:13:25] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 1 ms to minimize.
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 20/239 constraints. Problems are: Problem set: 31 solved, 390 unsolved
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 1 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:13:27] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/908 variables, and 246 constraints, problems are : Problem set: 31 solved, 390 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/486 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 147/147 constraints]
Escalating to Integer solving :Problem set: 31 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 36/36 constraints. Problems are: Problem set: 31 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/485 variables, 0/36 constraints. Problems are: Problem set: 31 solved, 390 unsolved
At refinement iteration 2 (OVERLAPS) 1/486 variables, 60/96 constraints. Problems are: Problem set: 31 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 3/99 constraints. Problems are: Problem set: 31 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/486 variables, 147/246 constraints. Problems are: Problem set: 31 solved, 390 unsolved
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:13:30] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 1 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 89 places in 195 ms of which 2 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 86 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:13:31] [INFO ] Deduced a trap composed of 93 places in 192 ms of which 3 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 84 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/486 variables, 20/266 constraints. Problems are: Problem set: 31 solved, 390 unsolved
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:13:34] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 1 ms to minimize.
[2024-05-22 00:13:35] [INFO ] Deduced a trap composed of 84 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:13:35] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:13:35] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:13:35] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:13:35] [INFO ] Deduced a trap composed of 84 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:13:35] [INFO ] Deduced a trap composed of 92 places in 188 ms of which 3 ms to minimize.
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 86 places in 176 ms of which 2 ms to minimize.
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 81 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 89 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 20/286 constraints. Problems are: Problem set: 31 solved, 390 unsolved
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:13:38] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 3 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:13:39] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 99 places in 210 ms of which 3 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 84 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 93 places in 171 ms of which 2 ms to minimize.
[2024-05-22 00:13:40] [INFO ] Deduced a trap composed of 99 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 92 places in 217 ms of which 2 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 87 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:13:41] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 2 ms to minimize.
Problem TDEAD349 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 20/306 constraints. Problems are: Problem set: 33 solved, 388 unsolved
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:13:42] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:13:43] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 81 places in 182 ms of which 4 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:13:44] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 1 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:13:45] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 20/326 constraints. Problems are: Problem set: 33 solved, 388 unsolved
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:13:46] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 67 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 65 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:13:47] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:13:48] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 20/346 constraints. Problems are: Problem set: 33 solved, 388 unsolved
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:13:49] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 121 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:13:50] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:13:51] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:13:52] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:13:53] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 20/366 constraints. Problems are: Problem set: 33 solved, 388 unsolved
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 87 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:13:54] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 68 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 69 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 25 places in 187 ms of which 3 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 113 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:13:56] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/908 variables, and 380 constraints, problems are : Problem set: 33 solved, 388 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 0/486 constraints, PredecessorRefiner: 0/421 constraints, Known Traps: 281/281 constraints]
After SMT, in 60115ms problems are : Problem set: 33 solved, 388 unsolved
Search for dead transitions found 33 dead transitions in 60121ms
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 : 486/515 places, 389/451 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 483 transition count 389
Applied a total of 3 rules in 11 ms. Remains 483 /486 variables (removed 3) and now considering 389/389 (removed 0) transitions.
// Phase 1: matrix 389 rows 483 cols
[2024-05-22 00:13:57] [INFO ] Computed 105 invariants in 8 ms
[2024-05-22 00:13:57] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-22 00:13:57] [INFO ] Invariant cache hit.
[2024-05-22 00:13:57] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 483/515 places, 389/451 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61697 ms. Remains : 483/515 places, 389/451 transitions.
[2024-05-22 00:13:57] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:13:57] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:13:57] [INFO ] Input system was already deterministic with 389 transitions.
[2024-05-22 00:13:57] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:13:57] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:13:57] [INFO ] Time to serialize gal into /tmp/CTLFireability1428679234574652672.gal : 2 ms
[2024-05-22 00:13:57] [INFO ] Time to serialize properties into /tmp/CTLFireability9373022848827963727.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/CTLFireability1428679234574652672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9373022848827963727.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:14:28] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:14:28] [INFO ] Applying decomposition
[2024-05-22 00:14:28] [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/graph7006901488705945118.txt' '-o' '/tmp/graph7006901488705945118.bin' '-w' '/tmp/graph7006901488705945118.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7006901488705945118.bin' '-l' '-1' '-v' '-w' '/tmp/graph7006901488705945118.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:14:28] [INFO ] Decomposing Gal with order
[2024-05-22 00:14:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:14:28] [INFO ] Removed a total of 104 redundant transitions.
[2024-05-22 00:14:28] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:14:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2024-05-22 00:14:28] [INFO ] Time to serialize gal into /tmp/CTLFireability4196102273687222018.gal : 5 ms
[2024-05-22 00:14:28] [INFO ] Time to serialize properties into /tmp/CTLFireability17753867671625397490.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/CTLFireability4196102273687222018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17753867671625397490.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.7675e+25,0.792217,25172,3849,48,40987,827,961,69642,70,1803,0


Converting to forward existential form...Done !
original formula: EG(EF((EX(EF((i18.u133.p509==0))) * (i8.i0.u30.p93==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (EX(E(TRUE U (i18.u133.p509==0))) * (i8.i0.u30.p93==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t167, t171, t179, t187, t262, t274, t283, t369, t370, t371, t373, t374, t382, i0.i0.u131....1307
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 451/451 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 494 transition count 430
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 494 transition count 430
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 488 transition count 424
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 488 transition count 424
Applied a total of 54 rules in 27 ms. Remains 488 /515 variables (removed 27) and now considering 424/451 (removed 27) transitions.
// Phase 1: matrix 424 rows 488 cols
[2024-05-22 00:14:58] [INFO ] Computed 99 invariants in 5 ms
[2024-05-22 00:14:58] [INFO ] Implicit Places using invariants in 410 ms returned []
[2024-05-22 00:14:58] [INFO ] Invariant cache hit.
[2024-05-22 00:14:59] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
Running 423 sub problems to find dead transitions.
[2024-05-22 00:14:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (OVERLAPS) 1/488 variables, 59/98 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 78 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 88 places in 173 ms of which 5 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 91 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 91 places in 154 ms of which 2 ms to minimize.
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 20/119 constraints. Problems are: Problem set: 16 solved, 407 unsolved
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 75 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:15:11] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 93 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 78 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:15:13] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 20/139 constraints. Problems are: Problem set: 16 solved, 407 unsolved
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:15:14] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 65 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:15:16] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:15:16] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:15:16] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:15:16] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:15:16] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:15:17] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 3 ms to minimize.
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD396 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 20/159 constraints. Problems are: Problem set: 23 solved, 400 unsolved
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:15:20] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 89 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 98 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:15:21] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 3 ms to minimize.
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD386 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 20/179 constraints. Problems are: Problem set: 28 solved, 395 unsolved
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:15:22] [INFO ] Deduced a trap composed of 110 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:15:25] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:15:25] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
Problem TDEAD382 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 20/199 constraints. Problems are: Problem set: 29 solved, 394 unsolved
[2024-05-22 00:15:25] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 116 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 20 places in 59 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 488/912 variables, and 216 constraints, problems are : Problem set: 29 solved, 394 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/488 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 117/117 constraints]
Escalating to Integer solving :Problem set: 29 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 39/39 constraints. Problems are: Problem set: 29 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 0/39 constraints. Problems are: Problem set: 29 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 1/488 variables, 59/98 constraints. Problems are: Problem set: 29 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 1/99 constraints. Problems are: Problem set: 29 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 117/216 constraints. Problems are: Problem set: 29 solved, 394 unsolved
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:15:34] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:15:35] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:15:35] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:15:35] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:15:35] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:15:35] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:15:35] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 20/236 constraints. Problems are: Problem set: 29 solved, 394 unsolved
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 85 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 20/256 constraints. Problems are: Problem set: 29 solved, 394 unsolved
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 86 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:15:43] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-05-22 00:15:43] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:15:43] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:15:43] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:15:43] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:15:44] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 2 ms to minimize.
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 119 places in 147 ms of which 3 ms to minimize.
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 20/276 constraints. Problems are: Problem set: 32 solved, 391 unsolved
[2024-05-22 00:15:45] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:15:46] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:15:46] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:15:46] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:15:46] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:15:46] [INFO ] Deduced a trap composed of 91 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:15:46] [INFO ] Deduced a trap composed of 66 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:15:46] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:15:47] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:15:47] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:15:47] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:15:47] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 20/296 constraints. Problems are: Problem set: 32 solved, 391 unsolved
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
Problem TDEAD360 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 20/316 constraints. Problems are: Problem set: 33 solved, 390 unsolved
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 113 places in 224 ms of which 3 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 4 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 60229ms, After SMT, problems are : Problem set: 33 solved, 390 unsolved
Search for dead transitions found 33 dead transitions in 60235ms
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 : 488/515 places, 391/451 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 485 transition count 391
Applied a total of 3 rules in 9 ms. Remains 485 /488 variables (removed 3) and now considering 391/391 (removed 0) transitions.
// Phase 1: matrix 391 rows 485 cols
[2024-05-22 00:15:59] [INFO ] Computed 105 invariants in 2 ms
[2024-05-22 00:15:59] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 00:15:59] [INFO ] Invariant cache hit.
[2024-05-22 00:16:00] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 622 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 485/515 places, 391/451 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61865 ms. Remains : 485/515 places, 391/451 transitions.
[2024-05-22 00:16:00] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:16:00] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:16:00] [INFO ] Input system was already deterministic with 391 transitions.
[2024-05-22 00:16:00] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:16:00] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:16:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3864909275731247365.gal : 4 ms
[2024-05-22 00:16:00] [INFO ] Time to serialize properties into /tmp/CTLFireability17316024956191262592.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/CTLFireability3864909275731247365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17316024956191262592.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:30] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:16:30] [INFO ] Applying decomposition
[2024-05-22 00:16:30] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3039829047227955502.txt' '-o' '/tmp/graph3039829047227955502.bin' '-w' '/tmp/graph3039829047227955502.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3039829047227955502.bin' '-l' '-1' '-v' '-w' '/tmp/graph3039829047227955502.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:16:30] [INFO ] Decomposing Gal with order
[2024-05-22 00:16:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:16:30] [INFO ] Removed a total of 105 redundant transitions.
[2024-05-22 00:16:30] [INFO ] Flatten gal took : 53 ms
[2024-05-22 00:16:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2024-05-22 00:16:30] [INFO ] Time to serialize gal into /tmp/CTLFireability5687990429478371227.gal : 6 ms
[2024-05-22 00:16:30] [INFO ] Time to serialize properties into /tmp/CTLFireability11563606654837043158.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/CTLFireability5687990429478371227.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11563606654837043158.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.76336e+25,6.38257,146340,8085,45,204663,576,970,406377,67,1383,0


Converting to forward existential form...Done !
original formula: AG((((i6.u25.p68==1) + EF((AX((i13.i1.u54.p160==0)) * (A((i19.i2.u128.p428==1) U (((i9.i0.u69.p203==1)&&(i11.u125.p411==1))&&(i20.u134.p5...366
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((E(TRUE U (((i9.i1.u66.p197!=1)||(i12.u123.p402!=1))||(i9.i1.u153.p624!=1))) * !((E(!(E(...702
Reverse transition relation is NOT exact ! Due to transitions t6, t167, t179, t187, t263, t276, t371, t373, t375, t376, t384, i0.i0.u81.t170, i0.i0.u132.t6...1353
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 451/451 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 491 transition count 427
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 491 transition count 427
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 484 transition count 420
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 484 transition count 420
Applied a total of 62 rules in 21 ms. Remains 484 /515 variables (removed 31) and now considering 420/451 (removed 31) transitions.
// Phase 1: matrix 420 rows 484 cols
[2024-05-22 00:17:00] [INFO ] Computed 99 invariants in 4 ms
[2024-05-22 00:17:00] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-22 00:17:00] [INFO ] Invariant cache hit.
[2024-05-22 00:17:01] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 851 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2024-05-22 00:17:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 56/95 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 69 places in 155 ms of which 6 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:17:09] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 5 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 20 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 115 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 75 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 112 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:17:12] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 20 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 3 ms to minimize.
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 20/139 constraints. Problems are: Problem set: 14 solved, 405 unsolved
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 66 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:17:15] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 4 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 4 ms to minimize.
[2024-05-22 00:17:17] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:17:17] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:17:17] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:17] [INFO ] Deduced a trap composed of 68 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:17:17] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:17:17] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
Problem TDEAD381 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 20/159 constraints. Problems are: Problem set: 15 solved, 404 unsolved
[2024-05-22 00:17:20] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:17:21] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:17:22] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:17:23] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:17:24] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 3 ms to minimize.
Problem TDEAD367 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 20/179 constraints. Problems are: Problem set: 21 solved, 398 unsolved
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 70 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:17:25] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 86 places in 178 ms of which 5 ms to minimize.
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 66 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:17:26] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 83 places in 158 ms of which 6 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:17:27] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
Problem TDEAD355 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 20/199 constraints. Problems are: Problem set: 25 solved, 394 unsolved
[2024-05-22 00:17:28] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:17:28] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:17:28] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:17:28] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 89 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:17:29] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:17:30] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:17:31] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:17:31] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:17:31] [INFO ] Deduced a trap composed of 127 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:17:31] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/904 variables, and 217 constraints, problems are : Problem set: 25 solved, 394 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/484 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 118/118 constraints]
Escalating to Integer solving :Problem set: 25 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 39/39 constraints. Problems are: Problem set: 25 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/39 constraints. Problems are: Problem set: 25 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 56/95 constraints. Problems are: Problem set: 25 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 4/99 constraints. Problems are: Problem set: 25 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 118/217 constraints. Problems are: Problem set: 25 solved, 394 unsolved
[2024-05-22 00:17:34] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:17:35] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:17:35] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:17:35] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:17:35] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:17:35] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:17:35] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:17:35] [INFO ] Deduced a trap composed of 72 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:17:36] [INFO ] Deduced a trap composed of 67 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:17:36] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:17:36] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:17:36] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:17:36] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:17:36] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:17:36] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:17:36] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:17:37] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 20/237 constraints. Problems are: Problem set: 25 solved, 394 unsolved
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 4 ms to minimize.
[2024-05-22 00:17:38] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 16 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:17:40] [INFO ] Deduced a trap composed of 70 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:17:41] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:17:42] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 20/257 constraints. Problems are: Problem set: 25 solved, 394 unsolved
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 85 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 3 ms to minimize.
Problem TDEAD364 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 20/277 constraints. Problems are: Problem set: 27 solved, 392 unsolved
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 76 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 108 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 107 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 34 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:17:53] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 20/297 constraints. Problems are: Problem set: 27 solved, 392 unsolved
[2024-05-22 00:17:55] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 86 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 83 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 66 places in 148 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 20/317 constraints. Problems are: Problem set: 27 solved, 392 unsolved
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:18:01] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:18:01] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:18:01] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:18:01] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
SMT process timed out in 60134ms, After SMT, problems are : Problem set: 27 solved, 392 unsolved
Search for dead transitions found 27 dead transitions in 60138ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in LTL mode, iteration 1 : 484/515 places, 393/451 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 483 transition count 393
Applied a total of 1 rules in 10 ms. Remains 483 /484 variables (removed 1) and now considering 393/393 (removed 0) transitions.
// Phase 1: matrix 393 rows 483 cols
[2024-05-22 00:18:01] [INFO ] Computed 102 invariants in 4 ms
[2024-05-22 00:18:01] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-22 00:18:01] [INFO ] Invariant cache hit.
[2024-05-22 00:18:02] [INFO ] Implicit Places using invariants and state equation in 448 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 713 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 481/515 places, 393/451 transitions.
Applied a total of 0 rules in 8 ms. Remains 481 /481 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61744 ms. Remains : 481/515 places, 393/451 transitions.
[2024-05-22 00:18:02] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:18:02] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:18:02] [INFO ] Input system was already deterministic with 393 transitions.
[2024-05-22 00:18:02] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:18:02] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:18:02] [INFO ] Time to serialize gal into /tmp/CTLFireability15122355504107872454.gal : 4 ms
[2024-05-22 00:18:02] [INFO ] Time to serialize properties into /tmp/CTLFireability5954984666135446683.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/CTLFireability15122355504107872454.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5954984666135446683.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:18:32] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:18:32] [INFO ] Applying decomposition
[2024-05-22 00:18:32] [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/graph16483943060208355012.txt' '-o' '/tmp/graph16483943060208355012.bin' '-w' '/tmp/graph16483943060208355012.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16483943060208355012.bin' '-l' '-1' '-v' '-w' '/tmp/graph16483943060208355012.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:18:32] [INFO ] Decomposing Gal with order
[2024-05-22 00:18:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:18:32] [INFO ] Removed a total of 134 redundant transitions.
[2024-05-22 00:18:32] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:18:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-22 00:18:32] [INFO ] Time to serialize gal into /tmp/CTLFireability18388962051951543886.gal : 4 ms
[2024-05-22 00:18:32] [INFO ] Time to serialize properties into /tmp/CTLFireability8815184915449999587.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/CTLFireability18388962051951543886.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8815184915449999587.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.61016e+25,5.50695,139476,11297,47,194429,567,988,439733,65,1343,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 515/515 places, 451/451 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 491 transition count 427
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 491 transition count 427
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 484 transition count 420
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 484 transition count 420
Applied a total of 62 rules in 19 ms. Remains 484 /515 variables (removed 31) and now considering 420/451 (removed 31) transitions.
// Phase 1: matrix 420 rows 484 cols
[2024-05-22 00:19:02] [INFO ] Computed 99 invariants in 20 ms
[2024-05-22 00:19:02] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-22 00:19:02] [INFO ] Invariant cache hit.
[2024-05-22 00:19:03] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2024-05-22 00:19:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 56/95 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 71 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 94 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 115 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 112 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:19:14] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 102 places in 92 ms of which 1 ms to minimize.
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 20/139 constraints. Problems are: Problem set: 14 solved, 405 unsolved
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:15] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 1 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:19:16] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 78 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:19:17] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
Problem TDEAD381 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 20/159 constraints. Problems are: Problem set: 15 solved, 404 unsolved
[2024-05-22 00:19:20] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:19:20] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:19:20] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:19:20] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:19:20] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:19:21] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 5 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:19:22] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:23] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 1 ms to minimize.
Problem TDEAD367 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 20/179 constraints. Problems are: Problem set: 21 solved, 398 unsolved
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 77 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:19:24] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:19:25] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
Problem TDEAD355 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 20/199 constraints. Problems are: Problem set: 25 solved, 394 unsolved
[2024-05-22 00:19:26] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 1 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:19:27] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 67 places in 184 ms of which 3 ms to minimize.
[2024-05-22 00:19:28] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:19:29] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 127 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:19:30] [INFO ] Deduced a trap composed of 117 places in 158 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 20/219 constraints. Problems are: Problem set: 25 solved, 394 unsolved
[2024-05-22 00:19:33] [INFO ] Deduced a trap composed of 91 places in 73 ms of which 1 ms to minimize.
[2024-05-22 00:19:33] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:19:33] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 25 solved, 394 unsolved
Search for dead transitions found 25 dead transitions in 30174ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 484/515 places, 395/451 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 483 transition count 395
Applied a total of 1 rules in 7 ms. Remains 483 /484 variables (removed 1) and now considering 395/395 (removed 0) transitions.
// Phase 1: matrix 395 rows 483 cols
[2024-05-22 00:19:33] [INFO ] Computed 100 invariants in 2 ms
[2024-05-22 00:19:33] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-22 00:19:33] [INFO ] Invariant cache hit.
[2024-05-22 00:19:34] [INFO ] Implicit Places using invariants and state equation in 359 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 511 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 481/515 places, 395/451 transitions.
Applied a total of 0 rules in 6 ms. Remains 481 /481 variables (removed 0) and now considering 395/395 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31535 ms. Remains : 481/515 places, 395/451 transitions.
[2024-05-22 00:19:34] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:19:34] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:19:34] [INFO ] Input system was already deterministic with 395 transitions.
[2024-05-22 00:19:34] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:19:34] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:19:34] [INFO ] Time to serialize gal into /tmp/CTLFireability7848615264703439254.gal : 1 ms
[2024-05-22 00:19:34] [INFO ] Time to serialize properties into /tmp/CTLFireability13993169451335498081.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/CTLFireability7848615264703439254.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13993169451335498081.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:04] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:20:04] [INFO ] Applying decomposition
[2024-05-22 00:20:04] [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/graph207457720421237123.txt' '-o' '/tmp/graph207457720421237123.bin' '-w' '/tmp/graph207457720421237123.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph207457720421237123.bin' '-l' '-1' '-v' '-w' '/tmp/graph207457720421237123.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:20:04] [INFO ] Decomposing Gal with order
[2024-05-22 00:20:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:20:04] [INFO ] Removed a total of 144 redundant transitions.
[2024-05-22 00:20:04] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:20:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-22 00:20:04] [INFO ] Time to serialize gal into /tmp/CTLFireability281094862422835343.gal : 6 ms
[2024-05-22 00:20:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14595157888264239712.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/CTLFireability281094862422835343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14595157888264239712.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.61016e+25,1.03449,35720,4389,46,61729,637,1002,113706,67,1402,0


Converting to forward existential form...Done !
original formula: AG(((i9.i2.u161.p605==0) + AG(AX((((i2.i0.u62.p190==1)&&(i16.u96.p292==1))&&(i2.i0.u149.p558==1))))))
=> equivalent forward existential formula: [(EY(FwdU((FwdU(Init,TRUE) * !((i9.i2.u161.p605==0))),TRUE)) * !((((i2.i0.u62.p190==1)&&(i16.u96.p292==1))&&(i2....183
(forward)formula 0,0,1.08467,35984,1,0,61729,637,2383,113706,117,1402,22771
FORMULA BusinessProcesses-PT-15-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 00:20:05] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:20:05] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:20:05] [INFO ] Applying decomposition
[2024-05-22 00:20:05] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3618852481100170493.txt' '-o' '/tmp/graph3618852481100170493.bin' '-w' '/tmp/graph3618852481100170493.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3618852481100170493.bin' '-l' '-1' '-v' '-w' '/tmp/graph3618852481100170493.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:20:05] [INFO ] Decomposing Gal with order
[2024-05-22 00:20:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:20:05] [INFO ] Removed a total of 250 redundant transitions.
[2024-05-22 00:20:05] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:20:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-22 00:20:05] [INFO ] Time to serialize gal into /tmp/CTLFireability14990987886360370613.gal : 5 ms
[2024-05-22 00:20:05] [INFO ] Time to serialize properties into /tmp/CTLFireability16794636546300953949.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/CTLFireability14990987886360370613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16794636546300953949.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 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.91812e+25,4.37309,133512,12370,49,205596,594,1188,517018,59,1620,0


Converting to forward existential form...Done !
original formula: AF(!(A(((i13.i2.u122.p373==1)||((i11.u26.p75==1)&&(i19.u148.p460==1))) U EX((EF((i20.u150.p470==1)) + EG((i14.i3.u126.p388==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(EX((E(TRUE U (i20.u150.p470==1)) + EG((i14.i3.u126.p388==1))))) U (!(((i13.i2.u122.p373==1...354
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t188, t192, t288, t299, t312, t433, t435, i0.t200, i0.t196, i0.u77.t207, i0.u79.t...1631
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
[2024-05-22 00:45:15] [INFO ] Applying decomposition
[2024-05-22 00:45:15] [INFO ] Flatten gal took : 32 ms
[2024-05-22 00:45:15] [INFO ] Decomposing Gal with order
[2024-05-22 00:45:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:45:15] [INFO ] Removed a total of 122 redundant transitions.
[2024-05-22 00:45:15] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:45:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 102 ms.
[2024-05-22 00:45:16] [INFO ] Time to serialize gal into /tmp/CTLFireability1166377231148265345.gal : 12 ms
[2024-05-22 00:45:16] [INFO ] Time to serialize properties into /tmp/CTLFireability9509417201605754463.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/CTLFireability1166377231148265345.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9509417201605754463.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 6 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 00:53:22] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:53:22] [INFO ] Input system was already deterministic with 451 transitions.
[2024-05-22 00:53:22] [INFO ] Transformed 515 places.
[2024-05-22 00:53:22] [INFO ] Transformed 451 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:53:52] [INFO ] Time to serialize gal into /tmp/CTLFireability1583500446502405900.gal : 5 ms
[2024-05-22 00:53:52] [INFO ] Time to serialize properties into /tmp/CTLFireability12684062573548911387.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/CTLFireability1583500446502405900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12684062573548911387.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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

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

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