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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K 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.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:32 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 189K 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-19-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-19-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716337372734

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 00:22:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:22:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:22:54] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-22 00:22:54] [INFO ] Transformed 772 places.
[2024-05-22 00:22:54] [INFO ] Transformed 685 transitions.
[2024-05-22 00:22:54] [INFO ] Found NUPN structural information;
[2024-05-22 00:22:54] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 15 transitions.
Support contains 110 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 750 transition count 670
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 92 place count 665 transition count 585
Iterating global reduction 1 with 85 rules applied. Total rules applied 177 place count 665 transition count 585
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 214 place count 628 transition count 548
Iterating global reduction 1 with 37 rules applied. Total rules applied 251 place count 628 transition count 548
Applied a total of 251 rules in 143 ms. Remains 628 /757 variables (removed 129) and now considering 548/670 (removed 122) transitions.
// Phase 1: matrix 548 rows 628 cols
[2024-05-22 00:22:54] [INFO ] Computed 118 invariants in 39 ms
[2024-05-22 00:22:55] [INFO ] Implicit Places using invariants in 610 ms returned []
[2024-05-22 00:22:55] [INFO ] Invariant cache hit.
[2024-05-22 00:22:55] [INFO ] Implicit Places using invariants and state equation in 695 ms returned []
Implicit Place search using SMT with State Equation took 1336 ms to find 0 implicit places.
Running 547 sub problems to find dead transitions.
[2024-05-22 00:22:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 2 (OVERLAPS) 2/628 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/628 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 125 places in 185 ms of which 30 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 130 places in 179 ms of which 4 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 126 places in 148 ms of which 4 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 124 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 114 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 5 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 126 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 123 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 143 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 132 places in 166 ms of which 4 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 113 places in 159 ms of which 4 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 127 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 127 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 117 places in 126 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/628 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 95 places in 212 ms of which 3 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 134 places in 147 ms of which 4 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 122 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 127 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 120 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 123 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 126 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 136 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 125 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 133 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 140 places in 114 ms of which 5 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 132 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 107 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 106 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 120 places in 135 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/628 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 124 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:23:16] [INFO ] Deduced a trap composed of 126 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 139 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 135 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 143 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 150 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 118 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 121 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:23:17] [INFO ] Deduced a trap composed of 114 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 115 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 114 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 121 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 121 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 134 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 136 places in 101 ms of which 4 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 116 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 127 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 132 places in 139 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 135 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 120 places in 152 ms of which 4 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 119 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 116 places in 168 ms of which 4 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 4 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 115 places in 136 ms of which 3 ms to minimize.
SMT process timed out in 30324ms, After SMT, problems are : Problem set: 0 solved, 547 unsolved
Search for dead transitions found 0 dead transitions in 30349ms
Starting structural reductions in LTL mode, iteration 1 : 628/757 places, 548/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31850 ms. Remains : 628/757 places, 548/670 transitions.
Support contains 110 out of 628 places after structural reductions.
[2024-05-22 00:23:26] [INFO ] Flatten gal took : 102 ms
[2024-05-22 00:23:26] [INFO ] Flatten gal took : 46 ms
[2024-05-22 00:23:26] [INFO ] Input system was already deterministic with 548 transitions.
Support contains 90 out of 628 places (down from 110) after GAL structural reductions.
RANDOM walk for 40000 steps (219 resets) in 1819 ms. (21 steps per ms) remains 28/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
[2024-05-22 00:23:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 246/292 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 188/480 variables, 50/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 130/610 variables, 44/115 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/610 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 3/613 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 538/1151 variables, 613/731 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1151 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 11 (OVERLAPS) 21/1172 variables, 11/742 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1172 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 13 (OVERLAPS) 4/1176 variables, 4/746 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1176 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 15 (OVERLAPS) 0/1176 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1176/1176 variables, and 746 constraints, problems are : Problem set: 0 solved, 28 unsolved in 2604 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 628/628 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 1 (OVERLAPS) 246/292 variables, 21/21 constraints. Problems are: Problem set: 1 solved, 27 unsolved
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 188/480 variables, 50/73 constraints. Problems are: Problem set: 1 solved, 27 unsolved
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:23:30] [INFO ] Deduced a trap composed of 118 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 120 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 121 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 124 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 127 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 119 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 120 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 123 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 119 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 20/93 constraints. Problems are: Problem set: 1 solved, 27 unsolved
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 122 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 121 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 122 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 121 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 114 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 114 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 121 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 116 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:23:34] [INFO ] Deduced a trap composed of 117 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:23:34] [INFO ] Deduced a trap composed of 115 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:23:34] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:23:34] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:23:34] [INFO ] Deduced a trap composed of 121 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:23:34] [INFO ] Deduced a trap composed of 120 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:23:34] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:23:34] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:23:35] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:35] [INFO ] Deduced a trap composed of 118 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 7683ms, After SMT, problems are : Problem set: 1 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 44 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 548/548 transitions.
Graph (complete) has 1366 edges and 628 vertex of which 626 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 626 transition count 487
Reduce places removed 60 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 67 rules applied. Total rules applied 128 place count 566 transition count 480
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 135 place count 559 transition count 480
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 111 Pre rules applied. Total rules applied 135 place count 559 transition count 369
Deduced a syphon composed of 111 places in 2 ms
Ensure Unique test removed 16 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 373 place count 432 transition count 369
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 386 place count 419 transition count 356
Iterating global reduction 3 with 13 rules applied. Total rules applied 399 place count 419 transition count 356
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 399 place count 419 transition count 355
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 401 place count 418 transition count 355
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 402 place count 417 transition count 354
Iterating global reduction 3 with 1 rules applied. Total rules applied 403 place count 417 transition count 354
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 312 rules applied. Total rules applied 715 place count 260 transition count 199
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 717 place count 259 transition count 201
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 719 place count 259 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 720 place count 258 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 721 place count 257 transition count 200
Applied a total of 721 rules in 183 ms. Remains 257 /628 variables (removed 371) and now considering 200/548 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 257/628 places, 200/548 transitions.
RANDOM walk for 40000 steps (2373 resets) in 1042 ms. (38 steps per ms) remains 21/27 properties
BEST_FIRST walk for 4003 steps (56 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (58 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (53 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (57 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (63 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (61 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (56 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (58 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (57 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (65 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (53 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (61 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (51 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (56 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (53 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (59 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (57 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (49 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (54 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (55 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (58 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
// Phase 1: matrix 200 rows 257 cols
[2024-05-22 00:23:35] [INFO ] Computed 98 invariants in 5 ms
[2024-05-22 00:23:35] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 77/111 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 30/141 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 53/194 variables, 29/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 7/201 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 200/401 variables, 201/273 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 56/457 variables, 56/331 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/457 variables, 26/357 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/457 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 0/457 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/457 variables, and 357 constraints, problems are : Problem set: 0 solved, 21 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 257/257 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 77/111 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 30/141 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 67 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 65 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 6 (OVERLAPS) 53/194 variables, 29/67 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 66 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 58 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 65 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 61 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 15/82 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 7/201 variables, 7/89 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 1/90 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 200/401 variables, 201/291 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/401 variables, 2/293 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 8/301 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/401 variables, 0/301 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 56/457 variables, 56/357 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/457 variables, 26/383 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/457 variables, 12/395 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-22 00:23:38] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:23:38] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:23:38] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:23:38] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:23:39] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:23:39] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:23:39] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:23:39] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:23:39] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/457 variables, 9/404 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-22 00:23:39] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:23:39] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:23:39] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:23:40] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/457 variables, 4/408 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/457 variables, 0/408 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 22 (OVERLAPS) 0/457 variables, 0/408 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/457 variables, and 408 constraints, problems are : Problem set: 1 solved, 20 unsolved in 4472 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 257/257 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 31/31 constraints]
After SMT, in 5188ms problems are : Problem set: 1 solved, 20 unsolved
Fused 20 Parikh solutions to 19 different solutions.
Finished Parikh walk after 93 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=93 )
Parikh walk visited 20 properties in 1742 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-22 00:23:42] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:23:42] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:23:42] [INFO ] Input system was already deterministic with 548 transitions.
Computed a total of 568 stabilizing places and 498 stable transitions
Graph (complete) has 1366 edges and 628 vertex of which 626 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Graph (trivial) has 315 edges and 628 vertex of which 7 / 628 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1359 edges and 622 vertex of which 620 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 620 transition count 458
Reduce places removed 82 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 83 rules applied. Total rules applied 167 place count 538 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 537 transition count 457
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 168 place count 537 transition count 331
Deduced a syphon composed of 126 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 277 rules applied. Total rules applied 445 place count 386 transition count 331
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 474 place count 357 transition count 302
Iterating global reduction 3 with 29 rules applied. Total rules applied 503 place count 357 transition count 302
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 503 place count 357 transition count 298
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 513 place count 351 transition count 298
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 514 place count 350 transition count 297
Iterating global reduction 3 with 1 rules applied. Total rules applied 515 place count 350 transition count 297
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 295 rules applied. Total rules applied 810 place count 201 transition count 151
Applied a total of 810 rules in 121 ms. Remains 201 /628 variables (removed 427) and now considering 151/548 (removed 397) transitions.
// Phase 1: matrix 151 rows 201 cols
[2024-05-22 00:23:43] [INFO ] Computed 87 invariants in 3 ms
[2024-05-22 00:23:43] [INFO ] Implicit Places using invariants in 156 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 157 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 200/628 places, 151/548 transitions.
Applied a total of 0 rules in 12 ms. Remains 200 /200 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 290 ms. Remains : 200/628 places, 151/548 transitions.
[2024-05-22 00:23:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:23:43] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:23:43] [INFO ] Input system was already deterministic with 151 transitions.
[2024-05-22 00:23:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:23:43] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:23:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality563365801373870949.gal : 4 ms
[2024-05-22 00:23:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality3618186982763265923.ctl : 9 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/CTLCardinality563365801373870949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3618186982763265923.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,1.39312e+06,0.406645,24156,2,8003,5,84235,6,0,952,54330,0


Converting to forward existential form...Done !
original formula: AG(EF((((p321==1) + EF(((p560==0)&&(p6==1)))) + EF((p407==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p321==1) + E(TRUE U ((p560==0)&&(p6==1)))) + E(TRUE U (p407==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t36, t37, t38, t39, t40, t73, t74, t75, t76, t77, t80, t91, t94, t95, t109, t117, t118, t...308
(forward)formula 0,0,3.05042,114936,1,0,217,444227,288,115,7151,210224,291
FORMULA BusinessProcesses-PT-19-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Graph (trivial) has 313 edges and 628 vertex of which 7 / 628 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1359 edges and 622 vertex of which 620 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 619 transition count 456
Reduce places removed 83 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 169 place count 536 transition count 455
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 170 place count 535 transition count 455
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 123 Pre rules applied. Total rules applied 170 place count 535 transition count 332
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 440 place count 388 transition count 332
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 468 place count 360 transition count 304
Iterating global reduction 3 with 28 rules applied. Total rules applied 496 place count 360 transition count 304
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 496 place count 360 transition count 301
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 504 place count 355 transition count 301
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 505 place count 354 transition count 300
Iterating global reduction 3 with 1 rules applied. Total rules applied 506 place count 354 transition count 300
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 804 place count 204 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 806 place count 203 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 807 place count 202 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 808 place count 201 transition count 150
Applied a total of 808 rules in 84 ms. Remains 201 /628 variables (removed 427) and now considering 150/548 (removed 398) transitions.
// Phase 1: matrix 150 rows 201 cols
[2024-05-22 00:23:46] [INFO ] Computed 88 invariants in 3 ms
[2024-05-22 00:23:46] [INFO ] Implicit Places using invariants in 244 ms returned [0, 1, 2, 3, 4, 12, 13, 14, 15, 16, 17, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 246 ms to find 29 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 172/628 places, 150/548 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 337 ms. Remains : 172/628 places, 150/548 transitions.
[2024-05-22 00:23:46] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:23:46] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:23:46] [INFO ] Input system was already deterministic with 150 transitions.
[2024-05-22 00:23:46] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:23:46] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:23:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality6379903458368589194.gal : 2 ms
[2024-05-22 00:23:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality4548240003902051546.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/CTLCardinality6379903458368589194.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4548240003902051546.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.56355e+06,0.178297,10424,2,2700,5,19569,6,0,836,14680,0


Converting to forward existential form...Done !
original formula: EF(EG(E(AF(((p370==0)||(p694==1))) U AG((p688==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),E(!(EG(!(((p370==0)||(p694==1))))) U !(E(TRUE U !((p688==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t37, t38, t39, t40, t41, t42, t75, t76, t77, t78, t79, t91, t98, t99, t112, t120, t121, t122,...292
(forward)formula 0,1,1.54866,60364,1,0,273,283717,300,153,6138,212633,360
FORMULA BusinessProcesses-PT-19-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Graph (trivial) has 315 edges and 628 vertex of which 7 / 628 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1359 edges and 622 vertex of which 620 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 619 transition count 455
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 170 place count 535 transition count 455
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 170 place count 535 transition count 331
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 442 place count 387 transition count 331
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 472 place count 357 transition count 301
Iterating global reduction 2 with 30 rules applied. Total rules applied 502 place count 357 transition count 301
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 502 place count 357 transition count 297
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 512 place count 351 transition count 297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 513 place count 350 transition count 296
Iterating global reduction 2 with 1 rules applied. Total rules applied 514 place count 350 transition count 296
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 295 rules applied. Total rules applied 809 place count 201 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 811 place count 200 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 812 place count 199 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 813 place count 198 transition count 148
Applied a total of 813 rules in 50 ms. Remains 198 /628 variables (removed 430) and now considering 148/548 (removed 400) transitions.
// Phase 1: matrix 148 rows 198 cols
[2024-05-22 00:23:48] [INFO ] Computed 87 invariants in 2 ms
[2024-05-22 00:23:48] [INFO ] Implicit Places using invariants in 302 ms returned [0, 1, 2, 3, 4, 12, 13, 14, 15, 16, 17, 21, 22, 23, 24, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 174]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 302 ms to find 28 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 170/628 places, 148/548 transitions.
Applied a total of 0 rules in 5 ms. Remains 170 /170 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 358 ms. Remains : 170/628 places, 148/548 transitions.
[2024-05-22 00:23:48] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:23:48] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:23:48] [INFO ] Input system was already deterministic with 148 transitions.
[2024-05-22 00:23:48] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:23:48] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:23:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality593863523659258351.gal : 2 ms
[2024-05-22 00:23:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality5645438825712627335.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/CTLCardinality593863523659258351.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5645438825712627335.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,1.39536e+06,0.173054,9880,2,2470,5,18478,6,0,826,13099,0


Converting to forward existential form...Done !
original formula: EF(AG(E((p293==0) U AG((p197!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E((p293==0) U !(E(TRUE U !((p197!=1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t73, t74, t75, t76, t77, t96, t97, t119, t120, t121, t122, t123, t12...276
(forward)formula 0,1,1.04818,44812,1,0,228,202510,285,128,6034,137416,318
FORMULA BusinessProcesses-PT-19-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 548
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 594 transition count 515
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 594 transition count 515
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 77 place count 584 transition count 505
Iterating global reduction 1 with 10 rules applied. Total rules applied 87 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 583 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 582 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 581 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 581 transition count 502
Applied a total of 93 rules in 111 ms. Remains 581 /628 variables (removed 47) and now considering 502/548 (removed 46) transitions.
// Phase 1: matrix 502 rows 581 cols
[2024-05-22 00:23:49] [INFO ] Computed 117 invariants in 13 ms
[2024-05-22 00:23:50] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-22 00:23:50] [INFO ] Invariant cache hit.
[2024-05-22 00:23:50] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2024-05-22 00:23:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-22 00:24:01] [INFO ] Deduced a trap composed of 102 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:24:01] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:02] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 4 ms to minimize.
[2024-05-22 00:24:02] [INFO ] Deduced a trap composed of 110 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:24:02] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:24:02] [INFO ] Deduced a trap composed of 116 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:24:02] [INFO ] Deduced a trap composed of 127 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:24:02] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:24:02] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 3 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 107 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 107 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 114 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 101 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 115 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:24:03] [INFO ] Deduced a trap composed of 110 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 105 places in 97 ms of which 2 ms to minimize.
Problem TDEAD414 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 21 solved, 480 unsolved
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 105 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:24:04] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 111 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 113 places in 107 ms of which 4 ms to minimize.
[2024-05-22 00:24:05] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 132 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 129 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 101 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/157 constraints. Problems are: Problem set: 21 solved, 480 unsolved
[2024-05-22 00:24:06] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 111 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:24:07] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 104 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 108 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:08] [INFO ] Deduced a trap composed of 119 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:24:09] [INFO ] Deduced a trap composed of 108 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:24:09] [INFO ] Deduced a trap composed of 108 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:24:09] [INFO ] Deduced a trap composed of 111 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:09] [INFO ] Deduced a trap composed of 118 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/177 constraints. Problems are: Problem set: 21 solved, 480 unsolved
[2024-05-22 00:24:13] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 125 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:24:14] [INFO ] Deduced a trap composed of 113 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 83 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 126 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:24:15] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/197 constraints. Problems are: Problem set: 21 solved, 480 unsolved
[2024-05-22 00:24:16] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 97 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:24:17] [INFO ] Deduced a trap composed of 108 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 5 ms to minimize.
[2024-05-22 00:24:18] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 104 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 2 ms to minimize.
Problem TDEAD403 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 20/217 constraints. Problems are: Problem set: 27 solved, 474 unsolved
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 105 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 4 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:24:19] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 110 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 113 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:24:20] [INFO ] Deduced a trap composed of 110 places in 101 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1083 variables, and 227 constraints, problems are : Problem set: 27 solved, 474 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/581 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 110/110 constraints]
Escalating to Integer solving :Problem set: 27 solved, 474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 27 solved, 474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 27 solved, 474 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 27 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 27 solved, 474 unsolved
Problem TDEAD404 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 110/227 constraints. Problems are: Problem set: 33 solved, 468 unsolved
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:24:25] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 4 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:24:26] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:24:27] [INFO ] Deduced a trap composed of 100 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 115 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/247 constraints. Problems are: Problem set: 33 solved, 468 unsolved
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 4 ms to minimize.
[2024-05-22 00:24:28] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 109 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:24:29] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:24:30] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:31] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/267 constraints. Problems are: Problem set: 33 solved, 468 unsolved
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 105 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:24:32] [INFO ] Deduced a trap composed of 111 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 114 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:24:33] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 4 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:34] [INFO ] Deduced a trap composed of 132 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 22 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 14 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:24:35] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 4 ms to minimize.
[2024-05-22 00:24:36] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/287 constraints. Problems are: Problem set: 33 solved, 468 unsolved
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:24:37] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:24:38] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 115 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 113 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:24:39] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 20/307 constraints. Problems are: Problem set: 33 solved, 468 unsolved
[2024-05-22 00:24:40] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:24:41] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 4 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 89 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:24:42] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 57 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:24:43] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 3 ms to minimize.
Problem TDEAD405 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 20/327 constraints. Problems are: Problem set: 34 solved, 467 unsolved
[2024-05-22 00:24:44] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 2 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:24:45] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 99 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:24:46] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:24:47] [INFO ] Deduced a trap composed of 105 places in 92 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 20/347 constraints. Problems are: Problem set: 34 solved, 467 unsolved
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 101 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:24:48] [INFO ] Deduced a trap composed of 107 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 105 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 105 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 102 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 109 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:24:49] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/581 variables, 20/367 constraints. Problems are: Problem set: 34 solved, 467 unsolved
[2024-05-22 00:24:50] [INFO ] Deduced a trap composed of 107 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 109 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:24:51] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 3 ms to minimize.
SMT process timed out in 60240ms, After SMT, problems are : Problem set: 34 solved, 467 unsolved
Search for dead transitions found 34 dead transitions in 60258ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in LTL mode, iteration 1 : 581/628 places, 468/548 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 579 transition count 468
Applied a total of 2 rules in 15 ms. Remains 579 /581 variables (removed 2) and now considering 468/468 (removed 0) transitions.
// Phase 1: matrix 468 rows 579 cols
[2024-05-22 00:24:51] [INFO ] Computed 122 invariants in 5 ms
[2024-05-22 00:24:51] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-22 00:24:51] [INFO ] Invariant cache hit.
[2024-05-22 00:24:51] [INFO ] Implicit Places using invariants and state equation in 547 ms returned [158]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 785 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 578/628 places, 468/548 transitions.
Applied a total of 0 rules in 10 ms. Remains 578 /578 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62135 ms. Remains : 578/628 places, 468/548 transitions.
[2024-05-22 00:24:51] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:24:52] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:24:52] [INFO ] Input system was already deterministic with 468 transitions.
[2024-05-22 00:24:52] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:24:52] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:24:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality9394265409751654428.gal : 3 ms
[2024-05-22 00:24:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality7239256411353589785.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/CTLCardinality9394265409751654428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7239256411353589785.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:25:22] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:25:22] [INFO ] Applying decomposition
[2024-05-22 00:25:22] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17479372903918777818.txt' '-o' '/tmp/graph17479372903918777818.bin' '-w' '/tmp/graph17479372903918777818.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17479372903918777818.bin' '-l' '-1' '-v' '-w' '/tmp/graph17479372903918777818.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:25:22] [INFO ] Decomposing Gal with order
[2024-05-22 00:25:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:25:22] [INFO ] Removed a total of 134 redundant transitions.
[2024-05-22 00:25:22] [INFO ] Flatten gal took : 144 ms
[2024-05-22 00:25:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 29 ms.
[2024-05-22 00:25:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality11144128210747582859.gal : 21 ms
[2024-05-22 00:25:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality1716192769119742644.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11144128210747582859.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1716192769119742644.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.25289e+33,2.85718,109616,9131,49,208053,742,1157,369442,72,1732,0


Converting to forward existential form...Done !
original formula: E(AX(AX((i4.u143.p485==0))) U AG((EF((EX((i19.i2.u164.p590==1)) + AG(((i2.i2.u154.p541==0)||(i7.i1.u119.p363==1))))) * (i4.u51.p154!=1)))...156
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(EX(!((i4.u143.p485==0)))))))) * !(E(TRUE U !((E(TRUE U (EX((i19.i2.u164.p590==1)) + !(E(TRU...244
Reverse transition relation is NOT exact ! Due to transitions t8, t203, t287, t299, t307, t389, t392, t431, t432, t436, t438, t440, t441, t443, t445, t462,...1631
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 548
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 594 transition count 515
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 594 transition count 515
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 583 transition count 504
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 582 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 581 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 580 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 580 transition count 501
Applied a total of 95 rules in 121 ms. Remains 580 /628 variables (removed 48) and now considering 501/548 (removed 47) transitions.
// Phase 1: matrix 501 rows 580 cols
[2024-05-22 00:25:53] [INFO ] Computed 117 invariants in 6 ms
[2024-05-22 00:25:53] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-22 00:25:53] [INFO ] Invariant cache hit.
[2024-05-22 00:25:53] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-22 00:25:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 117 places in 166 ms of which 6 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 82 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 106 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:26:06] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:26:07] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 104 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 109 places in 90 ms of which 2 ms to minimize.
Problem TDEAD420 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 9 solved, 491 unsolved
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 117 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:26:08] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 101 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 108 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:26:09] [INFO ] Deduced a trap composed of 111 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 110 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 127 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 121 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 123 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:26:10] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 107 places in 98 ms of which 3 ms to minimize.
Problem TDEAD403 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 21 solved, 479 unsolved
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:26:11] [INFO ] Deduced a trap composed of 118 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 4 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 110 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:26:12] [INFO ] Deduced a trap composed of 106 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 95 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 100 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:26:13] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 21 solved, 479 unsolved
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 121 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 120 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:26:18] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 111 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 101 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 130 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 106 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 99 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:26:19] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 21 solved, 479 unsolved
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 103 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 121 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:26:20] [INFO ] Deduced a trap composed of 113 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 3 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 110 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 101 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 127 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 20/217 constraints. Problems are: Problem set: 21 solved, 479 unsolved
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 106 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
SMT process timed out in 30215ms, After SMT, problems are : Problem set: 21 solved, 479 unsolved
Search for dead transitions found 21 dead transitions in 30220ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 580/628 places, 480/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 580 /580 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31339 ms. Remains : 580/628 places, 480/548 transitions.
[2024-05-22 00:26:24] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:26:24] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:26:24] [INFO ] Input system was already deterministic with 480 transitions.
[2024-05-22 00:26:24] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:26:24] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:26:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality3495662620868926783.gal : 4 ms
[2024-05-22 00:26:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality15173218887476100052.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/CTLCardinality3495662620868926783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15173218887476100052.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:26:54] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:26:54] [INFO ] Applying decomposition
[2024-05-22 00:26:54] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3360014770276597210.txt' '-o' '/tmp/graph3360014770276597210.bin' '-w' '/tmp/graph3360014770276597210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3360014770276597210.bin' '-l' '-1' '-v' '-w' '/tmp/graph3360014770276597210.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:26:54] [INFO ] Decomposing Gal with order
[2024-05-22 00:26:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:26:54] [INFO ] Removed a total of 195 redundant transitions.
[2024-05-22 00:26:54] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:26:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 14 ms.
[2024-05-22 00:26:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality3767420371014984540.gal : 7 ms
[2024-05-22 00:26:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality15598913075781695931.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/CTLCardinality3767420371014984540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15598913075781695931.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24539e+33,1.65542,58792,5133,43,106532,537,1214,191530,55,1389,0


Converting to forward existential form...Done !
original formula: EX(E(AX((i3.i2.u139.p464==0)) U AF((i20.u160.p686==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),!(EX(!((i3.i2.u139.p464==0))))) * !(EG(!((i20.u160.p686==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t10, t202, t286, t302, t310, t343, t388, t391, t444, t448, t450, t452, t455, t457, t4...1602
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Graph (trivial) has 305 edges and 628 vertex of which 7 / 628 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1359 edges and 622 vertex of which 620 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 619 transition count 458
Reduce places removed 81 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 538 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 166 place count 537 transition count 457
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 120 Pre rules applied. Total rules applied 166 place count 537 transition count 337
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 430 place count 393 transition count 337
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 456 place count 367 transition count 311
Iterating global reduction 3 with 26 rules applied. Total rules applied 482 place count 367 transition count 311
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 482 place count 367 transition count 307
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 492 place count 361 transition count 307
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 493 place count 360 transition count 306
Iterating global reduction 3 with 1 rules applied. Total rules applied 494 place count 360 transition count 306
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 293 rules applied. Total rules applied 787 place count 212 transition count 161
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 789 place count 211 transition count 160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 790 place count 210 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 791 place count 209 transition count 159
Applied a total of 791 rules in 75 ms. Remains 209 /628 variables (removed 419) and now considering 159/548 (removed 389) transitions.
// Phase 1: matrix 159 rows 209 cols
[2024-05-22 00:27:24] [INFO ] Computed 87 invariants in 2 ms
[2024-05-22 00:27:24] [INFO ] Implicit Places using invariants in 206 ms returned [56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 154]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 209 ms to find 12 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 197/628 places, 159/548 transitions.
Applied a total of 0 rules in 4 ms. Remains 197 /197 variables (removed 0) and now considering 159/159 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 288 ms. Remains : 197/628 places, 159/548 transitions.
[2024-05-22 00:27:24] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:27:25] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:27:25] [INFO ] Input system was already deterministic with 159 transitions.
[2024-05-22 00:27:25] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:27:25] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:27:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality12146756963617885642.gal : 2 ms
[2024-05-22 00:27:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality11712504235656924406.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/CTLCardinality12146756963617885642.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11712504235656924406.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,1.09706e+07,0.489244,20988,2,7682,5,70248,6,0,946,50255,0


Converting to forward existential form...Done !
original formula: (AG(((E(!(((p658==0)||(p39==1))) U AG((p672==1))) + A(!(((p673==0)||(p67==1))) U EG(((p19==0)||(p60==1))))) + (((((p69==0)||(p715==1))&&(...206
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !((((((p69==0)||(p715==1))&&(p67==0))&&(p207==1))||(p571==0)))) * !(!((E(!(EG(((p19==0)||...377
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t8, t19, t38, t43, t44, t45, t81, t83, t84, t85, t88, t89, t90, t91, t92, t93, t1...331
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,10.0804,340604,1,0,496,1.92203e+06,329,258,7217,1.62545e+06,603
FORMULA BusinessProcesses-PT-19-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 548
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 595 transition count 516
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 595 transition count 516
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 75 place count 585 transition count 506
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 585 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 584 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 583 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 582 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 582 transition count 503
Applied a total of 91 rules in 131 ms. Remains 582 /628 variables (removed 46) and now considering 503/548 (removed 45) transitions.
// Phase 1: matrix 503 rows 582 cols
[2024-05-22 00:27:35] [INFO ] Computed 117 invariants in 7 ms
[2024-05-22 00:27:35] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-22 00:27:35] [INFO ] Invariant cache hit.
[2024-05-22 00:27:36] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2024-05-22 00:27:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (OVERLAPS) 1/582 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-22 00:27:47] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 124 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 109 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 110 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:27:48] [INFO ] Deduced a trap composed of 119 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 103 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 103 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 5 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 108 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:27:49] [INFO ] Deduced a trap composed of 107 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 104 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:50] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 115 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 104 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:27:51] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 97 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 104 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:27:52] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 125 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:53] [INFO ] Deduced a trap composed of 112 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 109 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 115 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 109 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:27:54] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 116 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 101 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:27:55] [INFO ] Deduced a trap composed of 120 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:27:56] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 119 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 111 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 108 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:28:00] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 121 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 107 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 127 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:28:01] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 102 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 113 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 111 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 109 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:28:02] [INFO ] Deduced a trap composed of 109 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 106 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 108 places in 89 ms of which 2 ms to minimize.
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 20/197 constraints. Problems are: Problem set: 8 solved, 494 unsolved
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:28:03] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:28:04] [INFO ] Deduced a trap composed of 106 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 102 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:28:05] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:28:06] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:28:06] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:28:06] [INFO ] Deduced a trap composed of 111 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:28:06] [INFO ] Deduced a trap composed of 104 places in 130 ms of which 3 ms to minimize.
SMT process timed out in 30169ms, After SMT, problems are : Problem set: 8 solved, 494 unsolved
Search for dead transitions found 8 dead transitions in 30173ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 582/628 places, 495/548 transitions.
Applied a total of 0 rules in 12 ms. Remains 582 /582 variables (removed 0) and now considering 495/495 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31221 ms. Remains : 582/628 places, 495/548 transitions.
[2024-05-22 00:28:06] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:28:06] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:28:06] [INFO ] Input system was already deterministic with 495 transitions.
[2024-05-22 00:28:06] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:28:06] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:28:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality8648046318736468846.gal : 4 ms
[2024-05-22 00:28:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality10226157880668826295.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/CTLCardinality8648046318736468846.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10226157880668826295.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:28:36] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:28:36] [INFO ] Applying decomposition
[2024-05-22 00:28:36] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5419251824618695620.txt' '-o' '/tmp/graph5419251824618695620.bin' '-w' '/tmp/graph5419251824618695620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5419251824618695620.bin' '-l' '-1' '-v' '-w' '/tmp/graph5419251824618695620.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:28:36] [INFO ] Decomposing Gal with order
[2024-05-22 00:28:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:28:36] [INFO ] Removed a total of 249 redundant transitions.
[2024-05-22 00:28:36] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:28:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 11 ms.
[2024-05-22 00:28:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality6234234010832168335.gal : 7 ms
[2024-05-22 00:28:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality14764511152215132617.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/CTLCardinality6234234010832168335.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14764511152215132617.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.25056e+33,0.967623,44720,4937,58,83471,777,1233,160862,69,1726,0


Converting to forward existential form...Done !
original formula: AF(E(((i17.i1.u127.p404==1) + EF(((i11.i1.u83.p252==0)||(i3.u42.p123==1)))) U AX((i8.u178.p666==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(((i17.i1.u127.p404==1) + E(TRUE U ((i11.i1.u83.p252==0)||(i3.u42.p123==1)))) U !(EX(!((i8.u178.p6...176
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t29, t203, t288, t304, t390, t393, t458, t463, t465, t467, t468, t470, t472, t481...1612
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 548
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 594 transition count 515
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 594 transition count 515
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 77 place count 584 transition count 505
Iterating global reduction 1 with 10 rules applied. Total rules applied 87 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 583 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 582 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 581 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 581 transition count 502
Applied a total of 93 rules in 121 ms. Remains 581 /628 variables (removed 47) and now considering 502/548 (removed 46) transitions.
// Phase 1: matrix 502 rows 581 cols
[2024-05-22 00:29:06] [INFO ] Computed 117 invariants in 4 ms
[2024-05-22 00:29:07] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-22 00:29:07] [INFO ] Invariant cache hit.
[2024-05-22 00:29:07] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2024-05-22 00:29:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-22 00:29:20] [INFO ] Deduced a trap composed of 127 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 83 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 123 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 110 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 128 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 128 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 106 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 127 places in 88 ms of which 3 ms to minimize.
[2024-05-22 00:29:21] [INFO ] Deduced a trap composed of 102 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 104 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 105 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 99 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 106 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 104 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 106 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 111 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:29:22] [INFO ] Deduced a trap composed of 108 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 107 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 106 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 103 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 124 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 115 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 111 places in 85 ms of which 3 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 105 places in 86 ms of which 3 ms to minimize.
[2024-05-22 00:29:23] [INFO ] Deduced a trap composed of 121 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 126 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 105 places in 85 ms of which 3 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 103 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 108 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 110 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 127 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 122 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 105 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 124 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:29:24] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 103 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 113 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 128 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 105 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 110 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 128 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 106 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:29:25] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 102 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 106 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 109 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 110 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 118 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 99 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:29:26] [INFO ] Deduced a trap composed of 94 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 111 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:29:27] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 2 ms to minimize.
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/177 constraints. Problems are: Problem set: 9 solved, 492 unsolved
[2024-05-22 00:29:31] [INFO ] Deduced a trap composed of 109 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:29:31] [INFO ] Deduced a trap composed of 133 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:29:31] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:29:31] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:29:31] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:29:31] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:29:31] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:29:31] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:29:32] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:29:32] [INFO ] Deduced a trap composed of 107 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:29:32] [INFO ] Deduced a trap composed of 105 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:29:32] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:29:32] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:29:32] [INFO ] Deduced a trap composed of 105 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:29:32] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:29:32] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:29:33] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:29:33] [INFO ] Deduced a trap composed of 123 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:29:33] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:29:33] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/197 constraints. Problems are: Problem set: 9 solved, 492 unsolved
[2024-05-22 00:29:33] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 107 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:29:34] [INFO ] Deduced a trap composed of 108 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 112 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 109 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 108 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 108 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:29:35] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 105 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 109 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 136 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 20/217 constraints. Problems are: Problem set: 9 solved, 492 unsolved
[2024-05-22 00:29:36] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 106 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 99 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 101 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:29:37] [INFO ] Deduced a trap composed of 91 places in 85 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1083 variables, and 228 constraints, problems are : Problem set: 9 solved, 492 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/581 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 111/111 constraints]
Escalating to Integer solving :Problem set: 9 solved, 492 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 9 solved, 492 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 9 solved, 492 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 9 solved, 492 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 9 solved, 492 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 111/228 constraints. Problems are: Problem set: 9 solved, 492 unsolved
[2024-05-22 00:29:42] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:29:42] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:29:43] [INFO ] Deduced a trap composed of 114 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:29:44] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:29:44] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:29:44] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:29:44] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:29:44] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:29:44] [INFO ] Deduced a trap composed of 109 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:29:45] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:29:45] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:29:45] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:29:45] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/248 constraints. Problems are: Problem set: 20 solved, 481 unsolved
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 145 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:29:46] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 108 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:29:47] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 107 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:29:48] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/268 constraints. Problems are: Problem set: 20 solved, 481 unsolved
[2024-05-22 00:29:49] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 39 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 119 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:29:50] [INFO ] Deduced a trap composed of 113 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:29:51] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 24 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 127 places in 203 ms of which 4 ms to minimize.
[2024-05-22 00:29:52] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/288 constraints. Problems are: Problem set: 20 solved, 481 unsolved
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 100 places in 169 ms of which 4 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:29:53] [INFO ] Deduced a trap composed of 102 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 121 places in 151 ms of which 4 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:29:54] [INFO ] Deduced a trap composed of 105 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 113 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:29:55] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 20/308 constraints. Problems are: Problem set: 20 solved, 481 unsolved
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:29:56] [INFO ] Deduced a trap composed of 98 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:29:57] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:29:57] [INFO ] Deduced a trap composed of 126 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:29:57] [INFO ] Deduced a trap composed of 95 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 120 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 4 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 4 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 109 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 4 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 3 ms to minimize.
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/581 variables, 20/328 constraints. Problems are: Problem set: 22 solved, 479 unsolved
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 105 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 112 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:30:04] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:30:04] [INFO ] Deduced a trap composed of 101 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:30:04] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:30:04] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 4 ms to minimize.
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 4 ms to minimize.
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/581 variables, 20/348 constraints. Problems are: Problem set: 22 solved, 479 unsolved
[2024-05-22 00:30:07] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:30:07] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:30:07] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 101 places in 162 ms of which 3 ms to minimize.
SMT process timed out in 60155ms, After SMT, problems are : Problem set: 22 solved, 479 unsolved
Search for dead transitions found 22 dead transitions in 60159ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 581/628 places, 480/548 transitions.
Applied a total of 0 rules in 13 ms. Remains 581 /581 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61155 ms. Remains : 581/628 places, 480/548 transitions.
[2024-05-22 00:30:08] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:30:08] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:30:08] [INFO ] Input system was already deterministic with 480 transitions.
[2024-05-22 00:30:08] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:30:08] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:30:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality3290853437273309524.gal : 3 ms
[2024-05-22 00:30:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality6419081762349295964.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/CTLCardinality3290853437273309524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6419081762349295964.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:30:38] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:30:38] [INFO ] Applying decomposition
[2024-05-22 00:30:38] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12293567070788021774.txt' '-o' '/tmp/graph12293567070788021774.bin' '-w' '/tmp/graph12293567070788021774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12293567070788021774.bin' '-l' '-1' '-v' '-w' '/tmp/graph12293567070788021774.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:30:38] [INFO ] Decomposing Gal with order
[2024-05-22 00:30:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:30:38] [INFO ] Removed a total of 186 redundant transitions.
[2024-05-22 00:30:38] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:30:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 10 ms.
[2024-05-22 00:30:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality7602802892698735324.gal : 6 ms
[2024-05-22 00:30:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality9134359298150320514.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/CTLCardinality7602802892698735324.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9134359298150320514.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24521e+33,1.62875,57160,5724,66,101651,1437,1216,218426,73,3238,0


Converting to forward existential form...Done !
original formula: E(((EF((i9.u193.p740!=1)) + !(((i3.i2.u184.p694==0)||(i9.u159.p565==1)))) + !(AG(((i5.i0.u24.p62==0)||(i16.i0.u31.p80==1))))) U AX(AF((i1...176
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U (i9.u193.p740!=1)) + !(((i3.i2.u184.p694==0)||(i9.u159.p565==1)))) + !(!(E(TRUE U !(((i5....252
Reverse transition relation is NOT exact ! Due to transitions t10, t202, t302, t306, t314, t344, t389, t443, t444, t448, t450, t452, t455, t457, t475, i0.i...1616
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 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
(forward)formula 0,1,14.1774,468736,1,0,881919,2600,9602,1.72256e+06,421,5891,2472852
FORMULA BusinessProcesses-PT-19-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 548
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 594 transition count 515
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 594 transition count 515
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 583 transition count 504
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 582 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 581 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 580 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 580 transition count 501
Applied a total of 95 rules in 114 ms. Remains 580 /628 variables (removed 48) and now considering 501/548 (removed 47) transitions.
// Phase 1: matrix 501 rows 580 cols
[2024-05-22 00:30:52] [INFO ] Computed 117 invariants in 8 ms
[2024-05-22 00:30:52] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-22 00:30:52] [INFO ] Invariant cache hit.
[2024-05-22 00:30:53] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-22 00:30:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:31:07] [INFO ] Deduced a trap composed of 128 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:31:07] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:31:07] [INFO ] Deduced a trap composed of 119 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:07] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:31:07] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:31:07] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:31:07] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:31:08] [INFO ] Deduced a trap composed of 104 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:31:08] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:31:08] [INFO ] Deduced a trap composed of 112 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:31:08] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:31:08] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:31:08] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:31:09] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:09] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:31:09] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:31:09] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:31:09] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:31:09] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:31:10] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 11 solved, 489 unsolved
[2024-05-22 00:31:10] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:31:10] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:31:10] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:31:10] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:31:10] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:31:11] [INFO ] Deduced a trap composed of 127 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:31:11] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:31:11] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:31:11] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:11] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:31:11] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:31:11] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:31:12] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:31:12] [INFO ] Deduced a trap composed of 130 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:31:12] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:31:12] [INFO ] Deduced a trap composed of 132 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:31:12] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:31:12] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:31:12] [INFO ] Deduced a trap composed of 116 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:31:12] [INFO ] Deduced a trap composed of 134 places in 121 ms of which 2 ms to minimize.
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 17 solved, 483 unsolved
[2024-05-22 00:31:13] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:31:13] [INFO ] Deduced a trap composed of 122 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:31:13] [INFO ] Deduced a trap composed of 103 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:31:13] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:31:13] [INFO ] Deduced a trap composed of 106 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:31:13] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:31:13] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:31:14] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:31:14] [INFO ] Deduced a trap composed of 105 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:31:14] [INFO ] Deduced a trap composed of 107 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:31:14] [INFO ] Deduced a trap composed of 104 places in 86 ms of which 3 ms to minimize.
[2024-05-22 00:31:14] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:31:14] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:31:14] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:31:14] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:31:14] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:31:15] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 5 ms to minimize.
[2024-05-22 00:31:15] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:31:15] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:31:15] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 17 solved, 483 unsolved
[2024-05-22 00:31:20] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:31:20] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:31:20] [INFO ] Deduced a trap composed of 122 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:31:20] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:31:20] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:31:20] [INFO ] Deduced a trap composed of 113 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:31:21] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:31:21] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:31:21] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:31:21] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:31:21] [INFO ] Deduced a trap composed of 111 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:31:21] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:31:21] [INFO ] Deduced a trap composed of 104 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:31:21] [INFO ] Deduced a trap composed of 103 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 108 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:31:22] [INFO ] Deduced a trap composed of 109 places in 89 ms of which 2 ms to minimize.
Problem TDEAD449 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 19 solved, 481 unsolved
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:31:23] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 2 ms to minimize.
SMT process timed out in 30199ms, After SMT, problems are : Problem set: 19 solved, 481 unsolved
Search for dead transitions found 19 dead transitions in 30205ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 580/628 places, 482/548 transitions.
Applied a total of 0 rules in 12 ms. Remains 580 /580 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31295 ms. Remains : 580/628 places, 482/548 transitions.
[2024-05-22 00:31:23] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:31:23] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:31:23] [INFO ] Input system was already deterministic with 482 transitions.
[2024-05-22 00:31:23] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:31:24] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:31:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality16122085554066725418.gal : 2 ms
[2024-05-22 00:31:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality15961308732923272222.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/CTLCardinality16122085554066725418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15961308732923272222.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:31:54] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:31:54] [INFO ] Applying decomposition
[2024-05-22 00:31:54] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13873693807946412555.txt' '-o' '/tmp/graph13873693807946412555.bin' '-w' '/tmp/graph13873693807946412555.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13873693807946412555.bin' '-l' '-1' '-v' '-w' '/tmp/graph13873693807946412555.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:31:54] [INFO ] Decomposing Gal with order
[2024-05-22 00:31:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:31:54] [INFO ] Removed a total of 201 redundant transitions.
[2024-05-22 00:31:54] [INFO ] Flatten gal took : 39 ms
[2024-05-22 00:31:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2024-05-22 00:31:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality16658912091754499412.gal : 5 ms
[2024-05-22 00:31:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality13125073252872653857.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/CTLCardinality16658912091754499412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13125073252872653857.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,1.31215e+33,3.20503,109812,8503,52,217289,543,1008,426721,53,1295,0


Converting to forward existential form...Done !
original formula: A(((i13.u55.p161==0)||(i14.u48.p140==1)) U EG((EX(TRUE) * ((EX(EX((i18.u159.p577==1))) + AG((i10.u83.p243==0))) + ((i9.u63.p191!=0)||((i1...194
=> equivalent forward existential formula: [((Init * !(EG(!(EG((EX(TRUE) * ((EX(EX((i18.u159.p577==1))) + !(E(TRUE U !((i10.u83.p243==0))))) + ((i9.u63.p19...571
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t10, t201, t285, t306, t343, t388, t391, t446, t450, t452, t454, t455, t457, t459, t4...1441
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 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
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 548
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 594 transition count 515
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 594 transition count 515
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 583 transition count 504
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 583 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 582 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 581 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 580 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 580 transition count 501
Applied a total of 95 rules in 66 ms. Remains 580 /628 variables (removed 48) and now considering 501/548 (removed 47) transitions.
// Phase 1: matrix 501 rows 580 cols
[2024-05-22 00:32:24] [INFO ] Computed 117 invariants in 6 ms
[2024-05-22 00:32:24] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-22 00:32:24] [INFO ] Invariant cache hit.
[2024-05-22 00:32:25] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-22 00:32:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:32:36] [INFO ] Deduced a trap composed of 120 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:32:36] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:32:36] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:32:36] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:32:36] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:32:36] [INFO ] Deduced a trap composed of 99 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 104 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:32:37] [INFO ] Deduced a trap composed of 122 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 130 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:32:38] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:32:39] [INFO ] Deduced a trap composed of 104 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:32:39] [INFO ] Deduced a trap composed of 120 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:32:39] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:32:39] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:32:39] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:32:39] [INFO ] Deduced a trap composed of 127 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:32:39] [INFO ] Deduced a trap composed of 119 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:32:39] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:32:39] [INFO ] Deduced a trap composed of 123 places in 88 ms of which 3 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 106 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 109 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 107 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 105 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:32:40] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 6 solved, 494 unsolved
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 99 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 109 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 120 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:32:41] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 100 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 108 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 107 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 104 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 107 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 110 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:32:42] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:32:43] [INFO ] Deduced a trap composed of 107 places in 97 ms of which 3 ms to minimize.
Problem TDEAD408 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 8 solved, 492 unsolved
[2024-05-22 00:32:47] [INFO ] Deduced a trap composed of 105 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:32:47] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:32:47] [INFO ] Deduced a trap composed of 124 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:32:47] [INFO ] Deduced a trap composed of 106 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:32:47] [INFO ] Deduced a trap composed of 109 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:32:47] [INFO ] Deduced a trap composed of 105 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:32:47] [INFO ] Deduced a trap composed of 106 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:32:48] [INFO ] Deduced a trap composed of 110 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:32:48] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 4 ms to minimize.
[2024-05-22 00:32:48] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:32:48] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:32:48] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:32:48] [INFO ] Deduced a trap composed of 101 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 108 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:32:49] [INFO ] Deduced a trap composed of 107 places in 88 ms of which 2 ms to minimize.
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 17 solved, 483 unsolved
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 132 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:32:50] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 129 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 4 ms to minimize.
[2024-05-22 00:32:51] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 126 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:32:52] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 20/217 constraints. Problems are: Problem set: 17 solved, 483 unsolved
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:32:53] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 107 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:32:54] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:32:55] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:32:55] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:32:55] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
SMT process timed out in 30103ms, After SMT, problems are : Problem set: 17 solved, 483 unsolved
Search for dead transitions found 17 dead transitions in 30109ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 580/628 places, 484/548 transitions.
Applied a total of 0 rules in 12 ms. Remains 580 /580 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31064 ms. Remains : 580/628 places, 484/548 transitions.
[2024-05-22 00:32:55] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:32:55] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:32:55] [INFO ] Input system was already deterministic with 484 transitions.
[2024-05-22 00:32:55] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:32:55] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:32:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality8158639392458240853.gal : 3 ms
[2024-05-22 00:32:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality7262513400119963333.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/CTLCardinality8158639392458240853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7262513400119963333.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:33:25] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:33:25] [INFO ] Applying decomposition
[2024-05-22 00:33:25] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5424599152927798853.txt' '-o' '/tmp/graph5424599152927798853.bin' '-w' '/tmp/graph5424599152927798853.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5424599152927798853.bin' '-l' '-1' '-v' '-w' '/tmp/graph5424599152927798853.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:33:25] [INFO ] Decomposing Gal with order
[2024-05-22 00:33:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:33:25] [INFO ] Removed a total of 210 redundant transitions.
[2024-05-22 00:33:25] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:33:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2024-05-22 00:33:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality2792899243040233509.gal : 23 ms
[2024-05-22 00:33:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality13975380246161729189.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/CTLCardinality2792899243040233509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13975380246161729189.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24522e+33,1.59083,52472,6206,55,87796,751,1139,185960,61,1823,0


Converting to forward existential form...Done !
original formula: AG(AX(EG(((EG((i10.i0.u48.p133==0)) + (i21.u159.p699==0)) + (i20.i1.u132.p426==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(((EG((i10.i0.u48.p133==0)) + (i21.u159.p699==0)) + (i20.i1.u132.p426==1)))))] = FAL...157
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t286, t302, t310, t343, t388, t391, t448, t452, t454, t456, t457, t459, t461, t47...1540
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 548
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 594 transition count 515
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 594 transition count 515
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 585 transition count 506
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 585 transition count 506
Applied a total of 85 rules in 65 ms. Remains 585 /628 variables (removed 43) and now considering 506/548 (removed 42) transitions.
// Phase 1: matrix 506 rows 585 cols
[2024-05-22 00:33:55] [INFO ] Computed 117 invariants in 6 ms
[2024-05-22 00:33:56] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-22 00:33:56] [INFO ] Invariant cache hit.
[2024-05-22 00:33:56] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
Running 505 sub problems to find dead transitions.
[2024-05-22 00:33:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 121 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 123 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:34:08] [INFO ] Deduced a trap composed of 103 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 113 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 108 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 109 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 105 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 124 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 104 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:34:09] [INFO ] Deduced a trap composed of 106 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 107 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 100 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 3 ms to minimize.
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 20/137 constraints. Problems are: Problem set: 9 solved, 496 unsolved
[2024-05-22 00:34:10] [INFO ] Deduced a trap composed of 39 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 107 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 105 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:34:11] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 115 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 106 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 107 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 120 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 100 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:34:12] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 109 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 101 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 20/157 constraints. Problems are: Problem set: 26 solved, 479 unsolved
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 111 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:34:13] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:34:14] [INFO ] Deduced a trap composed of 106 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:34:14] [INFO ] Deduced a trap composed of 106 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:34:14] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:34:14] [INFO ] Deduced a trap composed of 110 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:34:14] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:34:14] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:34:14] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:34:14] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 110 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 113 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 4 ms to minimize.
[2024-05-22 00:34:15] [INFO ] Deduced a trap composed of 112 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:34:16] [INFO ] Deduced a trap composed of 46 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:34:16] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 3 ms to minimize.
Problem TDEAD412 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD426 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 20/177 constraints. Problems are: Problem set: 29 solved, 476 unsolved
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 109 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 113 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 109 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:34:20] [INFO ] Deduced a trap composed of 107 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 116 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 111 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:34:21] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 110 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 101 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:34:22] [INFO ] Deduced a trap composed of 94 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 20/197 constraints. Problems are: Problem set: 29 solved, 476 unsolved
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:34:23] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 121 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 97 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:34:24] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:34:25] [INFO ] Deduced a trap composed of 126 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:34:25] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:34:25] [INFO ] Deduced a trap composed of 102 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:34:25] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:34:25] [INFO ] Deduced a trap composed of 101 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:34:26] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:34:26] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 4 ms to minimize.
[2024-05-22 00:34:26] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/1091 variables, and 216 constraints, problems are : Problem set: 29 solved, 476 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/585 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 29 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 44/44 constraints. Problems are: Problem set: 29 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/44 constraints. Problems are: Problem set: 29 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 71/115 constraints. Problems are: Problem set: 29 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 2/117 constraints. Problems are: Problem set: 29 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 99/216 constraints. Problems are: Problem set: 29 solved, 476 unsolved
[2024-05-22 00:34:31] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:34:31] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:34:31] [INFO ] Deduced a trap composed of 119 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:34:31] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:34:31] [INFO ] Deduced a trap composed of 117 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:34:31] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:34:32] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:34:32] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:34:32] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:34:32] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:34:33] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:34:33] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:34:33] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:34:33] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:34:33] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:34:33] [INFO ] Deduced a trap composed of 115 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:34:34] [INFO ] Deduced a trap composed of 105 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:34:34] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:34:34] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:34:34] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
Problem TDEAD435 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 20/236 constraints. Problems are: Problem set: 30 solved, 475 unsolved
[2024-05-22 00:34:35] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:34:35] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:34:35] [INFO ] Deduced a trap composed of 103 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:34:36] [INFO ] Deduced a trap composed of 105 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:34:36] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:34:36] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:34:36] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:34:36] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:34:36] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:34:36] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:34:37] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:34:38] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:34:38] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:34:38] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 3 ms to minimize.
Problem TDEAD413 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 20/256 constraints. Problems are: Problem set: 31 solved, 474 unsolved
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 46 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 102 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:34:39] [INFO ] Deduced a trap composed of 108 places in 174 ms of which 4 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 102 places in 167 ms of which 4 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:34:40] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:34:41] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:34:42] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:34:42] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:34:42] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:34:42] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
Problem TDEAD434 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 20/276 constraints. Problems are: Problem set: 32 solved, 473 unsolved
[2024-05-22 00:34:43] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:34:43] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:34:43] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:34:43] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:34:44] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:34:44] [INFO ] Deduced a trap composed of 100 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:34:44] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:34:44] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:34:44] [INFO ] Deduced a trap composed of 87 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:34:44] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:34:45] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 4 ms to minimize.
[2024-05-22 00:34:45] [INFO ] Deduced a trap composed of 110 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:34:45] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:34:45] [INFO ] Deduced a trap composed of 103 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:34:45] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:34:46] [INFO ] Deduced a trap composed of 110 places in 132 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 20/296 constraints. Problems are: Problem set: 32 solved, 473 unsolved
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 109 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 5 ms to minimize.
[2024-05-22 00:34:47] [INFO ] Deduced a trap composed of 102 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:34:48] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:34:48] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:34:48] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:34:48] [INFO ] Deduced a trap composed of 116 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 122 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:34:49] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 4 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 124 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:34:50] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 20/316 constraints. Problems are: Problem set: 32 solved, 473 unsolved
[2024-05-22 00:34:51] [INFO ] Deduced a trap composed of 107 places in 158 ms of which 2 ms to minimize.
[2024-05-22 00:34:51] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:34:51] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 124 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:34:52] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 113 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 122 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:34:53] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:34:54] [INFO ] Deduced a trap composed of 93 places in 164 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 20/336 constraints. Problems are: Problem set: 32 solved, 473 unsolved
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:34:55] [INFO ] Deduced a trap composed of 108 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:34:56] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 3 ms to minimize.
SMT process timed out in 60273ms, After SMT, problems are : Problem set: 32 solved, 473 unsolved
Search for dead transitions found 32 dead transitions in 60280ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 585/628 places, 474/548 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 584 transition count 474
Applied a total of 1 rules in 12 ms. Remains 584 /585 variables (removed 1) and now considering 474/474 (removed 0) transitions.
// Phase 1: matrix 474 rows 584 cols
[2024-05-22 00:34:56] [INFO ] Computed 121 invariants in 8 ms
[2024-05-22 00:34:57] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-22 00:34:57] [INFO ] Invariant cache hit.
[2024-05-22 00:34:57] [INFO ] Implicit Places using invariants and state equation in 596 ms returned [160, 161]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 821 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 582/628 places, 474/548 transitions.
Applied a total of 0 rules in 12 ms. Remains 582 /582 variables (removed 0) and now considering 474/474 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61966 ms. Remains : 582/628 places, 474/548 transitions.
[2024-05-22 00:34:57] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:34:57] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:34:57] [INFO ] Input system was already deterministic with 474 transitions.
[2024-05-22 00:34:57] [INFO ] Flatten gal took : 18 ms
[2024-05-22 00:34:57] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:34:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality14923104217635575685.gal : 6 ms
[2024-05-22 00:34:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality3046871869912525973.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/CTLCardinality14923104217635575685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3046871869912525973.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:35:27] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:35:27] [INFO ] Applying decomposition
[2024-05-22 00:35:27] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18232817346780257007.txt' '-o' '/tmp/graph18232817346780257007.bin' '-w' '/tmp/graph18232817346780257007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18232817346780257007.bin' '-l' '-1' '-v' '-w' '/tmp/graph18232817346780257007.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:35:27] [INFO ] Decomposing Gal with order
[2024-05-22 00:35:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:35:27] [INFO ] Removed a total of 151 redundant transitions.
[2024-05-22 00:35:28] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:35:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2024-05-22 00:35:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality15615600004826324169.gal : 5 ms
[2024-05-22 00:35:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality977253404982784226.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/CTLCardinality15615600004826324169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality977253404982784226.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,2.22328e+33,2.42435,79968,5921,43,94402,664,1007,568541,62,1436,0


Converting to forward existential form...Done !
original formula: !(E(AX(((i21.u184.p669==0)||(i1.u93.p275==1))) U !((!(E(((i11.u52.p146==0)||(i5.u35.p91==1)) U (i10.u45.p121==1))) + (EX(AF((i19.u14.p30=...185
=> equivalent forward existential formula: [(FwdU((FwdU(Init,!(EX(!(((i21.u184.p669==0)||(i1.u93.p275==1)))))) * !((EX(!(EG(!((i19.u14.p30==1))))) * (i4.u1...237
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t288, t304, t316, t347, t392, t395, t436, t437, t441, t443, t446, t448, t450, t451, t...1468
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Graph (trivial) has 315 edges and 628 vertex of which 7 / 628 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1359 edges and 622 vertex of which 621 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 620 transition count 457
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 166 place count 538 transition count 457
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 125 Pre rules applied. Total rules applied 166 place count 538 transition count 332
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 274 rules applied. Total rules applied 440 place count 389 transition count 332
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 470 place count 359 transition count 302
Iterating global reduction 2 with 30 rules applied. Total rules applied 500 place count 359 transition count 302
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 500 place count 359 transition count 298
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 510 place count 353 transition count 298
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 511 place count 352 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 512 place count 352 transition count 297
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 297 rules applied. Total rules applied 809 place count 202 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 811 place count 201 transition count 149
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 812 place count 200 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 813 place count 199 transition count 148
Applied a total of 813 rules in 85 ms. Remains 199 /628 variables (removed 429) and now considering 148/548 (removed 400) transitions.
// Phase 1: matrix 148 rows 199 cols
[2024-05-22 00:35:58] [INFO ] Computed 88 invariants in 8 ms
[2024-05-22 00:35:58] [INFO ] Implicit Places using invariants in 157 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 198/628 places, 148/548 transitions.
Applied a total of 0 rules in 6 ms. Remains 198 /198 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 249 ms. Remains : 198/628 places, 148/548 transitions.
[2024-05-22 00:35:58] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:35:58] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:35:58] [INFO ] Input system was already deterministic with 148 transitions.
[2024-05-22 00:35:58] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:35:58] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:35:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality13196556673504568076.gal : 1 ms
[2024-05-22 00:35:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality10708142750293338819.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/CTLCardinality13196556673504568076.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10708142750293338819.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,1.39997e+06,0.821021,28616,2,4522,5,129232,6,0,934,65597,0


Converting to forward existential form...Done !
original formula: AG(!(A((p295==0) U (p48==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!((p48==1))))) * !(E(!((p48==1)) U (!((p295==0)) * !((p48==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t36, t37, t38, t39, t40, t73, t74, t75, t76, t77, t80, t96, t97, t119, t120, t121, t122, t123...287
(forward)formula 0,0,3.78637,126120,1,0,271,636777,286,148,6801,463176,367
FORMULA BusinessProcesses-PT-19-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 548
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 597 transition count 518
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 597 transition count 518
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 72 place count 586 transition count 507
Iterating global reduction 1 with 11 rules applied. Total rules applied 83 place count 586 transition count 507
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 585 transition count 506
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 585 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 584 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 584 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 583 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 583 transition count 504
Applied a total of 89 rules in 57 ms. Remains 583 /628 variables (removed 45) and now considering 504/548 (removed 44) transitions.
// Phase 1: matrix 504 rows 583 cols
[2024-05-22 00:36:02] [INFO ] Computed 117 invariants in 8 ms
[2024-05-22 00:36:02] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-22 00:36:02] [INFO ] Invariant cache hit.
[2024-05-22 00:36:03] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-05-22 00:36:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/582 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/583 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/583 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 127 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:36:13] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 85 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:36:14] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 127 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 101 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:36:15] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 3 ms to minimize.
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 20/137 constraints. Problems are: Problem set: 21 solved, 482 unsolved
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 2 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:36:16] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 85 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 4 ms to minimize.
[2024-05-22 00:36:17] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 108 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:36:18] [INFO ] Deduced a trap composed of 107 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 20/157 constraints. Problems are: Problem set: 21 solved, 482 unsolved
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:36:19] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 100 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 90 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:36:20] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 134 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:36:21] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 79 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 105 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 105 places in 160 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/177 constraints. Problems are: Problem set: 21 solved, 482 unsolved
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 126 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 122 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:36:27] [INFO ] Deduced a trap composed of 88 places in 169 ms of which 4 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 110 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 109 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 124 places in 140 ms of which 4 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 124 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:36:29] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 20/197 constraints. Problems are: Problem set: 21 solved, 482 unsolved
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:36:30] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 86 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 126 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:36:31] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 105 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 112 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 106 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:36:32] [INFO ] Deduced a trap composed of 84 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:36:33] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:36:33] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:36:33] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
SMT process timed out in 30117ms, After SMT, problems are : Problem set: 21 solved, 482 unsolved
Search for dead transitions found 21 dead transitions in 30123ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 583/628 places, 483/548 transitions.
Applied a total of 0 rules in 15 ms. Remains 583 /583 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31245 ms. Remains : 583/628 places, 483/548 transitions.
[2024-05-22 00:36:33] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:36:33] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:36:33] [INFO ] Input system was already deterministic with 483 transitions.
[2024-05-22 00:36:33] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:36:33] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:36:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality10266958931507612102.gal : 2 ms
[2024-05-22 00:36:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality11153717389704796446.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/CTLCardinality10266958931507612102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11153717389704796446.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:37:03] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:37:03] [INFO ] Applying decomposition
[2024-05-22 00:37:03] [INFO ] Flatten gal took : 10 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/graph8346269227166928662.txt' '-o' '/tmp/graph8346269227166928662.bin' '-w' '/tmp/graph8346269227166928662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8346269227166928662.bin' '-l' '-1' '-v' '-w' '/tmp/graph8346269227166928662.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:37:03] [INFO ] Decomposing Gal with order
[2024-05-22 00:37:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:37:03] [INFO ] Removed a total of 201 redundant transitions.
[2024-05-22 00:37:03] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:37:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 8 ms.
[2024-05-22 00:37:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality854163360575073370.gal : 6 ms
[2024-05-22 00:37:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality9372541087722133760.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/CTLCardinality854163360575073370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9372541087722133760.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,1.4246e+33,7.51739,198232,7912,49,337942,567,1212,753256,64,1307,0


Converting to forward existential form...Done !
original formula: (E(E((!(E((i21.i1.u161.p561==1) U (i21.i0.u198.p750==1))) * EF(((i19.i2.u130.p414==0)||(i17.i0.u50.p150==1)))) U EF(EX((i20.i1.u103.p321=...398
=> equivalent forward existential formula: ([(FwdU(Init,E((!(E((i21.i1.u161.p561==1) U (i21.i0.u198.p750==1))) * E(TRUE U ((i19.i2.u130.p414==0)||(i17.i0.u...573
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t10, t203, t288, t301, t305, t309, t346, t391, t394, t446, t447, t451, t453, t456, t4...1630
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 a local SCC at level 1
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Graph (trivial) has 315 edges and 628 vertex of which 7 / 628 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1359 edges and 622 vertex of which 620 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 86 place count 619 transition count 455
Reduce places removed 84 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 85 rules applied. Total rules applied 171 place count 535 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 534 transition count 454
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 172 place count 534 transition count 330
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 444 place count 386 transition count 330
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 474 place count 356 transition count 300
Iterating global reduction 3 with 30 rules applied. Total rules applied 504 place count 356 transition count 300
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 504 place count 356 transition count 296
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 514 place count 350 transition count 296
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 515 place count 349 transition count 295
Iterating global reduction 3 with 1 rules applied. Total rules applied 516 place count 349 transition count 295
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 291 rules applied. Total rules applied 807 place count 202 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 809 place count 201 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 810 place count 200 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 811 place count 199 transition count 149
Applied a total of 811 rules in 37 ms. Remains 199 /628 variables (removed 429) and now considering 149/548 (removed 399) transitions.
// Phase 1: matrix 149 rows 199 cols
[2024-05-22 00:37:33] [INFO ] Computed 87 invariants in 3 ms
[2024-05-22 00:37:33] [INFO ] Implicit Places using invariants in 160 ms returned [0, 1, 2, 3, 4, 12, 13, 14, 17, 18, 22, 23, 24, 25, 26, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 173 ms to find 27 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 172/628 places, 149/548 transitions.
Applied a total of 0 rules in 4 ms. Remains 172 /172 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 214 ms. Remains : 172/628 places, 149/548 transitions.
[2024-05-22 00:37:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:37:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:37:33] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-22 00:37:34] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:37:34] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:37:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality309836689573929195.gal : 1 ms
[2024-05-22 00:37:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality12041271591036132812.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/CTLCardinality309836689573929195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12041271591036132812.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,2.80771e+06,0.125945,9396,2,2783,5,16606,6,0,835,13684,0


Converting to forward existential form...Done !
original formula: EF(((p114==1) + EG(((p648==0)&&(p350==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p114==1))] != FALSE + [FwdG(FwdU(Init,TRUE),((p648==0)&&(p350==1)))] != FALSE)
(forward)formula 0,1,0.12663,9660,1,0,7,16606,8,1,838,13684,1
FORMULA BusinessProcesses-PT-19-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 548
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 597 transition count 518
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 597 transition count 518
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 588 transition count 509
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 588 transition count 509
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 587 transition count 508
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 587 transition count 508
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 586 transition count 507
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 586 transition count 507
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 585 transition count 506
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 585 transition count 506
Applied a total of 85 rules in 115 ms. Remains 585 /628 variables (removed 43) and now considering 506/548 (removed 42) transitions.
// Phase 1: matrix 506 rows 585 cols
[2024-05-22 00:37:34] [INFO ] Computed 117 invariants in 3 ms
[2024-05-22 00:37:34] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 00:37:34] [INFO ] Invariant cache hit.
[2024-05-22 00:37:35] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
Running 505 sub problems to find dead transitions.
[2024-05-22 00:37:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 505 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-05-22 00:37:47] [INFO ] Deduced a trap composed of 82 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:37:47] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:37:47] [INFO ] Deduced a trap composed of 110 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:37:47] [INFO ] Deduced a trap composed of 90 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:37:47] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:37:47] [INFO ] Deduced a trap composed of 101 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:37:48] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:37:48] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:37:48] [INFO ] Deduced a trap composed of 105 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:37:48] [INFO ] Deduced a trap composed of 96 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:37:48] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:37:48] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:37:49] [INFO ] Deduced a trap composed of 96 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:37:49] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 10 ms to minimize.
[2024-05-22 00:37:49] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:37:49] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:37:49] [INFO ] Deduced a trap composed of 124 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:37:49] [INFO ] Deduced a trap composed of 124 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:37:50] [INFO ] Deduced a trap composed of 102 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:37:50] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-05-22 00:37:50] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:37:50] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:37:50] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:37:50] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 111 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 114 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 106 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 109 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 126 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:37:51] [INFO ] Deduced a trap composed of 117 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 103 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 103 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 118 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 106 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 128 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:37:52] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 505 unsolved
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 101 places in 155 ms of which 4 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:37:53] [INFO ] Deduced a trap composed of 107 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 107 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 106 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 123 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:37:54] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 108 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 120 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 99 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 117 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:37:55] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 103 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:37:56] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 3 ms to minimize.
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 20/177 constraints. Problems are: Problem set: 2 solved, 503 unsolved
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 99 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 104 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:38:01] [INFO ] Deduced a trap composed of 113 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 134 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 4 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 125 places in 139 ms of which 6 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:38:02] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 109 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 108 places in 183 ms of which 5 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 104 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:38:03] [INFO ] Deduced a trap composed of 103 places in 181 ms of which 3 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 124 places in 131 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 20/197 constraints. Problems are: Problem set: 2 solved, 503 unsolved
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/1091 variables, and 198 constraints, problems are : Problem set: 2 solved, 503 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/585 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 2 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 44/44 constraints. Problems are: Problem set: 2 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 503 unsolved
At refinement iteration 2 (OVERLAPS) 1/585 variables, 71/115 constraints. Problems are: Problem set: 2 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/585 variables, 2/117 constraints. Problems are: Problem set: 2 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/585 variables, 81/198 constraints. Problems are: Problem set: 2 solved, 503 unsolved
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 113 places in 159 ms of which 4 ms to minimize.
[2024-05-22 00:38:10] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 107 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 117 places in 178 ms of which 4 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 107 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 2 ms to minimize.
Problem TDEAD409 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD451 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/585 variables, 20/218 constraints. Problems are: Problem set: 11 solved, 494 unsolved
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 4 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 126 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 87 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 97 places in 188 ms of which 3 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 99 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 116 places in 174 ms of which 4 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 118 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 119 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 125 places in 182 ms of which 3 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 123 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 79 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 83 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 20/238 constraints. Problems are: Problem set: 11 solved, 494 unsolved
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 108 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 99 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 110 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 99 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 118 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 124 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 121 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 127 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 112 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 3 ms to minimize.
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/585 variables, 20/258 constraints. Problems are: Problem set: 22 solved, 483 unsolved
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 109 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 87 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 110 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 105 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:38:23] [INFO ] Deduced a trap composed of 105 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:38:23] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:38:23] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:38:23] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:38:23] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:38:23] [INFO ] Deduced a trap composed of 111 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:38:24] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 20/278 constraints. Problems are: Problem set: 22 solved, 483 unsolved
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 108 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 111 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 110 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 109 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 109 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 108 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 126 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 120 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 129 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 111 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 126 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 120 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 20/298 constraints. Problems are: Problem set: 22 solved, 483 unsolved
[2024-05-22 00:38:29] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:38:29] [INFO ] Deduced a trap composed of 122 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:38:29] [INFO ] Deduced a trap composed of 137 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:38:29] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:38:29] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:38:29] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:38:30] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:38:30] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:38:30] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:38:30] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:38:30] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:38:30] [INFO ] Deduced a trap composed of 95 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:38:31] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:38:31] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:38:31] [INFO ] Deduced a trap composed of 111 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:38:31] [INFO ] Deduced a trap composed of 116 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:38:31] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:38:32] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:38:32] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:38:32] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 3 ms to minimize.
Problem TDEAD407 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 20/318 constraints. Problems are: Problem set: 25 solved, 480 unsolved
[2024-05-22 00:38:33] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:38:33] [INFO ] Deduced a trap composed of 124 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:38:33] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 125 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 125 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 126 places in 160 ms of which 18 ms to minimize.
[2024-05-22 00:38:35] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:38:35] [INFO ] Deduced a trap composed of 95 places in 215 ms of which 2 ms to minimize.
SMT process timed out in 60298ms, After SMT, problems are : Problem set: 25 solved, 480 unsolved
Search for dead transitions found 25 dead transitions in 60309ms
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 : 585/628 places, 481/548 transitions.
Applied a total of 0 rules in 14 ms. Remains 585 /585 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61265 ms. Remains : 585/628 places, 481/548 transitions.
[2024-05-22 00:38:35] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:38:35] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:38:35] [INFO ] Input system was already deterministic with 481 transitions.
[2024-05-22 00:38:35] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:38:35] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:38:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality13927538466044111649.gal : 2 ms
[2024-05-22 00:38:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality9190309949472228523.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/CTLCardinality13927538466044111649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9190309949472228523.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:39:05] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:39:05] [INFO ] Applying decomposition
[2024-05-22 00:39:05] [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/graph15887398222238628197.txt' '-o' '/tmp/graph15887398222238628197.bin' '-w' '/tmp/graph15887398222238628197.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15887398222238628197.bin' '-l' '-1' '-v' '-w' '/tmp/graph15887398222238628197.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:39:05] [INFO ] Decomposing Gal with order
[2024-05-22 00:39:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:39:05] [INFO ] Removed a total of 174 redundant transitions.
[2024-05-22 00:39:05] [INFO ] Flatten gal took : 38 ms
[2024-05-22 00:39:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 17 ms.
[2024-05-22 00:39:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality2411119088373971404.gal : 9 ms
[2024-05-22 00:39:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality9049547077433074536.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/CTLCardinality2411119088373971404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9049547077433074536.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24521e+33,2.69228,89640,5377,55,174999,723,1206,246986,67,1923,0


Converting to forward existential form...Done !
original formula: (AG(EX(((EF((i11.i1.u86.p249==0)) * (i11.i2.u190.p702==0)) * EX(((i11.i2.u189.p696==0)&&(i3.u23.p58==1)))))) + AG(EX(((EX((i18.i2.u136.p4...284
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !(EX(((E(TRUE U (i11.i1.u86.p249==0)) * (i11.i2.u190.p702==0)) * EX(((i11.i2.u189.p6...359
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t204, t289, t303, t311, t319, t396, t445, t449, t451, t454, t456, t458, t467, t475, ...1646
(forward)formula 0,0,9.37191,310608,1,0,693543,1033,9154,974613,372,3129,1887628
FORMULA BusinessProcesses-PT-19-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 628/628 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 627 transition count 548
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 593 transition count 514
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 593 transition count 514
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 80 place count 582 transition count 503
Iterating global reduction 1 with 11 rules applied. Total rules applied 91 place count 582 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 581 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 581 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 580 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 580 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 579 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 579 transition count 500
Applied a total of 97 rules in 118 ms. Remains 579 /628 variables (removed 49) and now considering 500/548 (removed 48) transitions.
// Phase 1: matrix 500 rows 579 cols
[2024-05-22 00:39:15] [INFO ] Computed 117 invariants in 9 ms
[2024-05-22 00:39:15] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-22 00:39:15] [INFO ] Invariant cache hit.
[2024-05-22 00:39:16] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2024-05-22 00:39:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 83 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:39:26] [INFO ] Deduced a trap composed of 105 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 103 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 81 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:39:27] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 108 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 103 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 103 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:39:28] [INFO ] Deduced a trap composed of 103 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:39:29] [INFO ] Deduced a trap composed of 102 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:39:29] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:39:29] [INFO ] Deduced a trap composed of 110 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:39:29] [INFO ] Deduced a trap composed of 107 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:39:29] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-22 00:39:30] [INFO ] Deduced a trap composed of 105 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:39:30] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:39:30] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:39:30] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:39:30] [INFO ] Deduced a trap composed of 120 places in 173 ms of which 3 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 91 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 91 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 81 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:39:31] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 110 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:39:32] [INFO ] Deduced a trap composed of 104 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 105 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 110 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:39:33] [INFO ] Deduced a trap composed of 104 places in 169 ms of which 4 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 108 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 106 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:39:34] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 110 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 117 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 118 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:39:35] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 120 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 103 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:39:36] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 3 ms to minimize.
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/177 constraints. Problems are: Problem set: 21 solved, 478 unsolved
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:39:40] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:39:41] [INFO ] Deduced a trap composed of 109 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:39:41] [INFO ] Deduced a trap composed of 118 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:39:41] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:39:41] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:39:41] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 104 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 101 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:39:42] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 5 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 99 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:39:43] [INFO ] Deduced a trap composed of 102 places in 138 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/197 constraints. Problems are: Problem set: 21 solved, 478 unsolved
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 100 places in 176 ms of which 4 ms to minimize.
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 114 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:39:44] [INFO ] Deduced a trap composed of 109 places in 202 ms of which 5 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 105 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 101 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:39:45] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:39:46] [INFO ] Deduced a trap composed of 126 places in 137 ms of which 3 ms to minimize.
SMT process timed out in 30198ms, After SMT, problems are : Problem set: 21 solved, 478 unsolved
Search for dead transitions found 21 dead transitions in 30206ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 579/628 places, 479/548 transitions.
Applied a total of 0 rules in 9 ms. Remains 579 /579 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31328 ms. Remains : 579/628 places, 479/548 transitions.
[2024-05-22 00:39:46] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:39:46] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:39:46] [INFO ] Input system was already deterministic with 479 transitions.
[2024-05-22 00:39:46] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:39:46] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:39:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality11881730866431718916.gal : 4 ms
[2024-05-22 00:39:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality17660667548072115693.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/CTLCardinality11881730866431718916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17660667548072115693.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:40:16] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:40:16] [INFO ] Applying decomposition
[2024-05-22 00:40:16] [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/graph16018758451266634645.txt' '-o' '/tmp/graph16018758451266634645.bin' '-w' '/tmp/graph16018758451266634645.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16018758451266634645.bin' '-l' '-1' '-v' '-w' '/tmp/graph16018758451266634645.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:40:16] [INFO ] Decomposing Gal with order
[2024-05-22 00:40:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:40:16] [INFO ] Removed a total of 191 redundant transitions.
[2024-05-22 00:40:16] [INFO ] Flatten gal took : 32 ms
[2024-05-22 00:40:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 10 ms.
[2024-05-22 00:40:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality6175529832937587314.gal : 7 ms
[2024-05-22 00:40:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality344812495650953208.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/CTLCardinality6175529832937587314.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality344812495650953208.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,1.24529e+33,8.25664,217920,10749,66,404714,834,1189,695448,73,2062,0


Converting to forward existential form...Done !
original formula: AF(AG(EX(EF((i20.u158.p664==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(EX(E(TRUE U (i20.u158.p664==0))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t201, t301, t305, t313, t342, t387, t390, t443, t447, t449, t451, t454, t456, t46...1563
Detected timeout of ITS tools.
[2024-05-22 00:40:47] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:40:47] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:40:47] [INFO ] Applying decomposition
[2024-05-22 00:40:47] [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/graph4336522936907280825.txt' '-o' '/tmp/graph4336522936907280825.bin' '-w' '/tmp/graph4336522936907280825.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4336522936907280825.bin' '-l' '-1' '-v' '-w' '/tmp/graph4336522936907280825.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:40:47] [INFO ] Decomposing Gal with order
[2024-05-22 00:40:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:40:47] [INFO ] Removed a total of 287 redundant transitions.
[2024-05-22 00:40:47] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:40:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-22 00:40:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality1184634439073457851.gal : 5 ms
[2024-05-22 00:40:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality13056912166425603010.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/CTLCardinality1184634439073457851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13056912166425603010.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.74142e+33,3.59777,116828,6420,79,214710,1259,1162,447107,85,4705,0


Converting to forward existential form...Done !
original formula: E(AX(AX((i12.u154.p485==0))) U AG((EF((EX((i3.u176.p590==1)) + AG(((i9.u166.p541==0)||(i14.u123.p363==1))))) * (i7.u54.p154!=1))))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(!(EX(!((i12.u154.p485==0)))))))) * !(E(TRUE U !((E(TRUE U (EX((i3.u176.p590==1)) + !(E(TRUE U...236
Reverse transition relation is NOT exact ! Due to transitions t8, t39, t43, t323, t347, t355, t388, t515, t517, t519, t520, t524, t525, i0.u104.t229, i0.u1...1876
(forward)formula 0,1,18.1845,544508,1,0,1.07964e+06,1259,8954,2.15846e+06,405,4705,2321160
FORMULA BusinessProcesses-PT-19-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(E(AX((i18.u148.p464==0)) U AF((i20.u179.p686==1))))
=> equivalent forward existential formula: [(FwdU(EY(Init),!(EX(!((i18.u148.p464==0))))) * !(EG(!((i20.u179.p686==1)))))] != FALSE
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 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 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
(forward)formula 1,0,183.273,2205900,1,0,3.45639e+06,1259,3414,1.13544e+07,175,4705,1768772
FORMULA BusinessProcesses-PT-19-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(E(((i16.u134.p404==1) + EF(((i9.u87.p252==0)||(i18.u44.p123==1)))) U AX((i8.u195.p666==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(((i16.u134.p404==1) + E(TRUE U ((i9.u87.p252==0)||(i18.u44.p123==1)))) U !(EX(!((i8.u195.p666==1)...170
(forward)formula 2,1,243.55,2427132,1,0,3.79844e+06,1259,3668,1.30128e+07,197,4705,760402
FORMULA BusinessProcesses-PT-19-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(((i2.u57.p161==0)||(i6.u51.p140==1)) U EG((EX(TRUE) * ((EX(EX((i20.u179.p577==1))) + AG((i1.i0.i0.u85.p243==0))) + ((i8.u66.p191!=0)||(...198
=> equivalent forward existential formula: [((Init * !(EG(!(EG((EX(TRUE) * ((EX(EX((i20.u179.p577==1))) + !(E(TRUE U !((i1.i0.i0.u85.p243==0))))) + ((i8.u6...587
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 3,0,345.365,2569372,1,0,4.06571e+06,1259,4309,1.37878e+07,233,4705,3371853
FORMULA BusinessProcesses-PT-19-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(AX(EG(((EG((i6.u48.p133==0)) + (i20.u179.p699==0)) + (i17.u141.p426==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(((EG((i6.u48.p133==0)) + (i20.u179.p699==0)) + (i17.u141.p426==1)))))] = FALSE
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-22 00:53:24] [INFO ] Applying decomposition
[2024-05-22 00:53:24] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:53:24] [INFO ] Decomposing Gal with order
[2024-05-22 00:53:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:53:24] [INFO ] Removed a total of 130 redundant transitions.
[2024-05-22 00:53:24] [INFO ] Flatten gal took : 40 ms
[2024-05-22 00:53:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 134 ms.
[2024-05-22 00:53:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality12206021900297021535.gal : 11 ms
[2024-05-22 00:53:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality1702552826898989500.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/CTLCardinality12206021900297021535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1702552826898989500.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 4 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 00:59:36] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:59:36] [INFO ] Input system was already deterministic with 548 transitions.
[2024-05-22 00:59:36] [INFO ] Transformed 628 places.
[2024-05-22 00:59:36] [INFO ] Transformed 548 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 01:00:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality3990117924251770298.gal : 5 ms
[2024-05-22 01:00:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality5549347920803142226.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/CTLCardinality3990117924251770298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5549347920803142226.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 4 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2871474 ms.

BK_STOP 1716340245494

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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